GSA based Optimal Capacity and Location

Determination of Distributed Generation in Radial

Distribution System for Loss Minimization.
Khyati.Mistry Vruta Bhavsar ,Student Ranjit.Roy
Electrical Engineering Department. Electrical Engineering Department. Electrical Engineering Department.
Saradar Vallabhbhai National Institute Saradar Vallabhbhai National Institute Saradar Vallabhbhai National Institute
of Technology of Technology of Technology
Surat,INDIA Surat,INDIA Surat,INDIA
kkp@eed.svnit.ac.in rr@eed.svnit.ac.in

Abstract The penetration level of distributed generation (DG)
has increasing day by day due to restructuring in electricity
market. This paper discusses the sizing and sitting issue of single
DG placement in radial distribution network. The main objective
of this paper is to minimize active power loss and improve
voltage profile of overall system. This paper presents three
optimization techniques Particle swarm optimization (PSO),
Craziness based particle swarm optimization (CRPSO) and
Gravitational Search algorithm (GSA) for optimal placement of
distributed generators. The methods are tested with two IEEE
standard test cases, 12-node radial distribution network and 69-
node radial distribution network, and the results obtained by
three algorithms are comparable.
Keywords- Active power loss, Distributed Generation (DG),
Optimization Technique, Radial distribution network, Voltage
profile.
I. INTRODUCTION
Due to restructuring in power system, the penetration level of
small scale energy sources or distributed generators are
increases. Distributed generators, which are scattered over the
distribution system directly connected to the load or near the
load centers. These DGs are neither centrally placed nor
dispatchable and its capacity varied from few kW to few MW.
Distributed generations (DG) have different types depending
upon the type of energy sources utilize for production of
electrical energy such as renewable and non-renewable small
energy sources. Distributed generators (DG) can be 1)
renewable energy sources, such as: Ocean energy, Geothermal
energy source Wind turbines, Solar photovoltaic, Biomass
energy source or 2)non- renewable energy sources such as:
Diesel generator, Small turbines. Initially distribution system
is passive network, no power generation at distribution level
but with the incorporation of DGs in distribution system
results into active network.
Traditionally distribution network is designed as a
passive network, i.e. no generation at distribution level.
Incorporation of DGs in distribution system changes its
characteristic from passive to active.
A positive impact of DG placement in distribution
system are increase capacity of feeder, improved reliability,
lowers system losses, improve power quality, improves
voltage profile and improves voltage stability of the system
and lowers the peak demand results into increase in the life of
system equipment and hence more number of customers can
be served. There are some issues related to DG placement
such as: determining optimal size of DG, determining
optimum location for DG placement, coordination of
protection devices, maximizing capacity of DG which give
lower electricity prize, determining capacity and location of
DG for varying load condition. On account of achieving above
benefits, DG must has appropriate capacity and at the proper
location.
The size of DG should be such that it is equal to the
total load of the system plus the total system loss. Higher
capacity of DG results into reverse power flow from
substation to source node which results into higher power loss.
Genetic algorithm GA [1] has been presented to
maximize the benefits of DG by choosing the optimal sitting
and sizing of DG. A static fuzzy multi objective model [2] is
proposed to determine the optimal size, location and also the
proper technology of distributed generation units in
distribution system. Hybrid of OPF and GA techniques [3] are
proposed to overcome limitations in evaluating network
capacity to absorb DG by avoiding prespecification of unit
size or location. Two software (MATLAB and GAMS) was
introduced in [4] for obtaining the optimal distributed
generation capacity sizing and sitting investments.
Optimization algorithm graphical user interface (GUI) [5]
used for the optimal placement of distributed generation and
shunt capacitors with their optimal size in distribution
networks for power system studies. The problem was
formulated for improve the voltage stability index. A genetic
algorithm (GA) was developed in [6] for power quality
improvement, optimal placement and sizing of fixed capacitor
banks in radial distribution networks with nonlinear loads and
distributed generation imposing voltage-current harmonics.
Artificial Bee Colony algorithm (ABC) was proposed in [7]
for the placement of distributed generators in the radial
distribution system to reduce the real power losses and to
improve the voltage profile.
In this paper DG is consider as an active power
source. Optimum capacity and location of DG is found out
with three different optimization techniques for minimization
of active power loss and improve voltage profile of the
distribution system.

978-1-4577-1829-8/12/$26.00 2012 IEEE

 II. DG PLACEMENT
DG is considered as an active power source. The node where
load is connected is considered to be the location of DG. DG
is placed at each node and optimal size of DG is found out.
For example consider 12-node radial distribution network
shown in Figure 1. The total active power load on the system
is 455.71 kW and total active power loss of the system is
20.71 kW. In this case, maximum DG capacity is assumed 500
kW. Let us considered DG is placed at node 12 and capacity
of DG is varied from 0 kW to 500 kW in step 50 kW. Figure
2. shows the plot of active power loss versus DG capacity for
12-node network where DG is placed at node 12. From Figure
2, it is clear that if DG capacity increases from 0 kW to 200
kW the overall system losses are reducing in nature. If DG
capacity still increases, then losses begin to increases. It is
worth pointing out that at higher DG capacity, losses can
become larger than those without DG connected. The accurate
optimum capacity of DG for each node is found out using with
three different optimization techniques.
Figure 1. 12-node radial distribution network.
30
active power loss(kW)
25
20
15
10
0
200 100
300 400
DG capacity (kW)
Figure 2. Active power loss versus DG capacity for 12-node network when
DG is placed at node 12.
III. PROBLEM FORMULATION
The optimum size of DG can be found out with the equation
(1) for each node where the load is connected.
(1)
where, Pi = real power injection at node i.
PDGi =real power generation by DG at node i.
PDi = real power demanded at node i.
The problem is formulated with the objective function, namely
minimization of active power loss considering voltage
constraint. The objective function is,
Minimize total real power losses=
I r (2)
subjected to:
Voltage constraint: Voltage magnitude at each node must lie
within their permissible ranges to maintain power quality:
|Vimin||Vi||Vimax| (3)
Where jj is the branch number, Ijj represents the branch
current, rjj stands for branch resistance. LPjj is the power loss
of branch jj.
Vimin = Minimum voltage limit at node i.
Vimax= Maximum voltage limit at node i.
The DG size is varied from minimum capacity to maximum
load capacity of the system.
IV. SIMULATED TEST SYSTEMS
The method is tested with two test cases. The first test case
is12-node radial distribution network [8] and second test case
is 69-node radial distribution network [9]. For the load flow
study, the following parameters are considered:
For 12-node network, substation voltage=11KV, base
MVA=100, total active load =455.71 kW. The voltage limit is
0.95 p.u to 1.05 p.u. The DG capacity for this test case is
assumed 500 kW.
For 69-node network, substation voltage=12.66 KV, base
MVA=100, total active load =3802.59 KW. The voltage limit
is 0.85 p.u to 1.05 p.u. The DG capacity for this test case is
assumed 5 MW.
V. ASSUMPTION MADE FOR DG PLACEMENT
DG is considered as negative load.
DG injects only active power.
The maximum size of the DG is assumed to be total
load demanded plus total loss of the system.
The node at which load is connected considered as the
possible location of DG.
The source node is not to be considered as location for
DG placement.
VI. COMPUTATIONAL PROCEDURE
Step 1: Run the load flow and find out total active power
losses.
Step 2: Place DG at each node and vary DG capacity from
minimum to maximum value.
Step 3: Store the size of DG corresponding to minimum loss
500
obtained for each node.
Step 4: Compare the loss for each node.
Sep 5: The node at which loss is minimum considered as the
optimum location for DG placement.
Step 6: Print the optimum capacity of DG corresponding to
optimum location.
Step 7: Run the load flow with optimum DG capacity to obtain
the final results.
VII. OPTIMIZATION TECHNIQUES
The optimization algorithm employed in this paper are
Particle swarm optimization (PSO) [10], Craziness-based
particle swarm optimization (CRPSO) [11] and Gravitational
search algorithm (GSA) [12], to compute the optimum location
and size of DG.
A. Particle Swarm Optimization
The PSO was first introduced by Kennedy and Eberhart
[13]. It is an evolutionary computational model, a stochastic
search technique based on swarm intelligence such as fish
schooling and bird flocking.
PSO [10] is developed through simulation of bird flocking in 1 ( r 4 0.5 )
multidimensional space. Each particle's present position is sign(r 4) = (10)
realized by the previous position and present velocity -1 ( r 4<0.5 )
information. Bird flocking optimizes a certain objective During the simulation of PSO, the best chosen maximum
function. Each agent knows its best value so far (pbest). This population size = 50, maximum allowed iteration cycles =
information corresponds to personal experiences of each 100, best Pcraz = 0.2 (chosen after several experiments). The
agent. Moreover, each agent knows the best value so far in the choice of c1, c2 are very much vulnerable for PSO execution.
group (gBest) among pBests. Namely, each agent tries to
The best value of either c1 or c2 is 2.05. The value of vicraziness
modify its position using the following information:
* The current position vector xi lies between 0.25 and 0.35.
* The current velocity vector vi C. Gravitational Search Algorithm
* The distance between the current position and pBesti
Step 1- Initialization:
* The distance between the current position and gBest.
The initial population is chosen randomly and would attempt
Mathematically, velocities of the each particle are modified
to cover the entire parameter space uniformly. The position of
according to the following equation:
all agents as following is assumed,
Velocity updating equation:
=min+rand(1)*(max-min) (11)
( ) (
vik +1 = vik + c1 r1 p Best i xik + c 2 r 2 gBest xik ) (4) where, i varies from 1 to np, np being the number of
k
where Vi is the velocity of agent i at iteration k; c1 and c2 are population and min and max are the minimum and maximum
the weighting factor; r1 and r2 are the random number values x can attain.
between 0 and 1; xik is the current position of agent i at Step 2- Evaluation of fitness:
iteration k. The evaluation of fitness defines the best and the worst of
Position of each particle is updated by using equation: fitness value of an agent. A heavier mass means a more
efficient agent. This means that better agents have higher
xik +1 = xik + vik +1 (5)
attractions and walk more slowly. Here, we combine this
The first term of (4) is the previous velocity of the agent. The algorithm with DG loadflow program to get the total power
second and third terms are used to change the velocity of the loss of the system which is considered as fitness of an agent
agent. Without the second and third terms, the agent will keep and thus evaluated as follows:
on flying in the same direction until it hits the boundary. For minimization problem:
B. Craziness-based Particle Swarm Optimization best= min (fit) worst=max(fit)
For maximization problem:
The following modifications in velocity help to enhance the
best=max (fit) worst=min(fit)
global search ability of PSO algorithm as observed in CRPSO
Assuming equality of gravitational and inertia masses of
[11].
agents, Mg=Mi, the value of masses are calculated by fitness
(i) Velocity updating as proposed in [11] may be stated as in
evaluation as follows:
the following equation:
v ik + 1 = r 2 v ik + (1 r 2 ) c 1 r 1 ( p B e s t i x ik ) mi= , (12)
(6)
+ (1 r 2 ) c 2 (1 r 1 ) ( g B e s t x ik ) Mi= (13)

Local and global searches are balanced by random number r2 Step 3-Evaluation of force acting on agents:
as stated in (7). Change in the direction in velocity may be Euclidian distance between two agents i and j:
modeled as given in the following equation: | | (14)
vik +1 = r 2 sign(r3) vik + (1 r 2 ) c1 r1 Now, the force acting on mass i from mass j:
(7)
( ) (
p Best i xik + (1 r 2 ) c 2 (1 r1) gBest xik ) F (15)

In (9), sign (r3) may be defined as the gravitational constant is found by:
/
, (16)
1 ( r 3 0.05 ) where the values of g0 and are taken 200 and 25 respectively
sign(r 3) =
1 ( r 3 > 0.05 ) for the best results.
To give stochastic character, we suppose the force on an agent
(ii) Inclusion of craziness: Diversity in the direction of birds be a randomly weighted sum of forces exerted from other
flocking or fish schooling may be handled in the traditional
agents: F rand F (17)
PSO with a predefined craziness probability. The particles ,
may be crazed in accordance with the following equation where randj is a random number in [0,1] interval.
before updating its position. Step 4 Updation of position:
vik +1 = vik +1 + Pr ( r 4) sign ( r 4) vicraziness (8) By law of motion, acceleration of agent i . (19)
where Pr(r4) and sign(r4) are defined respectively as: The velocity and position of an agent for next cycle is
modified as follows:
1 ( r 4 Pcraz ) (9)
1 (20)
Pr ( r 4) =
0 ( r 4> Pcraz ) 1 1 (21)
 Table I Total active power loss, minimum voltage magnitude for the base cases.

Particulars 12-node network 69-node network

Active power loss(KW) 20.71 kW 317.725

Minimum Voltage magnitude (p.u) 0.9433 at node 11 0.8754 at node-65

Table II Optimal DG size, active power loss and minimum voltage magnitude at respective node of 16- node network.

Node Optimal DG Size (KW) Active power loss (KW) Minimum voltage magnitude (p.u)
PSO CRPSO GSA PSO CRPSO GSA PSO CRPSO GSA
2 472.3 472.3 478.3 18.6 18.6 18.6 0.9478 at node 11 0.9478 at node 11 0.9479 at node 11
3 436.0 436.0 440.4 17.0 17.0 17.0 0.9519 at node 11 0.9519 at node 11 0.9520 at node 11
4 395.8 395.8 387.5 14.8 14.8 14.8 0.9583 at node 11 0.9583 at node 11 0.9580 at node 11
5 349.8 349.8 354.0 12.5 12.5 12.5 0.9662 at node 11 0.9662 at node 11 0.9665 at node 11
6 337.3 337.3 339.7 12.0 12.0 12.0 0.9686 at node 11 0.9686 at node 11 0.9688 at node 11
7 326.0 326.0 324.5 11.5 11.5 11.5 0.9706 at node 11 0.9706 at node 11 0.9704 at node 11
8 278.6 278.6 280.2 10.8 10.8 10.8 0.9771 at node 11 0.9771 at node 11 0.9773 at node 11
9 235.4 235.4 235.6 10.7 10.7 10.7 0.9832 at node 11 0.9832 at node 11 0.9824 at node 11
10 216.8 216.8 219.4 11.0 11.0 11.0 0.9815 at node 8 0.9815 at node 8 0.9818 at node 8
11 206.8 206.8 211.8 11.3 11.3 11.3 0.9803 at node 8 0.9803 at node 8 0.9809 at node 8
12 197.8 197.8 203.5 11.6 11.6 11.6 0.9792 at node 8 0.9792 at node 8 0.9799 at node 8

Table III Optimal DG size, active power loss and minimum voltage magnitude at respective node of 69- node network.
Node Optimal DG Size (KW) Active power loss (KW) Minimum voltage magnitude (p.u)
PSO CRPSO GSA PSO CRPSO GSA PSO CRPSO GSA
6 3290.6 3291.8 3196.0 281.3 281.2 281.3 0.8876 at node 65 0.8878 at node 65 0.8870 at node 65
7 3181.3 3199.1 3170.8 248.2 240.6 248.2 0.8990 at node 65 0.8991 at node 65 0.8983 at node 65
8 3164.8 3163.1 3166.0 240.7 237.0 240.7 0.9016 at node 65 0.9016 at node 65 0.9010 at node 65
9 3144.2 3144.7 3093.0 237.0 253.1 237.0 0.9029 at node 65 0.9029 at node 65 0.9019 at node 65
10 2040.5 2049.2 2062.5 253.1 254.6 253.1 0.8934 at node 65 0.8935 at node 65 0.8931 at node 65
11 1919.1 1918.8 1881.8 254.6 260.6 254.6 0.8924 at node 65 0.8924 at node 65 0.8916 at node 65
12 1561.4 1563.2 1586.0 260.7 268.5 260.7 0.8893 at node 65 0.8893 at node 65 0.8890 at node 65
13 1181.4 1227.9 1182.2 268.6 272.6 268.6 0.8859 at node 65 0.8863 at node 65 0.8856 at node 65
14 1035.2 1033.3 1031.3 272.7 272.6 272.6 0.8847 at node 65 0.8846 at node 65 0.8842 at node 65
16 889.4 885.6 896.5 275.5 275.4 275.4 0.8834 at node 65 0.8834 at node 65 0.8831 at node 65
17 853.2 841.2 841.3 276.2 276.2 276.2 0.8831 at node 65 0.8830 at node 65 0.8826 at node 65
18 868.6 856.5 843.9 276.3 276.2 276.2 0.8832 at node 65 0.8831 at node 65 0.8826 at node 65
20 795.9 800.6 777.4 278.1 278.0 278.0 0.8826 at node 65 0.8826 at node 65 0.8821 at node 65
21 777.2 771.4 772.5 279.1 279.0 279.0 0.8824 at node 65 0.8824 at node 65 0.8820 at node 65
22 767.2 770.1 762.4 279.1 279.1 279.1 0.8823 at node 65 0.8823 at node 65 0.8819 at node 65
24 727.1 724.9 732.1 281.2 281.1 281.1 0.8820 at node 65 0.8819 at node 65 0.8816 at node 65
26 643.9 643.6 645.6 285.1 285.1 285.1 0.8812 at node 65 0.8812 at node 65 0.8809 at node 65
27 638.4 631.8 609.7 285.7 285.6 285.7 0.8812 at node 65 0.8811 at node 65 0.8806 at node 65
28 907.4 912.5 901.5 317.7 317.6 317.7 0.875 at node 65 0.8754 at node 65 0.8751 at node 65
29 130.6 131.4 119.6 317.7 317.7 317.7 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
33 43.8 43.2 42.8 317.7 317.6 317.7 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
34 33.6 34.4 40.2 317.7 317.6 317.7 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
35 28.0 25.8 18.4 317.7 317.6 317.7 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
36 988.9 989.4 968.2 317.7 317.7 317.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
37 225.5 224.4 210.6 317.7 317.7 317.7 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
39 166.2 164.4 135.1 317.7 317.7 317.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
40 164.0 164.0 166.4 317.7 317.7 317.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
41 100.9 103.0 109.3 317.6 317.6 317.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
43 94.9 97.9 112.9 317.6 317.6 317.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
45 98.1 96.2 92.4 317.6 317.6 317.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
46 90.6 96.2 91.4 317.6 317.6 317.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
48 961.1 949.3 937.3 317.0 317.0 317.0 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
49 807.3 812.2 775.8 315.6 315.6 315.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
50 734.7 735.7 685.1 315.6 315.6 315.6 0.8754 at node 65 0.8754 at node 65 0.8751 at node 65
51 2874.6 2873.6 2855.9 247.6 247.6 247.6 0.8992 at node 65 0.8992 at node 65 0.8985 at node 65
52 2159.7 2160.5 2158.3 265.0 265.0 264.9 0.8933 at node 65 0.8933 at node 65 0.8928 at node 65
53 2963.4 2965.9 3008.3 231.7 231.7 231.6 0.9062 at node 65 0.9063 at node 65 0.9060 at node 65
54 2808.5 2811.0 2701.4 225.2 225.2 225.2 0.9100 at node 65 0.9100 at node 65 0.9080 at node 65
55 2651.1 2648.3 2652.3 216.2 216.2 216.2 0.9152 at node 65 0.9159 at node 65 0.9143 at node 65
59 1997.3 1999.4 2001.8 131.7 131.7 131.6 0.9609 at node 65 0.9610 at node 65 0.9596 at node 65
61 1895.1 1891.4 1883.8 112.1 112.1 112.0 0.9724 at node 65 0.9722 at node 65 0.9701 at node 65
62 1863.7 1865.8 1812.6 114.2 114.2 114.2 0.9724 at node 65 0.9725 at node 65 0.9682 at node 65
64 1674.9 1668.6 1633.2 130.8 130.8 130.8 0.9748 at node 65 0.9745 at node 65 0.9707 at node 61
65 1470.7 1462.4 1460.2 152.6 152.6 152.6 0.9548 at node 61 0.9691 at node 69 0.9530 at node 61
66 1755.0 1751.5 1731.4 230.1 260.1 260.1 0.8909 at node 65 0.8909 at node 65 0.8903 at node 65
67 1739.4 1747.8 1669.4 260.3 260.3 260.3 0.8908 at node 65 0.8909 at node 65 0.8897 at node 65
68 1244.4 1240.5 1243.4 271.9 271.9 271.9 0.8865 at node 65 0.8864 at node 65 08860 at node 65
69 1241.1 1238.8 1238.6 272.0 272.0 272.0 0.8864 at node 65 0.8864 at node 65 0.8860 at node 65

10.86 118

Active power loss (kW)

Active power loss (kW)

10.84
116
10.82

10.8 114
10.78
112
10.76 0 20 40 60 80 100
40 60 0 8020 100
Iteration cycles
Iteration cycles
Figure 7.Active power loss of 69-node network at node 6 using CRPSO
Figure 3.Active power loss of 12-node network at node 9 using PSO
10.79 112.5

Active power loss (kW)

Active power loss(kW)

112.4
10.785
112.3
10.78
112.2
10.775 112.1

10.77 112
0 20 40 60 80 100 0 20 40 60 80 100
Iteration cycles Iteration cycles
Figure 4.Active power loss of 16-node network at node 9 using CRPSO Figure 8.Active power loss of 69-node network at node 61 using GSA

10.81
Active power loss (kW)

10.8

10.79

10.78

10.77
40 60 0 8020 100
Iteration cycles
Figure 5.Active power loss of 12-node network at node 9 using GSA

Figure 9.Optimum DG size at respective node for 12-node network using

different optimization techniques.
125
Active power loss(kW)

120

115

110
40 060 20
80 100
Iteration cycles
Figure 6.Active power loss of 69-node network at node 6 using PSO
Figure 10.Active power loss at respective node of 12-node network using
different optimization techniques.
 Figure 11.Optimum DG size at respective node for 69-node network using
different optimization techniques.
where i varies from 1 to np, np is number of population.
The procedure is repeated till the cycle reaches maxcyc and the
resultant is chosen as per the requirement of the problem
(minimization or maximization) by getting the minimum or
maximum value from all the derived values.
For the best results, the best chosen maximum population
size=50, maximum allowed iteration cycles (maxcyc)=100.
VIII. DISCUSSION ON RESULTS
The aim of this paper is to find out optimum DG size and
optimum location which give lowest active power losses using
three different optimization techniques. Table I shows the total
active power loss and minimum voltage magnitude for base
cases i.e. 12-node network and 69-node network. Table II
shows the total active power loss, optimal DG capacity and
minimum voltage magnitude for 12-node network where DGs
are placed one by one node where load is connected. Table III
shows the optimal DG capacity, total active power loss and
minimum voltage magnitude of 69-node network. Figure 3,
Figure 4 and Figure 5 shows the active power loss versus
iteration cycle for 12-node network using PSO, CRPSO and
GSA respectively. Figure 6, Figure 7 and Figure 8 shows the
active power loss versus iteration cycle for 69-node radial
distribution network using PSO, CRPSO and GSA
respectively. Figure 9 shows the plot of optimum DG size at
respective node for 12-node network. Figure 10 shows the plot
of active power loss at respective node of 12-node network
using different optimization techniques. Figure 11 shows the
plot of optimum DG size at respective node for 69-node
network. Figure 12 shows the plot of active power loss at
respective node of 69-node network using different
optimization techniques.
IX. CONCLUSION
This paper presents the optimum capacity of DG at various
nodes using three different optimization techniques. The
method is tested with two test cases i.e. 12-node radial
distribution network and 69-node radial distribution networks.
The node at which overall system active power loss is
minimum considered as a optimal location for the DG
placement. From the table it is clear that the optimal location
of DG placement is node 9 for 12-node network where total
loss of the system found to be minimum. For 69-node network
optimal location of DG is node 61. From the result it is also
found that the minimum voltage magnitude of the network is
Figure 12.Active power loss at respective node of 69-node network using
different optimization techniques.
improved compared to base test cases significantly with the
help of gravitational search algorithm.
X. REFERENCES
[1]A.A.Abou EL_ELA, S.M.Allam, M.M.Shatla, Maximal optimal benefits
of distributed generation using genetic algorithms, Electric Power
System Research, vol.80, pp.869-877, 2010.
[2]A.Zangenesh, S.Jadid, A.R-Kian, A fuzzy environmental-technical-
economic model for distributed generation planning, Energy,vol.36,
pp.3437-3445, 2011.
[3]G.P.Harrison, A.Piccolo,P.Siano,A.R.Wallace, Hybrid GA and OPF
evaluation of network capacity for distributed generation connections
Electric Power System Research, vol.78, pp.392-398, 2008.
[4]S.Porkar,P.Poure, A.Abbaspour, S.Saadate, A novel optimal distribution
system planning framework implementing distributed generation in a
deregulated electricity market, Electric power System Research, vol.80,
pp.828-837,2010.
[5]T.Gozel,U.Eminoglu,M.H.Hocaoglu, A tool for voltage stability and
optimization (AS&OP) in radial distribution systems using matlab
graphical user interface (GUI) Simulation Modelling Practice and
Theory, vol.16, pp.505-518, 2008.
[6]S.A.Taher,M.Hasani,A.Karimian, A novel method for optimal capacitor
placement and sizing in distribution systems with nonlinear loads and
DG using GA, Commun nonlinear Sci Numer Simulat, vol.16, pp.851-
862,2011.
[7]M.Padma Lalitha,N.Sinarami Reddy,V.C.Veera Reddy, Optimal
placement for maximum loss reduction in radial distribution system
using ABC algorithm International Journal of Reviews in Computing,
pp.44-52,2010.
[8]D.Das,H.S.Nagi,D.P.Kothari, Novel method for solving radial
distribution networks,IEE Proc.-Gener,Transm.Distrib.,vol.141,pp.291-
298,1994.
[9] R.Ranjan,D.Das, Simple and efficient computer algorithm to solve radial
Distribution networks Electric Power Components and Systems,
vol.31,pp.95-107,2003.
[10] R.Roy,S.P.Ghoshal, Evolutionary computation based comparative study
of TCPS and CES control applied to automatic generation control Pow
er System Technology and IEEE Power India Conference,POWERCON
New Delhi,2008.
[11] R. Roy, S.P. Ghoshal, "A novel crazy optimized economic load dispatch
for various types of cost functions" , Int. J. Electrical Power Energy
Syst, vol. 30, no. 4, pp. 242253, 2008.
[12]E.Rashedi, H.N-Pour,S.Saryazdi, GSA: A gravitational search algorithm
Information Sciences, vol.179,p.p.2232-2248,2009.
[13] J.Kennedy.R.C.Eberhart, Particle swarm optimization in: Proceedings of
IEEE International Conference on Neural Networks, Pearth, Australia,
pp.1942-1948, 1995.