Arabian Journal for Science and Engineering

https://doi.org/10.1007/s13369-019-04271-1

RESEARCH ARTICLE - COMPUTER ENGINEERING AND COMPUTER SCIENCE

A Multi‑objective Hybrid Algorithm for Optimal Planning

of Distributed Generation
Ravi Shankar Pandey1 · S. R. Awasthi1

Received: 12 February 2019 / Accepted: 25 November 2019

© King Fahd University of Petroleum & Minerals 2020

Abstract
Distributed generations (DGs) have been constantly incorporating into the distribution systems. The optimal planning (siz-
ing and sitting) of the DGs by applying harmony search (HS)-based hybrid genetic algorithm integrated adaptive particle
swarm optimization (GA-APSO) technique is exhibited in this work. The fitness evolution function has investigated as the
multi-objective function (FMO), which depends on the five significant indexes such as active power loss, reactive power loss,
total cost generation index, voltage deviation, and load balancing index. The ideal solution has attained by minimizing the
multi-objective (MO) fitness function by deploying HS-based GA-PSO strategy. The projected work will be implemented
on IEEE standard 33- and 69-bus radial distribution networks. The performance of the suggested algorithm has analyzed
dependent on the five measures, such as active and reactive power loss, voltage profile improvement, reduction in voltage
deviation, and cost of operation of generation. The legitimacy of the assessed outcomes has affirmed by comparing with
some of the notable optimization algorithms.

Keywords  Distributed generation (DG) · Multi-objective function · Optimal planning · Optimal power flow · Harmony
search optimization · Hybrid GA-PSO · Active and reactive power loss, voltage deviation
List of Symbols 𝛿ji Angle of the jith element in bus
APG Active power generation authorization framework
RP( G  ) Reactive power generation n The aggregate number of buses
C APG Cost function of active power 𝜆APj , 𝜆RPj Costs of the active and the reactive
( ) generation power
C RPG Cost function of reactive power 𝜒 Joined or packaged power
generation RPD
ctj = AP j Constant
CG Aggregate cost generation Dj

APj , RPj  jth bus active and reactive power TCDG , TCNo_DG Total generation cost value with DG
stream and without DG
APDj , RPDj  jth bus active and reactive demand APLoss (ij) Active power loss index among the
Vi , Vj Extent esteem at the ith and jth bus bus i and j
APDGj Genuine power of DG placed at jth APij , RPij Active and reactive power that flows
from node i to node j
bus
APLj , RPLj Load associated with the node j
𝜃i , 𝜃j Angles of ith and jth bus voltage
EMji  jith element magnitude in bus RPLoss (ij) Reactive power loss index among
admittance matrix the bus i and j
Vref Reference voltage
VDGj System voltage
Pj Accessible power
* Ravi Shankar Pandey PDGj , PNO_DGj Available power with DG and
[email protected]
without DG
1
Department of Electrical Engineering, Rabindranath Pinj,j Infused power
Tagore University, Bhopal‑Chiklod Road, Raisen, Bhopal, ΔP Adjustment in power
Madhya Pradesh 464993, India

13
Vol.:(0123456789)
 Arabian Journal for Science and Engineering

p, v Position and the velocity of the frameworks for matrix support, decreasing power losses
particle in PSO and on-top working costs, enhancing voltage profiles and
Pbest Best past position of the ith particle load factors, acknowledging or eliminating the framework
Gbest Index of the best particle updates, and enhancing framework trustworthiness, unwa-
pc+1
i
, vc+1
i
Modified position and velocity vering quality, and effectiveness. They are moderately little
𝜔 Inertia weight factor (with respect to the power limit of the framework in which
k1 , k2 Acceleration coefficients they are set) and measured in structure [3]. DG (or decentral-
R1 , R2 Arbitrary numbers inside the range ized generation, scattered generation, and installed genera-
[0, 1] tion) is certainly not another idea; however, it is a developing
p(k)
i
, v (k)
i
 Current position and the velocity of methodology for giving electric power in the core of the
particle i in the search space at itera- power framework. It mainly relies on the establishment and
tion k activities of an arrangement of little size, minimized, and
𝜔max , 𝜔min Initial and final inertia weight clean electric power creating units at or close to an electrical
factors load (client) [4].
cmax Maximum iteration number DG is predicted to play an increasing role in the elec-
c Current iteration number tric power system of the near future. DG offers alternative
pi0 The introductory position of the ith planners to explore in their search for obtaining the best
particle solution in the electric supply problems and requires new
pmin , pmax Design variable’s lower and upper planning paradigms and procedures which are able to face a
bounds more complex and uncertain scenario [5]. This is especially
xworst Worst harmony vector imperative in the issue of the optimal siting and measuring
x′ New harmony vector of DG, where the uniqueness of the arranging destinations,
N Number of decision variables which may struggle one another (e.g., ventures cost versus
U Uniform random number generator the cost of the normal vitality not provided), tremendously
r1 , r2 New random numbers generated affects the scan for a feasible configuration [6]. DGs are set
within the range [0, 1] at optimal locations to limit misfortunes, line loadings, and
xijnew First decision variable in the new reactive power requirement. Improper DG placement may
vector expand framework misfortunes and system capital and oper-
xnew Harmony vector ating costs [7]. Optimal placement of DG units is resolved
APLDG , APLNO_DG Active power losses with DG and only for the different distributed load profiles to limit the
without DG aggregate misfortunes. They have iteratively expanded the
RPLDG , RPLNO_DG Reactive power losses with DG and extent of DG unit at all busses and afterward ascertained the
without DG misfortunes; in view of misfortune computation, they posi-
VPIDG , VPINO_DG Voltage profile improvement with tioned the hubs. Top-positioned nodes are chosen for DG
DG and without DG unit placement [8]. The optimal DG placement comprises
Vmeasured Measured voltage two sections. In the initial section, the power misfortune pur-
pose as one list named power loss reduction index is thought
Abbreviations about [9]. In the second part, the impact of DG on unwaver-
TCI Total cost index ing quality change of framework has been considered and it
BW Bandwidth factor is considered as one index named as reliability improvement
wf Weight factor index [10].
tc Time counter A few procedures were expected to put the DG frame-
works optimally. In [11], the authors acquainted an opti-
mal placement technique with the planning of DG in IEEE
1 Introduction 69-bus test framework by utilizing the PSO, in which the
target work was the multi-target function that considered
At present, the DG has been roughly characterized as small- dynamic and responsive power misfortunes of the frame-
scale electricity generation and is another idea in the finan- work and the voltage profile in a nominal load of the frame-
cial literature about electricity markets, yet the thought work. A novel combined genetic algorithm (GA)/particle
behind it is not new at all [1]. The idea is especially fascinat- swarm optimization (PSO) had been introduced in [12]
ing when various types of vitality assets are accessible, for for optimal area and estimating of DG on dissemination
example photovoltaic panels, power devices, or speed wind frameworks to limit and control misfortunes, better volt-
turbines [2]. DG gadgets can be deliberately set in control age direction and enhance the voltage stability within the

13
Arabian Journal for Science and Engineering

frame-work of system activity and security imperatives in algorithm was consolidated suitably with PSO till access to
radial distribution systems. The authors proposed a cost- adequate results of this activity.
based model to locate the optimal size and area of DG Biswas et al. [17] proposed a way to deal with simulta-
sources in a power dissemination framework utilizing ant neously minimizing the real power loss and the net reac-
colony optimization (ACO) algorithm to limit the cost of tive power flow in the system when reinforced with DGs
DG venture and the aggregate task cost of the framework in and shunt capacitors (SCs). With the proposed technique,
[13]. In [14], the authors created novel swarm intelligence the framework execution, unwavering quality, and stacking
optimization method called dragonfly algorithm in light of limit could be expanded by a decrease in misfortunes. A
swarming practices of dragonflies to understand DG place- multi-objective transformative algorithm based on deteriora-
ment and estimating issue on IEEE 33-bus experiment. To tion (MOEA/D) was embraced to choose optimal sizes and
locate the optimal area and limit of distributed energy stor- areas of DGs and SCs in vast scale dispersion systems with
age systems (DESSs) in the perspective of free framework goals being limiting framework real and receptive power
administrator (ISO), the paper [15] presents a structure for misfortunes. MOEA/D is the procedure of deterioration of a
extension arranging of distributed vitality stockpiling frame- multi-target optimization issue into a few scalar optimization
works (DESSs) and utilized some efficient a posteriori multi- sub-issues and optimizing those concurrently.
objective (MO) optimization algorithm. García and Mena [18] presented a technique which uti-
The paper is arranged as follows: Sect. 1: Introduction, lized a modified teaching–learning-based optimization
Section 2: Related Work, Sect. 3: Hypothetical knowledge (MTLBO) algorithm proposed to decide the optimal place-
about DG, Sect. 4: Proposed harmony search-based GA- ment and size of DG units in conveyance frameworks. For
PSO optimization algorithm for optimal placement of DG, lucidity, and without loss of generality, the target function is
Sect. 5: Outcome of the proposed algorithm in two test used to minimize total electrical power misfortunes, despite
frameworks, and Sect. 6: Conclusion. the fact that the issue could be effortlessly arranged as multi-
objective (other target capacities can be considered in the
meantime), where the optimal area of DG frameworks,
2 Related Work alongside their sizes, was simultaneously obtained. The
optimal DG webpage and size issue were demonstrated as a
2.1 Introduction mixed integer nonlinear programming issue. Developmental
techniques were utilized to take care of this issue in view
Research has shown that installation of DG sources in the of their independence from the kind of the target capacity
power distribution system could lead to achieve many ben- and requirements. As of late, another transformative strat-
efits, some of which are voltage profile improvement, reduced egy called teaching–learning-based optimization (TLBO)
lines losses, increased security for critical loads, grid rein- algorithm had been exhibited, which was adjusted and used
forcement, reduction in the on-peak operation cost, etc. Based to locate the best destinations to interface DG frameworks
on that, in recent years several studies consider techniques for in a distribution network, choosing among many potential
locating DG units on distribution systems for optimal benefit, combinations.
since it is essential to determine the optimal location and Ghosh et al. [19] introduced a straightforward technique
sizes of DG units to improve the distributed systems perfor- for optimal measuring and optimal placement of genera-
mance. Otherwise, it could lead to adverse effects such as tors. A basic traditional iterative search procedure alongside
increased power losses. It is observed that DG planning and Newton–Raphson strategy for load flow study was actualized
placement problem are highly nonlinear, non-convex com- on adjusted IEEE 6-bus, IEEE 14-bus, and IEEE 30-bus
plex problem. However, the task of finding the optimal sizes frameworks. The goal was to let down both cost and misfor-
and sites of DG units in the distribution system is not easy. tune viably. It additionally centered on optimization of the
In this regard, there have been different methodologies which weighting factor, which adjusted the cost and the misfortune
have been proposed for optimal placement of DGs. For solv- factors and develops desired targets with the most extreme
ing the DG placement optimization problem, several methods potential advantage.
were recommended in the literature as follows. El-Zonkoly [20] proposed a multi-target index-based
Varesi [16] proposed a PSO-based method for the opti- methodology for optimally deciding the size and area of
mal allocation of DG units in the power frameworks. In multi-DG units in circulation frameworks with various
this paper, the principal objective was to choose an optimal load models. It was demonstrated that the load models can
number, sort, size, and area of DG units for voltage profile fundamentally influence the optimal area and measuring of
change and power misfortune decrease in dispersion organ- DG assets in circulation frameworks. The proposed multi-
ize. Two sorts of DGs were considered, and the distribution target capacity to be optimized incorporated a short-out level
load flow was utilized to calculate the exact loss. Load flow parameter to represent the defensive gadget prerequisites.

13
 Arabian Journal for Science and Engineering

The proposed work likewise considered an extensive variety operator can only turn on or off the DG sources and cannot
of specialized issues, for example dynamic and responsive change their power productions.
power misfortunes of the framework, the voltage profile, the
line loading, and the mega volt ampere (MVA) allowed by
the network. An optimization method in light of PSO was 3 Distributed Generation (dg)
presented. An investigation of the continuation power flow
to decide the impact of DG units on the most delicate busses The requirement for more adaptable electric frameworks,
to voltage fall is done. changing administrative and financial situations, energy
The main objective of this research work of ODGP is savings, ecological effect, and the need to secure delicate
to provide the best locations and sizes of DGs to optimize burdens against network unsettling influences are giving
electrical distribution network operation and planning con- an impulse to the advancement of scattered generation and
sidering DG capacity constraints. From the above literature capacity frameworks in light of an assortment of advances.
review, we can know that several models and methods have Specifically, the term DG [21] suggests the utilization of
been suggested for the solution of the ODGP problem. The any modular technology that is sited all through a utility’s
techniques discussed in the above literature are MOEA/D administration region (interconnected to the conveyance
algorithm, MTLBO algorithm, PSO algorithm, New- or sub-transmission framework) to bring down the cost of
ton–Raphson strategy, and multi-target index-based meth- administration. DG can include a diesel or internal combus-
odology. Most of the above-mentioned algorithms result in tion engines, small gas turbines, power devices, and photo-
an increase in system losses, implying in an increase in costs voltaic (PV).
and, therefore, having an effect opposite to the desired. And Figure 1 demonstrates the sample distribution model of
these algorithms become less efficient when the number of the DG framework. The motivation behind these plants is
elements increases. The PSO algorithm has an increase in to adapt to the developing interest for electricity in specific
the difficulty during the selection of the parameters of the territories and render certain exercises independent regard-
algorithm. The MOEA/D algorithm has primarily concerned ing power creation in this way accomplishing vitality reserve
with finding the optimal locations of DG but failed to opti- funds. The fundamental purposes behind the increasingly
mize size. To overcome these issues, this paper presents a widespread use of dispersed generation can be summed up
model to determine optimal location and size of DGs in a as follows: DG units are nearer to clients with the goal that
distribution system which is solved using HS-based hybrid transmission and distribution (T&D) costs are maintained a
GA-PSO algorithm as the optimization tool which has the strategic distance from or lessened; the most recent innova-
following significances: tion has made accessible plants running in the limit from
10 kW to 15 MW. A few innovations have been perfected
• Significantly reduced the active and reactive power loss. and are broadly practiced (gas turbines, inward combus-
• Improves system voltage. tion motors), others are finding more extensive application
• Significantly reduced the voltage deviation of the distri- lately (wind, solar vitality), and some especially encouraging
bution network. advancements are presently being tested or propelled (power
• Reduces the generation cost which will be helpful to devices, sunlight-based boards integrated into structures); it
reduce the cost of power consumption. is less demanding to discover locales for small generators.

In this algorithm, DGs are considered as constant power

sources such as fuel cells. Therefore, the distribution system

Fig. 1  Sample distribution
network model

13
Arabian Journal for Science and Engineering

∑ ∑
4 Proposed Optimal Planning Strategy APDj + APLj − APDGj
n
∑ | ( )
In our proposed methodology, the harmony search-based −
| || ||
|Vj ||Vi ||EMji |cos 𝛿ji + 𝜃i − 𝜃j = 0 (6)
GA-PSO technique will be utilized for ideal estimating as | | |
i=1
|
well as the location for single and also multiple DGs for
active, reactive, and apparent power loss minimization in ∑ ∑
RPDj + RPLj − RPDGj
the distribution system. An enhancement strategy will be uti-
n
lized for registering the DG estimate, location; this technique ∑| | | | ( )
− |Vj |||Vi |||EMji |sin 𝛿ji + 𝜃i − 𝜃j = 0 (7)
initially will decide a set of locations for DG placement and | | |
i=1
|
after that the ideal size and location, and the expense of
task of DG.
𝜃min ≤ 𝜃j ≤ 𝜃max
4.1 Optimal Power Flow Vmin ≤ Vj ≤ Vmax
APmin ≤ APj ≤ APmax
The optimal power flow (OPF) [22] issue tries to control
RPmin ≤ RPj ≤ RPmax
the generation and the utilization of the loads to streamline
specific destinations, for example to limit the generation cost APDGmin ≤ APDGj ≤ APDGmax
or power loss in the system. It is ending up progressively RPDGmin ≤ RPDGj ≤ RPDGmax
essential for distribution networks because of the developing
DG and the controllable burdens. The OPF has been utilized
to limit the aggregate generation cost CG . The generation 4.1.1 Combined Real and Reactive Power for Uniform
cost remains characterized as a second-order polynomial Nodal Pricing
generation cost function. The cost function in light of the
active and reactive power generation cost is: Through judging, the jth dispatchable load is displayed as a
( ) ( ) ( ) consistent power factor, and thus the proportion of reactive
C APG = a + b ⋅ APG + c ⋅ AP2G (1) to the genuine demand is constant [23]. At that point, the
And also the cost function identified with the reactive genuine and the reactive power utilization of the load can be
power generation can be expressed as: the contemplation of as a single\combined or packaged item.
The uniform nodal value esteem can be communicated based
( ) ( ) ( )
C RPG = a� + b� ⋅ RPG + c� ⋅ RP2G (2) on per MW (megawatts) or per MVAR (mega volt amps
(reactive)). Let us assume that the load is situated at the bus
At that point, the minimization capacity of the aggregate j and the costs of the genuine and the reactive power are 𝜆APj
cost generation is expressed as: and 𝜆RPj separately. In this way, the joined or packaged power
G
∑ [ ( ) ( )] 𝜒 can be expressed as:
CG = min C APGk + C RPGk (3)
k=1
𝜒 = 𝜆APj APDj + 𝜆RPj RPDj (8)
The power balance equations without DG at jth bus (DG) ( )
is: RPDj
𝜒 = 𝜆APj APDj + 𝜆RPj APDj (9)
n APDj
∑ ∑ ∑ | || || | ( )
APDj + APLj − |Vj ||Vi ||EMji |cos 𝛿ij + 𝜃i − 𝜃j = 0
| | | |
i=1 ( )
(4) 𝜒 = 𝜆APj + 𝜆RPj ctj APDj (10)
n
∑ ∑ ∑ | || || | ( )
RPDj + RPLj − RPDj
|Vj ||Vi ||EMji |sin 𝛿ij + 𝜃i − 𝜃j = 0 where ctj = = constant . In addition, the per MW cost
| | | | APDj
i=1
(5) of the packaged commodity is 𝜆APj + ctj ∗ 𝜆RPj . Similarly,
Consequently, the imperatives with DG can be presented 𝜆APj
the per MVAR price is denoted as + 𝜆RPj.
as: ctj

13
 Arabian Journal for Science and Engineering

4.2 Problem Formulation for the Multi‑objective 4.2.3 Reactive Power Loss (RPL)

(MO) Function
The aggregate reactive power misfortune execution of the
The suggested DG placement technique has been analyzed framework has depicted as a result of the reactive power loss
as a cost-based streamlining capacity. It comprises a few (RPL) index. The receptive power misfortunes of the line N
index capacities, for example total generation cost index, between the buses i and j can be evaluated as:
active power loss index, reactive power loss index, voltage
Xij ( 2 )
deviation index, load balancing index, and shift factor index RPLoss (ij) = AP + RP2
(14)
ij ij
[24]. Thusly, this enhancement has been expressed as a MO Vi2
placement problem. The MO allows a superior re-enactment
of this present reality, regularly portrayed by differentiating APij and RPij has been spoken to in the above section, such
the objectives, and provides the organizer the capacity of as:
settling on an official conclusion by choosing in light of his � Xij ( �2 �2
)
individual perspective, the most exchange off the solution RPij = RPj + AP j
+ RP j (15)
Vj2
in an extensive variety of reasonable arrangements. On the
road to decide the ideal measuring and sizing of the DG in
where RPij = RPj + RPLj and RPLj means the load associated
�

the spiral and coincided framework with the different des-

with the node j.
tinations accomplishes by the accompanying MO function.
4.2.4 Voltage Deviation Index (VDI)
4.2.1 Total Generation Cost Index (CTI)
The voltage profile execution all through the framework has
The total cost index (CTI) provides the general financial
provided as a result of the voltage deviation index (VDI).
execution of the framework when the DG has introduced.
It tends to be given on the premise of the deviation of the
It is characterized by expecting TCDG and TCNo_DG are the
aggregate generation price value with DG and without DG (framework
) voltage from the reference or evaluated value
Vref  . The base VDI indicates better system performance
within the framework:
and the enhancement in the voltage profile. This record can
TCDG be given as:
TCI = (11)
TCNO_DG n
[ ( )]
1
VD = max V − VDGj
Vref ref (16)
j=2
4.2.2 Active Power Loss (APL)
where n is the aggregate number of buses. The terms Vref and
The active power loss (APL) index chooses the execution of VDGj mean the reference voltage and the system voltage
the dynamic influence loss of the entire framework in diverse esteem with DG separately.
cases. The APLs of the line N among the bus i and the bus
j can be predictable as: 4.2.5 Load Balancing Index (LBI)

Rij ( )
During the ongoing situation, the load request remains to
APLoss (ij) = AP2ij + RP2ij (12)
Vi2 expand step by step within the framework. Along these lines,
the administration and the adjustment of the load request are
where APij and RPij denotes the active and reactive power the real issues for the solid activity of the framework with
that courses throughout the branch N as of the node i to the the framework capacity limits. The load balancing index
node j can be inferred in (i) in the reverse compass bearing (LBI) has provided an idea in light of the accessible power
from the last node as: at any bus that remains disseminated among the loads in
Rij ( ) addition to the next bus. The accessible power at any bus
can be appeared as:
� � �2
APij = APj + APj2 + RPj (13)
Vj2 √
Pj = AP2j + RP2j (17)
where APij = APj + APLj and APLj means the load connected
�

at node j.

13
Arabian Journal for Science and Engineering

At that point, the LBI is denoted as: MO function = wf1 × CTI + wf2 × API + wf3 × RPI
[ ] + wf4 × VDI + wf5 × LBI + wf6 × SBI
n−1 PDGj
LBI = max (18) (21)
P
j=1 NO_DGj
where wf1 + wf2 + wf3 + wf4 + wf5 + wf6 = 1 , which can
be distinguished as indices weight factors. All these weight
where PDGj and PNO_DGj are the available power with DG and
factors are chosen the premise of the individual effects as
without DG, respectively, and n is the number of buses. well as the significance of the index while introducing the
DG. The fundamental point is to minimize the overall power
4.2.6 Shift Factor Index (SFI) losses of the framework.

The AC control stream shift factor likewise described as 4.3 Optimal Planning of DG Using HS‑Based Hybrid
a power transfer distribution factor (PTDF), which is the GA‑PSO Techniques
affectability of the power streams. As it were, it shows the
impacts of the power streams in each other lines because The ideal planning issues of the DG are planned as a MO-
of the specific power exchanges. The connection between compelled improvement issue. This paper utilizes a novel
PTDF and accessible transfer capacity (ATC) is the reverse HS-based combined GA-PSO for tackling the issues of the
connection; thus, the least PTDF demonstrates the most ideal planning of DG. The consequences were contrasted
extreme ATC. Let us a chance to assume that the adjustment with PSO and GA [26].
in the control because of a specific exchange ΔT is ΔP , and
after that, the AC control stream shift factor has denoted as: 4.3.1 Hybrid GA‑PSO Optimization Algorithm
ΔPr
SF = (19) This segment portrays the novel harmony search-based
ΔT
hybridized GA-PSO for taking care of ODGP issues. The
The establishment of DG with the specific size will infuse inspiration for creating PSO-GA [27] approach is to con-
some power as Pinj,j at the bus along with because of this solidate the benefit of the GA and the PSO algorithms. By
infusion the adjustment in power has represented as ΔP , at installing the hereditary administrators within the standard
that point the shift factor index (SFI) can be given as: PSO, the harmony among the investigation plus the abuse
n−1 capacity is enhanced further.
max | ΔPrj |
| |
SFI =
j=1
| |
| Prinj,j | (20) (i) Genetic Algorithm
| |
j ≠ slack and pvbus
In the GA algorithm [28], the populace has n chromosomes
To decide the ideal area and measuring of the DG in the that speak to the competitor solution; every chromosome is
radial as well as the meshed framework with various objec- an m-dimensional genuine esteem vector where m denotes the
tives accomplishes as a result of the accompanying MO number of streamlined parameters. Thusly, each enhanced
function [25]: parameter addresses an estimation of the issue space. The
algorithm for GA has been introduced underneath.

13
 Arabian Journal for Science and Engineering

(ii) Particle Swarm Optimization Algorithm g g g

Gbest = pi1best , pi2best , … , pinbest (25)
PSO [29] is a swarm intelligence algorithm, enlivened by
The adjusted velocity, as well as the position of every
the social elements as well as rising conduct that emerges
particle, can be figured according to the following equations:
in socially sorted-out settlements. PSO algorithm misuses
( ) ( )
a populace of individuals to test the promising areas of the vc+1 = wv (c)
+ k R P(c)
− p(c)
+ k R G(c)
− p(c)
pursuit space. In this unique circumstance, the populace i i 1 1 best i i
2 2 best i

has termed swarm in addition to that the individuals are (26)

described particles or specialists. In traditional PSO, parti- and
cles modify their positions (states) with time. Let p and v be
a chance to mean a particle organizes (position) and further- pi(c+1) = p(c)
i
+ vi(c+1) (27)
more its relating velocity in the search space separately. The
where 𝜔 signifies the inertia weight factor, k1 , k2 are the
position vector pi and the velocity vector vi of the ith particle
increasing speed coefficients, and R1 , R2 are two arbitrary
in the n-dimensional search space can be expressed as:
numbers inside the range [0, 1]. p(k)
i
, v(k)
i
are the position
{ }
pi = pi1 , pi1 , … , pi1 and (22) and the velocity of molecule i within the search space at
emphasis k, separately.
{ } On the whole, the inertia weight 𝜔 provides a harmony
vi = vi1 , vi1 , … , vi1 (23) among the global and the local investigations (control the
impact of the past history of the velocities on the present
The best past position of the ith particle is recorded and
one). It is set by the accompanying condition:
given as:
( )
p p p 𝜔max − 𝜔min
Pbest = pi1best , pi2best , … , pinbest (24) 𝜔 = 𝜔max − c (28)
cmax
The index of the best particle among each one of the par-
ticles in the gathering is expressed as: where 𝜔max , 𝜔min mean the underlying and last inertia
weight factors, cmax speaks to the most extreme emphasis

13
Arabian Journal for Science and Engineering

number, and c indicates the present cycle number. The con- position of every molecule is refreshed. Subsequently, form-
stants k1 and k2 pull every molecule in the direction of Pbest ing another generation in PSO cycles, a few particles of the
positions (a psychological segment of velocity) as well as new populace are chosen, and afterward, the GA has con-
the Gbest positions (a social segment of velocity). The posi- nected for every one of them independently. Since, populace
tion has refreshed as for Eq. (27). The algorithm for GA-
PSO has been introduced underneath.

Along these lines, the fundamental thought in PSO-GA is dimension of the molecule remains substantial, so as to spare
to combine the capacity of social reasoning in PSO with the the time, GA is not connected to the entire populace.
neighborhood seeking ability of GA. As GA and PSO both
are the populace-based algorithm, the crossover PSO-GA 4.3.2 Harmony Search Optimization Algorithm
approach has likewise a populace-based algorithm and thus
continues to locate the global solution. The harmony search algorithm (HSA) is another metaheuris-
The methodology has been begun from the initialization tic algorithm that imitates the musical improvisation pro-
stage, wherein the particles of the swarm and their relating cess wherein a gathering of musicians cobble together their
velocities are produced haphazardly over the hunting space, instrument’s pitch via looking for an ideal circumstance
i.e., introductory
( position) p0 of the ith particles arbitrarily is
i
of harmony as indicated by audio-aesthetic standard [30].
taken p0 ∼[ U pmin , ]pmax from a uniform conveyance within
i
Algorithm 4 demonstrates the pseudocode of the HSA along
the range pmin , pmax  , where pmin and pmax speak to the out- with the five principal strides. The means in the strategy of
line factor’s lower and upper limits individually. Be that as harmony search are as per the following:
it may, the velocity vector is utilized to refresh the present
position of every molecule in the swarm and it depends on (i) Initialize the issue and algorithm parameters.
the “memory” picked up by every particle, and in addition, (ii) Initialize the harmony memory (HM).
the learning is picked up by the swarm in general. In this (iii) Improvise another new harmony from HM (memory
manner, the position of every molecule in the swarm remains consideration, arbitrary consideration, and pitch adjust-
balanced by its own involvement and that of its( neighbors.
) ment).
The previous one is known as personal best Pbest posi-
tion, and the latter one is Gbest position. After the cycle, the

13
 Arabian Journal for Science and Engineering

(iv) Update HM if the new harmony is superior to the mini- (a) Harmony Memory Considering (HMC) Rule
mum harmony in HM, incorporate the new harmony in   For this rule, another arbitrary number r1 has
HM, and prohibit the base amicability from HM. produced inside the range [0, 1]. If r1 < HMCR ,
(v) Check the halting measure. On the off chance that halt- where HMCR is the harmony memory considera-
ing criteria are not fulfilled, go to the step (iii).

The procedure of HSA algorithm has been outlined tion rate, at that point then the principal decision
subsequently. variable in the new vector xijnew has picked haphaz-
ardly from the qualities in the present HM as
(i) Initialization of harmony memory { }
xijnew = xij , xij ∈ x1j , x2j , x3j , … , xHMSj (30)
The underlying populace HM contains HMS vectors
that have been produced haphazardly, where xi = xij  , (b) Pitch Adjusting Rate (PAR)
i = {1, 2, … , HMS} , and j = {1, 2, … , n} . The HM matrix   The acquired decision variables as of the HMC
has loaded up with HMS vectors as: rule have additionally inspected toward deciding
whether it necessitates to pitch alteration or not.
x11 x12 x13 … x1n Another arbitrary number r2 has generated inside
HM = ⋮ ⋮ ⋮ ⋮ ⋮ (29) the range [0, 1]. If r2 < PAR , where PAR is a pitch
xHMS 1 xHMS2 xHMS3 … xHMS n adjustment rate, at that point the PA decision vari-
able is computed as follows:
(ii) Improvisation of new harmony vectors xijnew = xij , ±rand(0, 1) ⋅ BW (31)

13
Arabian Journal for Science and Engineering

Fig. 2  Single line diagram of

a 33-bus radial distribution
network

Fig. 3  Active and reactive power loss with and without DG for the 33-bus radial system

 where BW is a transmission capacity factor that (iii) Harmony Memory Uploading

is utilized en route to control the nearby inquiry
around the chosen decision variable in the new After the harmony vector xnew has created, it will supplant
vector. the most noticeably awful harmony vector xworst in the HM
(c) Random Initialization Rule if its objective function esteem is superior to the objective
  In the event that the condition r2 < HMCR function estimation of the most exceedingly awful harmony
comes up short, the new first decision variable in vector:
the new factor xijnew is produced arbitrarily as fol- ( )
If xnew < xworst then
lows:
( ) Update the HM as xworst = xnew (33)
xijnew = lij + uij − lij , rand(0, 1) (32) End if

 where l, u indicate the lower and upper bound

for the given issue.

13
 Arabian Journal for Science and Engineering

4.3.3 Proposed HS‑Based Hybrid GA‑PSO algorithm

Harmony search-based hybrid GA-PSO algorithm is a hunt-

ing system expanded for the ideal placement of DG. The
issue comprises two sections: First is the ideal location
of DG, and the second is the ideal sizing of DG. Conse-
quences for the initial segment are a whole number which
is either a bus number where the DGs are recommended to
be embedded.
This necessitates an integer-based streamlining algorithm.
The GA has been assumed in this job in light of its appealing
eminence. The appropriate response acquired from the GA
arrangement has utilized in the PSO algorithm to improve
the measuring for DG. PSO has the quick union capacity Fig. 4  The voltage profile with and without DG for 33-bus radial sys-
which is an incredibly alluring possession for an expansive tem
iterative and time-consuming issue. Algorithm 4 shows the
interaction between the three algorithms.

The procedure of the suggested harmony search-based (vi) Update the estimations of crossover and the velocity
GA-PSO enhancement algorithm is as pursues. values.

(i) Initialization.
(ii) Fitness computation utilizing the harmony search 5 Results and Discussion
algorithm.
(iii) Time updating. The offered ideal placement and estimation of DG methodol-
(iv) Calculation of the fitness function by means of har- ogy have been executed in the MATLAB and tested for a few
mony search-based GA-PSO. power frameworks. The rating of the active power of the DG
(v) Estimate the best fitness significance. and the power factor are 1.2 MW and 1, respectively. The

13
Arabian Journal for Science and Engineering

Fig. 5  The nodal price of active and reactive power with and without DG for the 33-bus radial system

Fig. 6  The total generation cost curve at buses with DG for the

33-bus radial system Fig. 8  The variation of DG size and system losses with MO function
for the 33-bus radial system

for the re-enactment of ideal placement of DG in any radial

dissemination frameworks.

5.1 Test Systems

Two systems taken for the verification of the above-said ana-

lytical method are as follows:

(i) 33-bus radial system and

(ii) The 69-bus radial system is presented and discussed.
(i) 33-bus radial system

Fig. 7  The variation of MO function and various indices at different

A 33-bus radial dissemination framework with 33
buses for the 33-bus radial system
branches has been considered with the aggregate active
power load of 3.715 MW and a reactive load of 2.3 MVAR.
enhancement has been carried out utilizing HS-based hybrid The proposed technique has confirmed on a 69-bus radial
GA-PSO programming package which has been composed conveyance framework as shown in Fig. 2. A 69-bus radial

13
 Arabian Journal for Science and Engineering

Table 1  The value of the multi- Bus no Objective func- CTI APL RPL LBI VDI SFI
objective function (FMO) and tion (FMO)
indices at buses for the IEEE
33-bus radial system 1 1 ∞ 1.7924 0.6055 ∞ 0 1
2 1.7062 3.6140 1.8013 0.6102 1.1654 0.00000016874 1.0045
3 1.4774 2.8596 1.7787 0.6101 1.1906 0.00000089269 1.0172
4 1.0824 1.4083 1.6206 0.5827 1.1048 0.0000016469 0.9627
5 1.0333 1.3316 1.5027 0.4402 1.1841 0.0000023927 0.9339
6 1.0275 1.3115 1.472 0.4233 1.1838 0.0000042474 0.9033
7 1.0147 1.0137 1.4645 0.4184 1.0512 0.000004599 0.8401
8 1.0144 1.0134 1.4531 0.4166 1.0499 0.000005971 0.8261
9 1.0581 1.0070 1.4458 0.4148 1.1739 0.0000066071 0.7810
10 1.054 1.0025 1.4034 0.2659 1.1578 0.0000071954 0.7602
11 1.0621 1.0025 1.3976 0.2495 1.1820 0.0000072829 0.7417
12 1.0466 1.0024 1.3811 0.2018 1.1360 0.0000074356 0.7388
13 1.0446 1.0022 1.3633 0.1578 1.1298 0.0000080553 0.7337
14 1.0212 1.0022 1.3512 0.1328 1.0605 0.0000082842 0.7145
15 1.0481 1.000167 1.3388 0.1165 1.1385 0.000008427 0.7075
16 1.046 1.000166 1.3363 0.1141 1.1322 0.0000085656 0.7031
17 1.0454 1.000163 1.3314 0.1096 1.1304 0.00000877 0.6989
18 1.0297 1.000163 1.3312 0.1096 1.0836 0.0000088315 0.6926
19 1.0321 1.000177 1.3602 0.1053 1.0908 0.00000022189 0.9701
20 1.0317 1.000175 1.3555 0.1028 1.0896 0.00000058175 0.9910
21 1.0311 1.000172 1.3492 0.0990 1.0881 0.00000065259 0.9769
22 1.0311 1.000172 1.3487 0.0988 1.0880 0.00000071666 0.9741
23 1.0292 1.000168 1.3408 0.0968 1.0823 0.00000055963 0.9460
24 1.0074 1.000163 1.3311 0.0927 1.0177 0.00000021906 1.0349
25 1.007 1.000152 1.3091 0.0848 1.0165 0.00000011551 1.0083
26 1.0392 1.000144 1.2917 0.0819 1.1120 0.0000044407 0.8456
27 1.0394 1.000141 1.2853 0.0803 1.1126 0.0000046977 0.8335
28 1.0404 1.000145 1.2948 0.1158 1.1163 0.000005848 0.8233
29 1.013 1.000096 1.1942 0.0173 1.0351 0.0000066742 0.7850
30 1.0031 1.000082 1.1668 0.0072 1.0066 0.0000070311 0.7584
31 1.009 1.000076 1.1542 0.0070 1.0235 0.0000074508 0.7468
32 1.005 1.000056 1.1127 0.0064 1.0122 0.0000075432 0.7336
33 1.0055 1.000031 1.0635 0.0059 1.0223 0.0000075718 0.7307

distribution framework comprises 69 branches. The aggre- be supplied. Reactive power is used to provide the voltage
gate genuine power loads and reactive power stacks on the levels necessary for active power to do useful work.
69-bus radial appropriation framework are 3.80 MW and Figure 4 demonstrates the estimations of the voltage pro-
2.69 MVAR individually. file with and without DG in the 33-bus radial system. The
The active and reactive power misfortunes with DG voltage profile esteems with DG is more when contrasted
acquire the lower value when contrasted with the without- with the without-DG condition of the 33-bus radial system.
DG state of the 33-bus radial framework which is shown It illustrates that the estimations of the voltage profile with
in Fig. 3. From the figures, the estimations of active and DG are higher than the voltage profile without DG.
reactive power with DG remain more noteworthy than with- Figure 5 shows the examination of the nodal cost for both
out utilizing DG. It only presents in AC power if there is active and the reactive power with and without DG for the
any phase difference between instantaneous current and 33-bus radial system. The nodal price value for active and
instantaneous voltage. During complete cycle, average reactive power with DG acquires the lower value when con-
reactive power is zero. High enough, active power cannot trasted with the without-DG condition of the 33-bus radial

13
Arabian Journal for Science and Engineering

Fig. 9  Single-line diagram of IEEE 69-bus distribution system

The generation cost has been ascertained for each bus in the
33-bus framework.
The MO function and diversity indices are shown in
Fig. 7 for the distinctive number of buses in the 33-bus radial
system. It likewise delineates the variety of each index that
has been located in the MO function.
The MO function with various dimensions of DG and
with various framework misfortunes intended for the 33-bus
radial framework is shown in Fig. 8.
Table 1 gives possible optimal solution results of the pro-
posed harmony search-based hybrid GA-PSO optimization
technique on each and every bus excluding the slack bus
within the 33-bus radial system. These results conclude that
the optimal value of the multi-objective function is 1 at the
Fig. 10  The voltage profile with and without DG for the 69-bus radial bus 1, which is the more optimal value from all of the buses.
system The corresponding values of the multi-objective functions
such as the values of CTI, APL, RPL, LBI, VDI, and SFI are
obtained as∞ , 1.7924, ∞ , 0, and 1, respectively, at the bus 1.
The radial 69-bus framework remains judged to demon-
system. For the large-scale systems, there is a complexity strate that the technique locates sound for higher bus sys-
in the nodal price computation process and it does not help tems also. Simulation work is done on a 69-bus outspread
to achieve the aspired level of DG penetration. So for some conveyance feeder to approve the viability of the proposed
busses, the nodal price becomes zero. If the nodal price is strategy (Fig. 9).
equal to zero, it will provide a suitable framework for DG Figure 10 shows the estimations of the voltage profile
integration in electricity markets rather than the other gen- with and without DG in the 69-bus radial system. The volt-
erators. And it can minimize the total system cost. age profile esteems with DG is more as compared to the
Figure 6 shows the curve for the aggregate generation without-DG state of the 69-bus radial system. It esteems
cost of buses with DG for the 33-bus outspread framework. that the estimations of the voltage profile with DG are higher
than the voltage profile without DG.

13
 Arabian Journal for Science and Engineering

Fig. 11  The nodal price of active and reactive power with and without DG for the 69-bus radial system

Fig. 14  The variation of DG size and system losses with MO function

Fig. 12  The total generation cost curve at buses with DG for the
value of the 69-bus radial system
33-bus radial system

In the figure, the estimations of active and reactive power

with DG are more noteworthy than without utilizing DG.
The nodal price value for active and reactive power mis-
fortune with DG acquires the lower value when contrasted
with the without-DG condition of the 69-bus outspread
framework.
Figure 12 shows the curve for the aggregate generation
price of different buses with DG for the 69-bus radial frame-
work. The generation price has been ascertained for each bus
in the 69-bus system.
Figure 13 demonstrates the MO function and diversity
indices for various numbers of buses in the 69-bus radial
framework. It additionally represents the variety of each
Fig. 13  The variation of MO function and various indices at different index that has been positioned in the MO function of our
buses for the 69-bus radial system proposed methodology.

The correlation of the nodal price for both active and

the reactive power with and without DG for the 69-bus out-
spread system is shown in Fig. 11.

13
Arabian Journal for Science and Engineering

Table 2  The value of the multi- Bus no Objective function (FMO) CTI APL RPL LBI VDI SFI
objective function (FMO) and
indices at buses for a 69-bus 1 0.000000000000001 ∞ 1.1056 1.1056 ∞ 0 1
radial system
2 0.000000000000001 ∞ 1.1102 1.1102 ∞ 0.0000000017163 1.0000
3 0.000000000000001 ∞ 1.1102 1.1102 ∞ 0.0000000034326 0.99999
4 0.000000000000001 ∞ 1.0827 1.0827 ∞ 0.000000007881 1.0000
5 0.000000000000001 ∞ 0.9402 0.9402 ∞ 0.000000033416 1.0017
6 0.1 ∞ 0.9233 0.9233 12.7345 0.0000003074 1.0210
7 0.1 ∞ 0.9184 0.9184 0.8525 0.00000059177 1.0109
8 0.1 ∞ 0.9166 0.9166 0.4623 0.00000065734 0.9821
9 0.1 ∞ 0.9148 0.9148 1.1437 0.00000068733 0.9769
10 0.2412 0.3436 0.7659 0.7659 0.8236 0.0000011809 0.9725
11 0.0463 0.3225 0.7495 0.7495 0.1469 0.0000012896 0.9535
12 0.0391 0.2608 0.7018 0.7018 0.1197 0.0000016014 0.9492
13 0.5164 0.2039 0.6578 0.6578 1.7830 0.0000018898 0.9373
14 0.4251 0.1716 0.6328 0.6328 1.4639 0.0000021756 0.9264
15 0.000000000000001 0.1506 0.6165 0.6165 ∞ 0.0000024585 0.9157
16 0.0713 0.0863 0.6141 0.6141 0.2248 0.0000025111 0.9052
17 0.0562 0.0272 0.6096 0.6096 0.1695 0.0000025979 0.9032
18 0.0562 0.0272 0.6096 0.6096 0.1695 0.0000025987 0.9000
19 0.000000000000001 0.0261 0.6053 0.6053 ∞ 0.0000026445 0.9000
20 2.7242 0.0255 0.6028 0.6028 9.4791 0.0000026739 0.8983
21 0.0194 0.0246 0.5990 0.5990 0.0761 0.0000027214 0.8972
22 0.5038 0.0245 0.5988 0.5988 1.7422 0.0000027221 0.8955
23 0.000000000000001 0.0240 0.5968 0.5968 ∞ 0.0000027291 0.8954
24 0.0690 0.0230 0.5928 0.5928 0.2904 0.0000027445 0.8952
25 0.000000000000001 0.0210 0.5848 0.5848 ∞ 0.0000027612 0.8946
26 0.1358 0.0203 0.5819 0.5819 0.5138 0.0000027681 0.8940
27 0.1332 0.0199 0.5803 0.5803 0.5041 0.00000277 0.8937
28 0.1147 0.0287 0.6158 0.6158 0.3887 0.0000000041278 0.9996
29 0.0207 0.0043 0.5173 0.5173 0.0591 0.000000011343 0.9998
30 0.000000000000001 0.0018 0.5072 0.5072 ∞ 0.000000023531 0.9995
31 0.000000000000001 0.0017 0.5070 0.5070 ∞ 0.000000025682 0.9990
32 0.000000000000001 0.0016 0.5064 0.5064 ∞ 0.000000036435 0.9989
33 0.0151 0.0014 0.5059 0.5059 0.0380 0.000000062215 0.9985
34 0.0114 0.0011 0.5047 0.5047 0.0217 0.000000095972 0.9975
35 0.0227 0.0008 0.5035 0.5035 0.0543 0.00000010276 0.9961
36 0.1232 0.0315 0.6268 0.6268 0.4252 0.0000000048211 0.9997
37 0.0243 0.0075 0.530 0.5302 0.1028 0.000000022102 0.9998
38 0.000000000000001 0.0057 0.5231 0.5231 ∞ 0.000000038051 0.9991
39 0.0335 0.0055 0.5224 0.5224 0.0832 0.000000042655 0.9984
40 0.0334 0.0055 0.5224 0.5224 0.0829 0.000000042878 0.9982
41 0.2892 0.0035 0.5141 0.5141 0.9867 0.00000011307 0.9982
42 0.000000000000001 0.00335 0.5135 0.5135 ∞ 0.00000014249 0.9954
43 0.0587 0.0035 0.5134 0.5134 0.1986 0.00000014637 0.9943
44 0.000000000000001 0.0033 0.5134 0.5134 ∞ 0.00000014721 0.9941
45 0.0160 0.0032 0.5132 0.5132 0.0305 0.00000015712 0.9941
46 0.0160 0.0032 0.5132 0.5132 0.0305 0.00000015716 0.9937
47 0.000000000000001 0.0769 0.8098 0.8098 ∞ 0.0000000129 0.9996
48 0.0439 0.0331 0.6332 0.6332 0.1468 0.00000013776 0.9994
49 0.0094 0.0285 0.6150 0.6150 0.0261 0.00000052295 0.9944
50 0.0086 0.0258 0.6041 0.6041 0.0236 0.00000057753 0.9792
51 0.2308 0.0931 0.8747 0.8747 0.7825 0.00000066085 0.9728

13
 Arabian Journal for Science and Engineering

Table 2  (continued) Bus no Objective function (FMO) CTI APL RPL LBI VDI SFI

52 1.836 0.0682 0.7745 0.7745 6.3869 0.0000006618 0.9738

53 2.0652 0.0968 0.8897 0.8897 7.1856 0.00000067315 0.9961
54 0.3412 0.0916 0.8687 0.8687 1.1704 0.00000065582 0.9857
55 0.3553 0.0863 0.8474 0.8474 1.2185 0.00000062508 0.9914
56 0.000000000000001 0.0824 0.8318 0.8318 ∞ 0.00000058883 0.9924
57 0.000000000000001 0.0718 0.7891 0.7891 ∞ 0.00000039731 1.0656
58 0.000000000000001 0.0691 0.7782 0.7782 ∞ 0.00000030291 1.0282
59 0.0401 0.0682 0.7747 0.7747 0.2334 0.00000026635 1.0049
60 0.000000000000001 0.0670 0.7696 0.7696 ∞ 0.00000019084 1.0107
61 0.0032 0.0370 0.7636 0.7636 0.0180 0.000000081809 1.0238
62 0.1974 0.0364 0.7595 0.7595 0.6909 0.00000010839 0.9967
63 0.000000000000001 0.0356 0.7536 0.7536 ∞ 0.00000014398 0.9956
64 0.0227 0.0321 0.7287 0.7287 0.0864 0.00000031838 0.9942
65 0.0789 0.0276 0.6967 0.6967 0.2877 0.00000037109 0.9873
66 0.3119 0.0317 0.7256 0.7256 1.0715 0.0000012952 0.9382
67 0.3112 0.0316 0.7250 0.7250 1.0691 0.0000012953 0.9491
68 0.1451 0.0222 0.6582 0.6582 0.4900 0.000001634 0.9282
69 0.7486 0.0222 0.6580 0.6580 0.4894 0.0000016341 0.9362

Figure 14 demonstrates our MO function with numer- It can be expressed by considering APLDG and APLNO_DG
ous sizes of DG as well as with various misfortunes for the as the active power losses with DG and without DG of the
69-bus radial system. system:
Table 2 gives possible optimal solution results on each
APLDG
and every bus excluding the slack bus within the 69-bus APL = (34)
radial system. APLNO_DG

5.2 Performance Measures
(i) Reactive Power Loss (RPL) Index
The performance of the proposed harmony search-based
It is given by considering RPLDG and RPLNO_DG as
hybrid GA-PSO has been analyzed based on the five meas-
the reactive power losses with DG and without DG of the
ures, namely:
system:
(i) Active power loss (APL) index RPLDG
(ii) Reactive power loss (RPL) index
RPL = (35)
RPLNO_DG
(iii) Voltage profile improvement
(iv) Voltage deviation
(ii) Voltage Profile Improvement
(v) Cost of operation and generation
Voltage profile enhancement has been characterized as
These are the five measures used in the proposed strategy the proportion of the voltage profile of the framework with
which have been reduced. DG to a similar measure with no DG employed. Anyway,
the voltage profile is thought to be directly related to the
1. Active Power Loss (APL) Index bus voltages and henceforth does not speak to the genuine
picture of the voltage sizes at various nodes.
VPIDG
VPI = (36)
VPINO_DG

13
Arabian Journal for Science and Engineering

(iii) Reduction in Voltage Deviation References

Voltage deviation is a power quality concern. Excessively 1. Pepermans, G.; Driesen, J.; Haeseldonckx, D.; Belmans, R.;
substantial voltage deviations cause dependability issues that D’haeseleer, W.: Distributed generation: definition, benefits, and
must be evaded to guarantee the great activity of electric issues. Energy Policy 33(6), 787–798 (2005)
machines. It can be characterized as the distinction among 2. Guerrero, J.M.; Vicuna, L.G.D.; Matas, J.; Castilla, M.; Miret, J.:
A wireless controller to enhance dynamic performance of parallel
the ostensible voltage and the real voltage. The smaller the inverters in distributed generation systems. IEEE Trans. Power
deviation of bus voltage from the ostensible voltage, the bet- Electron. 19(5), 1205–1213 (2004)
ter the voltage state of the framework. 3. Wang, C.; Nehrir, M.H.: Analytical approaches for optimal place-
ment of distributed generation sources in power systems. IEEE
Vmeasured − Vn Trans. Power Syst. 19(4), 2068–2076 (2004)
Voltage deviation = × 100% (37)
Vn 4. El-Khattam, W.; Salama, M.M.A.: Distributed generation tech-
nologies, definitions, and benefits. Electr. Power Syst. Res. 71(2),
119–128 (2004)
(iv) Cost of Operation of Generation 5. Celli, G.; Ghiani, E.; Mocci, S.; Pilo, F.: A multi-objective evolu-
tionary algorithm for the sizing and siting of distributed genera-
The operation cost of DG units incorporates the expense tion. IEEE Trans. Power Syst. 20(2), 750–757 (2005)
of fuel and maintenance. Operation cost of DG units incor- 6. Quezada, M.V.H.; Abbad, J.R.; Roman, T.G.S.: Assessment of
energy distribution losses for increasing penetration of distributed
porates the expense of fuel and the maintenance. Toward
generation. IEEE Trans. Power Syst. 21(2), 533–540 (2006)
obtaining the infiltration level of DG for limiting the aggre- 7. Georgilakis, P.S.; Hatziargyriou, N.D.: Optimal distributed gener-
gate expense of operation including settled and variable ation placement in power distribution networks: models, methods,
expense. DG with operating cost higher than LMP will and future research. IEEE Trans. Power Syst. 28(3), 3420–3428
(2013)
locate no motivating force for the situation. The DG with
8. Injeti, K.S.; Kumar, N.P.: Optimal planning of distributed gen-
operating cost lower than those awaited through the supplier eration for improved voltage stability and loss reduction. Int. J.
provider is relied upon to have higher penetration. Comput. Appl. 15(1), 40–46 (2011)
9. Mohammadi, M.; Nasab, M.A.: PSO based multi-objective
approach for optimal sizing and placement of distributed genera-
tion. Res. J. Appl. Sci. Eng. Technol. 2(8), 832–837 (2011)
6 Conclusion 10. Celli, G.; Ghiani, E.; Mocci, S.; Pilo, F.: A multiobjective evolu-
tionary algorithm for the sizing and siting of distributed genera-
DGs have been ceaselessly coordinated into the dispersion tion. IEEE Trans. Power Syst. 20(2), 750–757 (2005)
11. Afraz, A.; Malekinezhad, F.; Shenava, S.J.S.; Jlili, A.: Optimal
frameworks. Sizing and the locating of DGs have a signifi-
sizing and sitting in a radial standard system using pso. Am. J.
cant effect that the framework makes power losses reduction Sci. Res. 67, 50–58 (2012)
and voltage profile improvement in the outspread DGs. In 12. Aman, M.M.; Jasmon, G.B.; Bakar, A.H.A.; Mokhlis, H.: A new
our proposed work, two sorts of swarm-based and evolu- approach for optimum simultaneous multi-DG distributed genera-
tion Units placement and sizing based on maximization of sys-
tionary algorithms to be specific harmony search-based
tem loadability using HPSO (hybrid particle swarm optimization)
hybrid GA-PSO optimization strategy have been used for algorithm. Energy 66, 202–215 (2014)
DG placement issue. The proposed hybrid optimization 13. Falaghi, H.; Haghifam, M.-R.: ACO based algorithm for distrib-
methodology has been developed for both the 33- and the uted generation sources allocation and sizing in distribution sys-
tems. In: Power Tech, 2007 IEEE Lausanne, IEEE, pp. 555–560
69-bus radial frameworks. This methodology has executed
(2007).
as a MO function. The outcomes gotten by the optimiza- 14. Amin, A.A.; Patel, R.K.; Vasavada, M.R.: Optimal placement and
tion technique will be compared with the operation of the sizing of distributed generation in the distribution power system
grid with and without utilizing DGs regarding active and using dragonfly algorithm. Int. J. Innov. Res. Electr. Electron.
Instrum. Control Eng. 5(4), 197–203 (2017)
reactive power loss, voltage profile improvement, diminu-
15. Saber, H.; Moeini-Aghtaie, M.; Ehsan, M.: Developing a multi-
tion in the voltage deviation, and cost for the operation of objective framework for expansion planning studies of distributed
generation. energy storage systems (DESSs). Energy 157, 1079–1089 (2018)
The outcomes investigation clears up that the proposed 16. Varesi, K.: Optimal allocation of dg units for power loss reduction
and voltage profile improvement of distribution networks using
technique is the more successful towards enhancing the
PSO algorithm. World Acad. Sci. Eng. Technol. 60, 1938–1942
performance of the framework, for example, power loss (2011)
reduction, voltage profile improvement, enhancing the 17. Biswas, P.P.; Mallipeddi, R.; Suganthan, P.N.; Amaratunga,
load balancing capacity, great economy, and optimal shift G.A.J.: A multi-objective approach for optimal placement and
sizing of distributed generators and capacitors in the distribution
factor value hence increases ATC and reduction in MVA
network. Appl. Soft Comput. 60, 268–280 (2017)
streams and MVA consumption from the framework or
the network.

13
 Arabian Journal for Science and Engineering

18. García, M.J.A.; Mena, A.J.G.: Optimal distributed generation 25. Bohre, A.K.; Agnihotri, G.; Dubey, M.; Kalambe, S.: Impacts of
location and size using a modified teaching–learning-based opti- the load models on optimal planning of distributed generation in
mization algorithm. Int. J. Electr. Power Energy Syst. 50, 65–75 distribution system. Adv. Artif. Intell. 2015, 6 (2015)
(2013) 26. Garg, Harish: A hybrid PSO-GA algorithm for constrained opti-
19. Ghosh, S.; Ghoshal, S.P.; Ghosh, S.: Optimal sizing and placement mization problems”. Appl. Math. Comput. 274, 292–305 (2016)
of distributed generation in a network system. Int. J. Electr. Power 27. Moradi, H.M.; Abedini, M.: A combination of genetic algorithm
Energy Syst. 32(8), 849–856 (2010) and particle swarm optimization for optimal DG location and
20. El-Zonkoly, A.M.: Optimal placement of multi-distributed genera- sizing in distribution systems. Int. J. Electr. Power Energy Syst.
tion units including different load models using particle swarm 34(1), 66–74 (2012)
optimization. Swarm Evol. Comput. 1(1), 50–59 (2011) 28. Moradi, H.M.; Zeinalzadeh, A.; Mohammadi, Y.; Abedini, M.: An
21. Abu-Mouti, F.S.; El-Hawary, M.E.: Optimal distributed genera- efficient hybrid method for solving the optimal sitting and sizing
tion allocation and sizing in distribution systems via artificial bee problem of DG and shunt capacitor banks simultaneously based
colony algorithm. IEEE Trans. Power Deliv. 26(4), 2090–2101 on an imperialist competitive algorithm and genetic algorithm.
(2011) Int. J. Electr. Power Energy Syst. 54, 101–111 (2014)
22. Mohandas, N.; Balamurugan, R.; Lakshminarasimman, L.: “Opti- 29. Devi, S.; Geethanjali, M.: Optimal location and sizing determi-
mal location and sizing of real power DG units to improve the nation of distributed generation and DSTATCOM using particle
voltage stability in the distribution system using the ABC algo- swarm optimization algorithm. Int. J. Electr. Power Energy Syst.
rithm united with chaos. Int. J. Electr. Power Energy Syst. 66, 62, 562–570 (2014)
41–52 (2015) 30. Geem, W.Z.; Yoon, Y.: Harmony search optimization of renew-
23. Kumar, A.; Srivastava, S.C.; Singh, S.N.: A zonal congestion man- able energy charging with the energy storage system. Int. J. Electr.
agement approach using real and reactive power rescheduling. Power Energy Syst. 86, 120–126 (2017)
IEEE Trans. Power Syst. 19(1), 554–562 (2004)
24. Bohre, A.K.; Agnihotri, G.; Dubey, M.: The optimal planning of
distributed generation using OPF and Butterfly-PSO (BF-PSO)
technique

13