net/publication/251966982
CITATIONS READS
4 56
3 authors:
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:
All content following this page was uploaded by C.F. Florin Catalin Ionescu on 07 July 2015.
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
( )
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
1,06
1,05
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
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.