See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/251966982

Differential evolutionary algorithms in optimal distributed generation location

Article · September 2010

DOI: 10.1109/ICHQP.2010.5625451

CITATIONS READS
4 56

3 authors:

Constantin Bulac C.F. Florin Catalin Ionescu

Polytechnic University of Bucharest Polytechnic University of Bucharest
46 PUBLICATIONS   215 CITATIONS    6 PUBLICATIONS   16 CITATIONS   

SEE PROFILE SEE PROFILE

M. Roscia
University of Bergamo
88 PUBLICATIONS   714 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

smart building, smart cities, home automation, IoT, View project

electronic power converters View project

All content following this page was uploaded by C.F. Florin Catalin Ionescu on 07 July 2015.

The user has requested enhancement of the downloaded file.

 1

Differential Evolutionary Algorithms in Optimal

Distributed Generation Location
C. Bulac, Member, IEEE, F. Ionescu, M. Roscia

Abstract— This paper present an application of Differential II. INTRODUCTION

T
Evolutionary Algorithm (DEA) with the purpose of finding the
HE planning of the electric system with the presence of
optimal location of a renewable source in a electric power
network. In addition, the paper considers also the problem of DG requires the definition of several factors, such as: the
optimal reactive power dispatch (ORPD), minimizing the active best technology to be used, the number and the capacity of the
power loss and improving the voltage level. The DEA is used as units, the best location, the type of network connection, etc.
an optimization technique being highly efficient in constrained The impact of DG in system operating characteristics,
parameter optimization problems. The applicability of the method such as electric losses and voltage profile needs to be
was evaluated on the IEEE 30 bus system. It is important where
evaluated. The selection of the best places for installation of
to place a renewable source, because study shows that if they are
connected at non-optimal locations, the system losses may the DG units in large distribution systems is a complex
increase. combinatorial optimization problem and has been
continuously studied in order to achieve different aims.
Index Terms— Differential Evolutionary Algorithm, Distributed generation (DG) can be defined as an electrical
Minimizing the Active Power Loss, Optimal Reactive Power power source connected directly to the distribution network or
Dispatch, Renewable source. on the consumer side of the meter [1].
The Electric Power Research Institute defines distributed
I. NOMENCLATURE generation as generation from ‘a few kilo- watts up to 50
NB set of number of total buses; MW’. According to the Gas Research Institute, distributed
NPQ, NPU set of number of PQ buses and PU buses; generation is ‘typically [between] 25 and 25 MW’; Preston
NB-S set of number of total buses excluding slack and Rastler define the size as ‘ranging from a few kilowatts to
bus; over 100 MW’ and Cardell defines distributed generation as
L ,T set of number of transmission lines and generation ‘between 500 kW and 1 MW’.
transformers; This paper addresses the problem of the location of a DG
U i = U i e jθi voltage at bus i; unit, and has the objective to find the optimal location in a
network so the voltage level do not exceed the admissible
Pisch , Qisch scheduled nodal active and reactive power;
limits and to minimize the active power losses and also
∆Pi,k active power loss in branch i-k;
obtaining a better reactive power dispatch, all this using
Qgi reactive power generation at bus i;
Artificial Intelligence (DEA).
QGD,i reactive power injected or consumed of the
The Differential Evolutionary Algorithm [2] is used as
renewable source;
the optimization technique. In section III it is presented a brief
U imin , U imax lower and upper voltage limits; discussion about distributed generation issues, section IV
Qgimin , Qgimax lower and upper reactive power generation presents the problem formulation and the Differential
Evolutionary Algorithm. The Case Study is presented in
limits; Section V and in Section VI the conclusions.
min max
Q GD ,Q GD lower and upper reactive power limits of
the renewable source; III. DG LOCATION
A general definition was then suggested in [3] which are
now widely accepted as follows: ‘‘Distributed Generation is
an electric power source connected directly to the distribution
network or on the customer site of the meter’’. The definitions
C. Bulac is with the Department of Power Systems, University Politehnica of DG do not define the technologies, as the technologies that
of Bucharest, Romania (e-mail: cbulac@yahoo.com ). can be used vary widely. However, a categorization of
F. Ionescu is with the Department of Power Systems, University different technology groups of DG seems possible, such as,
Politehnica of Bucharest, Romania (e-mail: ionescu_florin85@yahoo.com ).
M. Roscia is with the Department of Design and Technology of the nonrenewable DG and renewable DG. From distribution
University of Bergamo, 5 Marconi Street, 24044 Dalmine, Bergamo, Italy (e- system planning point of view, DG is a feasible alternative for
mail: cristina.roscia@unibg.it ).
 2

new capacity especially in the competitive electricity market Where λU and λQ are the penalty factors that can be
environment. i gi

Calculation of loss with DG one at the time at each bus increased in the optimization procedure and U ilim ,
again requires several load flows solutions, as many as lim
respectively Qgi are defined in the following equations:
number of buses in the system. Therefore a new methodology
is proposed to quickly calculate approximate loss, which
⎧⎪U imin if U i < U imin
would be use for the purpose of identifying the best location U ilim = ⎨
max
[4]. Numerical result shows that approximate loss follows the ⎪⎩U i if U i > U imax
same pattern as that calculated by accurate load flow [5]. It (6)
⎧⎪Qgimin if Qgi < Qgimin
means that, is accurate loss calculation from load flow gives lim
Qgi =⎨
minimum for a particular bus then loss calculated approximate max
⎪⎩Qgi if Qgi > Qgimax
loss method will also be minimum at that bus. This is verified
by the simulation results with Matlab 7.0 and DEA. It can be seen that the generalized objective function f q is

IV. PROBLEM FORMULATING a non-linear and non-continuous function. Gradient based

conventional methods are not good enough to solve this
The objective of DEA in finding the optimal location of problem.
a DG source is to minimize the real power loss in the
transmission network, to improve the voltage level and to V. DIFFERENTIAL EVOLUTIONARY ALGORITHM
obtain a better reactive power dispatch. In this matter we
The implementation of Differential Evolutionary
consider finding optimal location for a defined DG for loss Algorithm for optimal location of a GD source consists
reduction and so the problem can be described as follows mainly of identification objectives and handling of
[6-8]: constraints [9]. The control variables selected for optimal
location of a GD source are the reactive power that is
The objective function: introduced with the injection of the active power at node i,
and the exact location where it will be installed the source
MIN [ PLOSS ] = ∑ ΔPi , k (1)
( i , k )∈L ∪T
(Bus_Number). DEA is employed to find the best control
variable setting starting from a randomly generated initial
with equality constraints: population of control variables. At the end of each
n
generation, the best individuals, based on his fitness value
sch
∑
Pi = U i U k ( Gik cos (θi − θ k ) + Bik sin (θi − θ k ) )
k =1
(obtained by running power flow with Newton – Raphson
method) are stored.
(2)
n A. Treatment of control variables
∑
Qisch = U i U k ( Gik sin (θi − θ k ) − Bik cos (θi − θ k ) )
k =1
In its basic form, differential evolutionary algorithm can
handle only continuous variables. However, bus number is
and inequality constrains: a discrete variable or integer variable and active or reactive
power source installation are continuous variables in the
Qgimin ≤ Qgi ≤ Qgimax i ∈ N PU matter of optimal allocation of a DG source [10]. Here,
min max differential evolutionary algorithm has been extended to
QGD < QGD ,i < QGD i ∈ NB (3)
handle mixed integer variables. For integer variables the
U imin ≤ U i ≤ U imax i ∈ NB value is rounded off to the nearest integer value of the
variable.
In this context the reactive and active power at source i
and the bus where it will be connected the source represents ⎧ xi for continuous variables
xi = ⎨ (7)
the control variable of our problem. For implementing the ⎩ xi for integer variables
differential evolutionary algorithm the inequality constrains
are added as a quadric penalty terms to the objective The xi function gives the nearest integer less than or
function and the active power losses are expressed from the
equal to x. Different control variables in the optimal
equation of active power balance:
location of a GD unit process are treated as follows: bus
PLOSS = ∑ Pgi − ∑ Pli (4) number is initial generated randomly from the set of
i∈N B i∈N B
consumers buses The value is then modified in the search
Thus the optimization problem can be redefined as procedure, within the specified limits. Reactive power of
follows: the GD source initially generated randomly between the
MIN ⎡⎣ f q ⎤⎦ = minimum and maximum reactive power limits of the
source.
∑ ( ) ∑ ( ) (5)
2 2
PLOSS + λU i U i − U ilim + λQgi Qgi − Qgilim
i∈NU lim i∈N Qg lim
 3

B. Representation and Initialization

Differential evolutionary algorithm is a parallel direct
search algorithm that uses NP (number of individuals)
vectors of decision variables ( Number_bus, QGD ) real –
integer. The population at a G generation is defined as
being: Pi G = ( Bus, QGD )i . Decision variables (genes), Bus
and QGD,i are directly used as values of real and integer
numbers [11-12]. The initialization process generates NP
individuals ( Bus, QGD ) randomly and should try to cover
the entire search space uniformly. Fig.1. Illustration of the crossover operation for a crossover factor ρC and
rand(i) for a random number.
The value of the fitness function f i of each individual
PiG
,cross is not only retain original features but also locally
G
Pi is obtained by running load-flow with Newton- increase gene diversity.
Raphson method.
E. Evaluation and Selection
C. Mutation In DEA the evaluation process is based on one to one
DEA does not use a predefined probability density competition between the parent and his offspring. The actual
function to generate perturbing fluctuations. It relies upon individual competes with his parent based on their fitness
the population itself to perturb the vector parameter. [2]. function. All individuals in the population have the same
According to the mutation operator, for each chance of being selected as parents independent of their
individual Pi , i = 1,..., N p
G
at G generation, a mutant fitness value. If the parent is still better, it is retained in the
population. The best individual of the two is going to
individual is determined Pi G +1 using the following participate at reconstruction the new generation.
equation: F. Termination criteria

( )
Pi ,Gmut = Pr1G + s Pr2G − Pr3G (8)
The iterative procedure can be terminated when any of the
following criteria is met, i.e., an acceptable solution has been
reached, a state with no further improvement in solution is
where s >0 is a real parameter, called mutation constant,
reached, control variables has converged to a stable state or a
set randomly by user, which controls the amplification of
predefined number of iterations have been completed.
the difference between two individuals so as to avoid
search stagnation and r1, r2 and r3 are mutually different
VI. CASE STUDY
integers, randomly selected from the set {1, 2,..., N p } .
In this section the IEEE 30 ( Figure 2) bus systems is used
D. Crossover to show the effectiveness of the DE algorithm. The results are
obtained by implementing DEA [] in Matlab 7.8. The branch
The mutation factor in DEA is heuristic using the
parameters and loads are given in [13] and [14], the reactive
random choice. In essence, the mutant individual in (8) is a
limits for the GD unit is set by the user depending the size or
noisy replica of ( Bus, QGD )i . While the population diversity the kind of the GD unit. The active power is set by user also.
is small, the candidate individuals will rapidly cluster The simulation studies are made taking in consideration that
together so that the individuals cannot be further improved. our source is a wind turbine V90-3.0 MW.
This fact may result in a premature convergence. In order to A. Initial conditions
increase the local diversity of the mutant individuals, a
Total active and reactive loads and also generated active
crossover is introduced. In the crossover operation each
and reactive power and network power losses are presented in
gene of the individual i is reproduced from the mutant
G
Table 1. After running the power flow, for the initial
individual, Pi , mut and the current individual (parent): conditions, we observe that there are two buses with voltages
above maximum admissible value (Fig. 3): U9=1.05618 p.u.;
⎧ PG ,if a random number > ρ , U 10=1.05782 p.u. in Table 3.
⎪ i c
,cross = ⎨ G
PiG (9)
TABLE 1
⎪ Pi,mut ,else.
⎩ LOAD AND GENERATION

The crossover factor ρC ∈[0,1] is a constant and has to PLOAD QLOAD PG QG PLOSS
[p.u.] [p.u.] [p.u.] [p.u.] [p.u.]
be set by the user. Figure 1 provides a pictorial 2.834 1.2651 2.8879 1.2554 0.0539
representation of DEAs crossover mechanism.
Figure 1 illustrates that the newly generated individual
 4

we obtain, the new values for bus voltages and an improved

voltage level at the system buses (Fig. 3); and total active and
reactive generated power and active power losses (Table 2).
TABLE 2
ACTIVE AND REACTIVE GENERATED POWER AND POWER LOSSES

PG [p.u.] QG[p.u.] PLOSS[p.u.]

2.6855 1.0217 0.0415

Initial Condition Optimal Condition

1,06
1,05

Voltage level [p.u.]

1,04
1,03
1,02
1,01
1
0,99
0,98
0,97
0,96
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29
Bus Number
Fig. 2. Modified IEEE 30 bus test system.
B. Optimal solution using DEA Fig.3. Voltage level – Initial Condition / Optimal Condition.

In order to use DEA for finding the optimal location of a To be noted that after the optimization process we obtain a
DG source the control variables of the transmission network better reactive power dispatch in the system (Fig. 4) and a
(bus number and reactive power of the source) are arranged as considerable power saving (10):
elements of an individual in populations used during
evolutionary search for the test network: Initial Condition Optima Condition
pi = Bus _ Number QGD
0,5
The lower and upper limits are considered as follows:
Reactive Generated Power

U imin = 0.9 p.u. and U imax = 1.1 p.u. for PU – buses and 0,4
slack – bus; 0,3
U imin = 0.95 p.u. and U imax = 1.05 p.u. for PQ – buses;
[p.u.]

0,2
The population size is chosen to be 50, while the number of
competitors is 20. In the initial population each element 0,1

pij(0) of individuals pi(0) , i = 1,50 is initialized with a random 0

value between the lower and upper limits. -0,1
The fitness values fi used for mutation, crossover, 2 5 8 11 13 30
evaluation and selection are obtained for each individual by Bus Number
running the power flow program based on Newton – Raphson
method. Fig.3. Reactive power generation – Initial Condition / Optimal Condition.
After successful search using the DEA, we obtain the
optimal values of control variables (optimal location for PLOSS − PLOSS
initial opt
%= × 100 =
save
placing the GD unit (source), and his reactive power value). P initial
PLOSS
These are the elements of the best individual in the last (10)
0, 0539 − 0, 0415
population: = × 100 = 23.01%
0.0539
Bus _ Number QGD
Pi ,best =
3 0,1616 Also as a consequence of finding the optimal location of a
Bus _ Number QGD DG source (Fig. 5), in optimal operation condition all voltage
Pi , worst = values are in their limits unlike the initial condition and the
29 0, 0547 voltage level improved (Fig. 3).
After computation of power flow with these optimal values
 5

[3] T. Ackermann, G. Andersson and L. Söder, “Distributed generation: a

definition”, Electric Power Systems Research 57 December 2000, pp.
0,054
195–204.
Active Power Loss [p.u.]
[4] A. Benemar de Souza, and M.C. Joao de Albuquerque, “Optimal
0,052
Placement of Distributed Generators Networks Using Evolutionary
Programming”, Transmission & Distribution Conference and
0,05
Exposition: Latin America, 2006. TDC '06. IEEE/PES.
[5] H.W. Dommel and W.F. Tinney, “Optimal Power Flow Solutions”,
0,048
IEEE Transactions on Power Apparatus and Systems, 87, 1968, pp.
1866-1876.
0,046
[6] K.H. Abdul-Rahman and S.M. Shahidehpour, “A Fuzzy – Based
Optimal Reactive Power Control”, IEEE Transactions on Power
0,044
Systems, vol. 8, no. 2, May 1993, pp. 662-670.
[7] L. L. Lai, “Intelligent System Applications in Power Engineering”, John
0,042
1 3 5 8 12 15 17 19 21 24 29 Wiley & Sons, New York, 1998 .
[8] Q.H. Wu and J.T. Ma, “Power System Optimal Reactive Power Dispatch
Bus Number Using Evolutionary Programming”, IEEE Transactions on Power
Systems, vol. 10, no. 3, August 1995, pp. 1243-1249.
[9] Y. Lin, K Hwang, “A mixed-coding scheme of evolutionary algorithms
Fig. 4. System Loss Variation depending on the location of the GD unit. to solve mixed-integer nonlinear programming problems”, Computers
and Mathematics with Applications, vol. 47, 2004, pp. 1295-1307.
VII. CONCLUSIONS [10] M. Varadarajan, K.S. Swarup, “Differential evolutionary algorithm for
optimal reactive power dispatch”, Electrical Power and Energy Systems,
In the liberalized market environment, the distributed vol 30, 2008, pp. 435-441.
generation offers a number of benefits to the market [11] I. Pisica, C. Bulac, M. Eremia, ”Optimal Distributed Generation
Location and Sizing using Genetic Algorithms”, 15th International
participants. As a rule, customers look for the electricity Conference on Intelligent System Applications to Power Systems,2009,
services best suited for them. Different customers attach ISAP '09.
different weights to features of electrical energy supply, and [12] S. Rau Narayan, SM Yih-heui Wan, “Optimum Location of Resources in
distributed generation technologies can help electricity Distributed Planning”, IEEE Transactions on Power Systems, Vol. 9, No.
4, November 1994, pp. 2014-2020.
suppliers to supply the type of electricity service they prefer. [13] K.Y. Lee, Y.M. Park and J.L. Ortiz “A United Approach to Optimal
One of the most interesting features is the flexibility of DG Real and Reactive Power Dispatch”, IEEE Transactions on Power
that could allow market participants to respond to changing Apparatus and Systems, 104, 1985, pp. 1147-1153.
[14] K.R.C. Mamandur and R.D.Chenoweth, “Optimal Control of Reactive
market conditions, i.e. due to their small sizes and the short Power Flow for Improvements in Voltage Profiles and for Real Power
construction lead times compared to most types of larger Loss Minimization”, IEEE Transactions on Power Apparatus and
central power plants. Systems, vol. PAS-100, no 7, July 1981, pp. 3185-3194.
The simulation results shows that the application of the
differential evolutionary algorithm in finding the optimal
location of a DG source could achieve very attractive power
savings and better operating conditions, cheeping the voltages
and reactive generated powers into their limits.
It has been observed that differential evolutionary
algorithm is a simple but powerful tool for power system
optimization problem with nonlinear objectives and
constraints. Optimal control variables for real power loss
minimization are determined using the differential
evolutionary computation optimization strategy employing an
efficient penalty parameter less method for constraint
handling.
Differential evolutionary algorithm by the methods applied
and developed in this paper, is capable of handling
optimization problems. DEA does not require the
mathematical assumption applied in the conventional methods
and offers a powerful global search over the control variable
space.

VIII. REFERENCES
[1] K. Nara, Y. Hayashi, K. Ikeda and T. Ashizawa, "Application of tabu
search to optimal placement of distributed generators," in Proc.
2001IEEE Power Engineering Society Winter Meeting, pp. 918-923.
[2] R. Storn, K. Price, “Differential evolution – a simple and efficient
adaptive scheme for global optimization over the continuous spaces”,
Technical report TR-95-012, ICSI; March 1995.

View publication stats