An Adaptive Differential Evolution Algorithm For Reactive Power Dispatch

International Journal of Research in Advanced Technology - IJORAT
Vol. 1, Issue 3, DECEMBER 2015
An Adaptive Differential Evolution Algorithm for

Reactive Power Dispatch
Arun.G1 , Chandrasekar.T2
PG Scholar, M.E (PSE), Velammal College of Engineering and Technology, Madurai, India 1
Assistant Professor, M.E ,VelammalCollege of Engineering and Technology, Madurai, India 2
Abstract: Reactive power or VAR management is one of the most crucial tasks required for proper operation and control of a
power system. Reactive power management is carried out to reduce losses in a power system, by adjusting the reactive power
control variables such as generator voltages transformer tap-setting and other sources of reactive power such as capacitor banks
or FACTS devices. VAR management provides better system security improved power transfer capability and overall system
operation. VAR management is a complex combinatorial optimization problem involving non -linear functions having multiple
local minima and non-linear and discontinuous constraints. In this paper, the VAR management problem is formulated as a nonlinear constrained optimization problem with equality and inequality constraints for minimization of real power loss. The
problem is solved using Differential evolution (DE), which is a population based search algorithm. For avoiding the time and the
effort in tuning the parameters of DE algorithm, an Adapti ve DE algorithm with time varying chaotic mutation and crossover is
proposed for solving the optimization problem. Effectiveness of the proposed an Adaptive DE algorithm based approach has
been demonstrated on the IEEE 57-bus and IEEE 118-bus system are found to be superior to classical DE and its variants Selfadapti ve Differential Evolution (S aDE) in terms of convergence behavior and soluti on quality.
Keywords:Adapti ve differential Evolution algorithm, Real power loss minimization, VAR management,Voltage deviation.
I. INTRODUCTION
The main objective of reactive power (VAR)
management in a power system is to identify the reactive
power control variables settings such as generator voltages,
transformer tap settings and other sources of reactive power
such as capacitor banks or FACTS devices to reduce losses,
system security, power transfer capability and overall system
operation. Reactive power management is a sub problem of
optimal power flow (OPF) calculation. OPF is an on-linear
programming (NLP) problem that is solved find out the
optimal control parameters/circu mstance to min imize a
desired objective function, subject to certain system
constraints. It was first introduced by Carpentier [1,2] in
1960s.Reactive power management provides the power
system operator a set of control variables to minimize
transmission losses and to preserve bus voltage within
permissible limits by rescheduling the power flows.
In recent years, the issue of reactive power management
for various objectives like voltage control and power loss
reduction has received much attention. The main objective of
VA R management is to improve the voltage profile and
minimize real power losses through redistribution of reactive
power in the system [3-5].
Through, the conventional optimization techniques like
Gradient method, non-linear programming and interior point
method can be applied to solve VAR management problem
[6-10], but these techniques have several drawbacks, such as
insecure convergence properties and excessive numerical
iterations: resulting in huge computations and large execution
time. Also, these methods are highly complex optimization
techniques and insufficient for large-scale system
applications [10]. Due to non- differential, non-linear, mu ltimodal and non- convex nature of the VAR management
All Rights Reserved 2015 IJORAT
problem, most of these conventional techniques converge to

local optimu m [10].
With the advent of Evolutionary computing (EC)
techniques like Genetic Algorith m (GA ), Evolutionary
programming (EP), Differential Evolution (DE) algorith m
and Particle swarm optimization (PSO), these techniques
have been applied for reactive power dispatch problem [1121].
These nature inspired stochastic search based methods are
increasingly being proposed for solving power system
optimization problems in recent years. The random parallel
search capability and non-dependency on nature of the
optimization problem has contributed to their popularity for
handling various complex optimization problems. The ease of
formulating the equality and inequality constraints and stable
convergence behavior also add to their merits. In recent
years, Some evolutionary computing based algorithms, their
advanced versions and hybrid EC algorith ms have been
developed and proposed for various optimization problems in
power system [22, 23]. The advanced versions and hybrid EC
algorithms are claimed to provide better solution for some
functions and the problem under considerations, but there is
no algorithm available wh ich out performs other algorithms
for all the optimization problems. The reason is that, these
methods do not converge to the global best solution in every
trial run but are able to produce a feasible near solution quit
fast and are highly depend on parameter tuning.
DE is the simple population based search algorithm,
which is highly efficient in handling constrained optimization
problems and is supposed to be an improved version of
Genetic algorithm. This algorith m can be applied for
optimization of a non-smooth, discontinuous and multimodal function. Differential Evolution algorithm can find
near optimal solution regardless the initial parameters, its
Page 1

convergence is fast and it requires a few numbers of

parameters. In addition to this, its coding is simp le and it can
handle integer and discrete optimization [24, 25].
The performance of the Differential Evolution algorithm
was compared with various heuristic techniques. It has been
observed that DE algorithm is significantly better than that of
other heuristic methods like GA, Particle swarm optimization
and Evolutionary Algorithm.DE algorithm is found to be
robust and able to provide the same results consistently over
several trials [26, 27]. In addition to this, DE algorithm has
been used to solve high dimensional function optimization
[28]. It is found that, it has superior functioning on o set of
widely used bench mark functions. Thus, DE algorith m
seems to be a promising approach for various engineering
optimization problems including reactive power management
[29-32].
Differential evolution algorithm has been applied for
single objective VAR management problem [18,19].and the
results obtained are found to be better than those already
reported earlier by using other such techniques. In this paper
An Adaptive DE with time varying chaotic mutation and
crossover has been proposed for solving the single objective
VA R management problem. The problem has been
formulated as a non-linear constrained single objective
optimization problem, where the real power loss and the bus
voltage deviations are to be optimized (minimized)
simultaneously. Effectiveness of the proposed an Adaptive
DE based approach to solve single objective VA R
management problem has been demonstrated and compared
on the standard IEEE 57-bus and IEEE 118-bus system [6].
II. PROBLEM FORMULATION
AThe optimal VA R management problem is to optimize
the steady state performance of a power system in terms of
one or more objective functions while satisfying several
equality and inequality constraints. The VAR management
problem can be formulated as follows [4].
(2) Inequality constraints

The inequality constraints represent the system operating
constraints as follows,
a. Generation constraints: Generator voltages VG and
reactive power outputs QG are restricted by their lower and
upper limits as follows:
Vi-min Vi Vi-max
(4)
QGi-min QGi QGi-maxi{Npv ,N0 }(5)
b. Transformer constraints: Transformer tap T settings are

bounded as follo ws:
Ti-min Ti Ti-max i NT (6)
c. Switchable VAR sources constraints: Switchable VA R
compensations Qc are restricted by their limits as follows:
QCi-min QCiQCi-max iNC(7)

d. Security constraints: These include the constraints of
voltages at load buses VL and transmission line loadings SL
as follows:as follows:
Vli-min Vli Vli-max
i = 1,2,NLB
Sli-min Sli-max i = 1,2,NLB
(8)
(9)
Aggregating the objectives and constraints, the problem

can be mathematically formu lated as a non-linear
constrained mu lti-object ive optimizat ion problem as follows:
Minimize [PL (x,u)]

(10)
Subject to :
Equality constraint g(x,u)=0
(11)
2.1 objective function
And
Inequality constraint h(x,u ) < 0
(12)
1. Minimization of real power loss (P L)
Here x can be exp ressed as
This objective is to minimize the real power loss in XT=[VL1.VNLB,QG1....QGNG,SL1Sint ]
(13)
transmission lines of a power system by managing reactive While u can be expressed as
power and is expressed as
UT=[VG1.VGNG,T1.TNT,Qc1..QCNC]
(14)
nl
2
2
I.
Adaptive Differential Evolution algorith m has
F1 =Ploss= K=1 gk [Vi +Vj -2ViVj( i-j)]
(1)
been applied for this mu lti-objective VA R
management problem, which is a co mbinatorial
2.2 Problem constraints
optimization problem having multi-extremis m and
non-linear property. In this paper, the reactive
(1) Equality constraints
power management.
The equality constraints represent typical load flow
equations as follows
III. CLASSICAL DIFFER ENTIAL EVOLUTIONARY
ALGORITHM
PGi -PDi -Vi j1 Vj (Gij cosij + Bij sin ij )= 0
(2)
A
Differential Evolution (DE) is a population based
Where ij =(i j )
algorith m that employs crossover, mutation (d ifferential) and
QGi -QDi -Vi j1 Vj (Gijsin ij - Bij cosij )= 0
(3)
selection operators. In differential Evolution, all the
solutions have the same probability of being selected as
Whereij =(i j)
parents. DE emp loys a greedy selection process that is the
best new solution and its parent win the competition
For i=1,2,3..NB
Page 2

providing significant advantage of converging performance

over Genetic algorith ms, Differential Evolution [18]
algorith m works through a simple cycle of the stages as
follows
3.1 In itializat ion
At the beginning of DE algorithm imp lementation, i.e t=0
the problem independent variables are initialized somewhere
in their feasible numerical range. Therefore, if the jth
variable has its lower and upper bounds as xi and xj
respectively, then the jth component of the ith population
member may be in itialized as:
Xij (0)=Xj 1 +rand(0,1)*(Xj u Xj l )
(15)
Where rand(0,1) is a uniformly d istributed random numbers
between 0and 1.
3.2 Mutation
In each generation, a donor vector V(t) is created in o rder
to change the population member vector Xi (t). Generally, the
method of creating this donor vector is different in various
DE schemes. However, in this paper, DE/rand /1 mutation
Strategy is implemented. In this mutation strategy, creation
of the donor vector V(t)fo r the ith member Xi , three
parameter vector Xr1 ,Xr2 and Xr2 are selected randomly fro m
the current population not coinciding with the current
member Xi .
Next, a scalar nu mber F scales the difference between any
two of the three vectors and this scaled difference is added to
the third one. Thus, the donor vector V(t) is obtained. The
jth component of each vector can be expressed as:
Vi,j (t+1)=Xr1,j (t)+F(Xr2,j (t)-Xr3,j (t))
(16)
3.3 Crossover
To increase the diversity of the population, crossover
operator is carried out in which the donor vector exchanges
its components with those of the current member Xi (t). Two
types of crossover schemes, namely exponential crossover
and binomial crossover can be used by DE algorith m
[24,25]. In this paper, binomial crossover scheme is used
which is performed on all the D variab les and can be
expressed as:
Ui,j (t)={Vi,j (t) if rand(0,1)< CR
Xi,j (t) else
(17)
3.4 Selection
To keep the population size constant over subsequent
generations, the selection process is applied to find out
which one of the child and the parent will survive in the next
generation, i.e at time t=t+1. Differential Evolution actually
adopts the survival of the fittest principle in its selection
process. The selection process can be expressed as
Xi (t+1)={ Ui (t) iff (Ui (t)F(Xi (t))
Xi (t) iff(Xi (t)<F(Ui (t))
(18)
Where F(.) is the function to be minimized. So ,if the child
Ui (t) yields a better value of the fitness function, it rep laces
its parents in the next generation: otherwise, the parent X i (t)
is retained in the population. Thus the population either gets
better in terms of the fitness function or remains fixed but
never degenerates. Hence the population either gets better in
terms of the fitness function or remains constant but never
deteriorates.
3.4.1 Self-adaptive DE (SaDE) algorith m
In Self adaptive DE (SaDE) algorith m, both strategies and

their associated parameter are gradually Self-adapted by
learning fro m their previous experiences in generating
promising solutions. As a result, a more suitable generation
strategy along with its parameter settings can be determined
adaptively to match different search/evolution phases. In this
algorith m, at each generation, a set of trial vector generation
strategies together with their associated parameter values is
separately assigned to different indiv idual in current
population according to the selection probabilities learned
fro m the previous generations [32,34].
3.4.3 An Adaptive DE algorith m
Mutation rate F and crossover rate CR significantly
affect the performance of the DE a lgorith m. The s maller the
mutation rate F, longer time will be required fo r
convergence of DE algorith m. While larger values of F
allo w exp loration due to which the algorith m may not
converge and skip good optimal solution. The value of F
should be small to enough to enable the algorithm to exp lore
tight valleys and large enough to allow global exp loration in
order to maintain population diversity. A higher CR creates
more diversity and better explorat ion in the new population.
In classical DE algorithm, both F and CR are fixed, so a lot
of tuning parameters is required to achieve global best
results. This problem can be solved by employing time varying mutation and crossover rates.
To improve the performance of classical DE, many
hybrids of DE algorith m have been proposed that
incorporates chaotic systems in various ways. The most
common application of chaos theory in DE algorith m is for
its parameter adaptation [36-38]. In addition to this, chaotic
sequences have been utilized to in itialize DE population
diversity [36], to perform local search in the neighborhood
of the selected individuals [40] etc. Chaotic sequences with
the mutation factor have been integrated in DE algorith m to
improve solution quality [38]. In [37], various chaotic
sequences in evolutionary algorithms (EAs) were proposed
in the place of the rando m nu mbers.
In the present paper, the most commonly used chaotic
sequence, known as logistics map has been applied to adapt
the DE control parameters. The logistic equation is defined
as follows:
Y(t)=* Y(t-1)*[1-Y(t-1)]
(19)
Where t is the iteration count and is a control parameter
0 4. The behavior of the system represented by [26]
significantly changes with the variation in . The value of
controls the variation of the chaotic sequence. The DE
variant with time vary ing F and CR is proposed in this
paper. The variation of F chaotically, based on logistic map
and time vary ing crossover rate CR, g ive rise to the
following adaptive differential evolutionary a lgorith m:
The mutation rate factor parameter F1 is varied as per
Eq.(16) where F1 (0) lies between [0,1]. An index t is the
current iteration and F1 (t) is the new mutation factor based
on the logistic map.
F1 (t)=* Y(t-1)*[1-F1 (t-1)]
(20)
The control parameter decides whether mutation rate F 1
oscillates between a limited sequences, varies chaotically or
Page 3

stabilizes to a constant value. A very small difference in

F1 (0) causes the significant difference in its variation
pattern. The system at [27] is deterministic and displays
chaotic behavior when =4 and F(0)(0,0.25,0.5,0.75,1.0).
The mutation parameter F is increased from an initial value
F2i to a final value F2f with the iterative progress of the
optimization algorith m, as per the dynamics given by [2728] by suitable choice of initial and final values of mutation
rate.
F(t)=[(F2fF2i )(iter/iter max)+F2i ]F1t
(21)
In the proposed adaptiveDE algorith m, the value of CR is
changed iteratively as given below:
CR(iter)=(CR max Cmin )
(22)
9.If the solution is acceptable, find out the best individual

and its objective value. Otherwise, change the settings of DE
and repeat the steps 1-8.
V. DES CRIPTION OF IEEE TEST B US S YSTEM
The description of the test bus system consists of three
buses, namely standard IEEE 30-bus, IEEE 57-bus, and
IEEE 118-bus respectively. Each bus is consists of their own
generators, transformer tap settings and shunt VA R
capacitors with their branches, equality and inequality
constraints and base case of control variables and state
variables.
TABLE 1 description of IEEE test bus system
IV. IMPLEMENTATION OF ADAPTIVE DE

ALGORITHM
The proposed Adaptive DE algorith m based approach has
been formulated and implemented using matlab. Several
trials have been taken with different values of DE key
parameters such as differentiation (mutation) constant F,
crossover constant CR, size of population NP, and the
maximu m nu mber of generations (iterations) itermax which is
used here as a stopping criteria to find the optimal DE key
parameters.
The first step in the DE algorith m and Adaptive DE
algorith m is creating an init ial population. All the
independent variables which include generator voltages,
transformer tap settings and shunt VA R compensations have
to be generated according to [15], where each independent
parameter of each individual in the population is assigned a
value within its specified feasible reg ion. This creates parent
vector of independent variables for the first generation, after
finding the independent variables, dependent variables like
generator reactive power, and voltages at load buses and line
flows were calcu lated using newton-raphson load flow
(NRLF) program.
4.1Co mputational steps of DE algorith m
DE algorithm, SaDE, EPSDE and Adaptive DE have
been employed to find the best control variables setting
starting from randomly generated initial population. At the
end of the each iteration, the best individuals, based on the
fitness value, are stored. The computational steps of the
proposed DE algorith m are as follows:
1. Generate an initial population randomly within the control
variables setting starting fro m randomly within the control
variables lower and upper bounds.
2. For each individual in the population, run NRLF program,
to find the operating points.
3. Evaluate the fitness of the individuals.
4. Perform mutation and crossover operation using (16) -(17).
5. Select the individuals for the next generations.
6. Store the best individuals of the current generation.
7.Repeat steps 2-5, till the termination criterion is met.
8.Select the control variables setting corresponding to the
overall best individual.
VI. RESULTS AND DISCUSSIONS

6.1 Test B us system : IEEE 57-bus power system
The standard IEEE 57-bus system consists of eighty
transmission lines, seven generators (at the buses 1, 2, 3, 6,
8, 9, 12) and fifteen branches under load tap setting
transformers branches is taken as test system 1. There
reactive power sources are considered at buses 18, 25 and
53. Line data, bus data, variable limits and the initial values
of the control variab les are considered. The search space of
this case system has twenty five dimensions, including seven
generator voltages, fifteen transformer tap and three reactive
power sources. The system loads are given as follows:
Pload =12.508 p.u, Qload =3.364p.u. The init ial total generations
and power losses are: PG =12.7926p.u. ,QG =3.4545p.u.
6.1.1 Comparison results of standard IEEE 57 bus system
The Co mparison of IEEE 57 bus consists of the results
description
IEEE 30 bus
IEEE 57 bus
IEEE 118 bus
Buses,NB
30
57
118
Generators,NG
54
Transformers,NT
15
Shunts,NQ
14
Branches,NE
41
80
186
Equality constraints
60
114
236
Inequality constraints
125
245
572
Control variables
State variables
Base case for
P loss,MW
Base case for
T VD,p.u
19
6
5.660
27
20
27.8637
77
21
132.4500
0.58217
1.23358
1.439337
of the non- linear programming methods, particle swarm

optimization and chaotic particle swarm optimization results
are compared and the better result is obtained from the
proposed Adaptive differentia l algorith m of Ploss =0.2336 p.u
TABLE 2: SIMULATION RESULTS OF IEEE 57 BUS
TEST SYSTEM
Page 4

Variable
Initial setting
A-DE
GENERATOR VOLTA GE
V1 ,p.u
1.0400
1.0975
V2 ,p.u
1.0100
1.0828
V3 ,p.u
0.9850
1.0687
V6 ,p.u
0.9800
1.0762
V8 ,p.u
1.0050
1.0969
V9 ,p.u
0.9800
1.0645
V12,p.u
1.0150
1.0758
TRANSFORM ER TAP RATIO
T4-18
0.9810
1.0623
T4-18
1.0100
0.9749
T21-20
1.0080
1.0337
T24-26
0.9990
0.9840
T7-29
0.9840
0.9501
T34-32
0.9590
0.9794
T11-41
0.9740
1.0429
T15-45
0..9880
0.9136
T14-46
0.9700
0.9535
T10-51
0.9860
0.9328
T13-49
0.9790
1.0887
T11-43
0.9730
0.9998
T40-56
1.0100
1.0000
T39-57
0.9830
1.0085
T9-55
0.9800
1.0202
CAPACITOR BANK
QC-18 ,p.u
0.0
0.0040
QC-25 ,p.u
0.0
0.0258
QC-53 ,p.u
0.0
0.0259
Ploss ,p.u
NR*
0.2366
TVD,p.u
NR*
NR*
CPU t ime
NR*
NR*
Fig.1 Di agram of IEEE 57 bus test system
Fig.2 Convergence Results of IEEE 57 bus test system

6.2 Test system 2: IEEE 118 test bus system
To test the proposed Adaptive differential evolutionary
algorith m in solving optimal reactive power dispatch
problems of larger power systems, a standard IEEE 118-bus
test system is considered as test system 2. The search space
of this case system has seventy seven dimensions, i.e., the
fifty four generator buses, sixty four load buses, one hundred
and eighty six transmission lines, nine transformer taps and
fourteen reactive power sources. The system line data, bus
data, variable limits and the initial values of control
variables are taken. The maximu m and minimu m limits of
reactive power sources, bus voltages and transformer tapsetting limits are taken. The system loads are given as
follows: Pload =42.4200p.u, Qload =14.3800p.u. The init ial total
Page 5

generations and power losses are as follo ws: PG =43.7536 Thus the proposed algorithm has smoothly converged and
p.u., QG =8.8192p.u.,Ploss =1.25751p.u., Qloss =-7.6511 p.u.
the graph is displayed in fig. 4.
Then result and comparison table is given table 4 and 5
6.2.1 Comparison results of standard IEEE 118 bus system respectively with their generator voltage, transformer tap
The Co mparison of IEEE 118 bus consists of the results settings and shunt VA Rs (capacitor banks) with their initial
of the non- linear progra mming methods, particle swarm and final values in p.u. and the losses values of IEEE 118
optimization and chaotic particle swarm optimization results test bus system is achieved better than the classical
are compared and the better result is obtained from the Differential
Evolutionary
Algorith m.
proposed Adaptive differential algorith m of Ploss =125.7MW.
TABLE 3: COMPARISION RESULT O F IEEE 57 TEST BUS SYSTEM
Variable
A-DE
NLP
V1 ,p.u
V2 ,p.u
V3 ,p.u
V6 ,p.u
V8 ,p.u
V9 ,p.u
V12,p.u
1.0975
1.0828
1.0687
1.0762
1.0969
1.0645
1.0758
1.06
1.06
1.0538
1.06
1.06
1.06
1.06
T4-18
T4-18
T21-20
T24-26
T7-29
T34-32
T11-41
T15-45
T14-46
T10-51
T13-49
T11-43
T40-56
T39-57
T9-55
1.0623
0.9749
1.0337
0.9840
0.9501
0.9794
1.0429
0.9136
0.9535
0.9328
1.0887
0.9998
1.0000
1.0085
1.0202
0.91
1.06
0.93
1.08
1.00
1.09
0.92
0.91
0.98
0.98
0.98
0.98
0.98
1.08
1.03
QC-18 ,p.u
QC-25 ,p.u
QC-53 ,p.u
P loss,p.u
T VD,p.u
CPU time ,s
0.0040
0.0258
0.0259
0.2366
NR*
NR*
0.08352
0.00864
0.1104
0.259023
NR*
NR*
CGA
L-SaDE
PSO-w
GENERATOR VOLT AGE
0.9686
1.0600
1.06
1.0493
1.0574
1.0578
1.0567
1.0438
1.04378
0.9877
1.0364
1.0356
1.0223
1.0537
1.0546
0.9918
1.0366
1.0369
1.0044
1.0323
1.0334
T RANSFORMER TAP RATIO
0.92
0.94
0.90
0.92
1.00
1.02
0.97
1.01
1.01
0.90
1.01
1.01
0.91
0.97
0.97
1.1
0.97
0.97
0.94
0.9
0.90
0.95
0.97
0.97
1.03
0.96
0.95
1.09
0.96
0.96
0.90
0.92
0.92
0.90
0.96
0.96
1.00
1.00
1.00
0.96
0.96
0.96
1.00
0.97
0.98
CAPACITOR BANK
0.084
0.08112
0.05136
0.00816
0.05808
0.05904
0.05376
0.06192
0.06288
0.2524411
0.2426739
0.2427052
NR*
NR*
NR*
321.4872
408.97
353.08
PSO-d
CLPSO
1.06
1.0586
1.0464
1.0415
1.06
1.0423
1.0371
1.0541
1.0529
0.0337
0.0313
1.0496
1.0302
1.0342
0.98
0.98
1.01
1.01
0.98
0.97
0.90
0.97
0.96
0.97
0.93
0.97
0.99
0.96
0.98
0.99
0.98
0.99
1.01
0.99
0.93
0.91
0.97
0.95
0.98
0.95
0.95
1.00
0.96
0.97
0.9984
0.05904
0.06288
0.2428022
NR*
404.63
0.09888
0.05424
0.0.6288
0.2451520
NR*
423.30
Fig.3 Di agram of IEEE 118 bus test system
Page 6

Fig.4 Convergence Characteristics of IEEE 118 bus test system

TABLE 4 RES ULTS OF IEEE 118 B US TES T S YSTEM
Variable
Initial
setting
ADE
Variable
Initial
setting
ADE
Variable
Generator voltage
V1 ,p.u
V4 ,p.u
V6 ,p.u
V8 ,p.u
V10 ,p.u
V12 ,p.u
V15 ,p.u
V18 ,p.u
V19 ,p.u
V24 ,p.u
0.9550
0.9980
0.9900
1.0150
1.0500
0.9900
0.9700
0.9730
0.9620
0.9920
1.0442
1.0439
1.0569
1.0259
1.0400
1.0400
1.0617
1.0420
1.0482
1.0195
V65 ,p.u
V66 ,p.u
V69 ,p.u
V70 ,p.u
V72 ,p.u
V73 ,p.u
V74 ,p.u
V76 ,p.u
V77 ,p.u
V80 ,p.u
1.0050
1.0500
1.0350
0.9840
0.9800
0.9910
0.9580
0.9430
1.0060
1.0400
1.0698
1.0309
1.0785
1.0460
1.0585
1.0314
1.0579
1.0523
1.0568
1.0470
Initial
setting
Transformer tap setting
T8
1.0150
T32
1.0150
T36
0.9680
T51
0.9620
T93
0.9690
T95
0.9840
T102
1.0050
T107
1.0030
T117
0.9970
Capacitor banks
V25 ,p.u
V26 ,p.u
V27 ,p.u
V31 ,p.u
V32 ,p.u
V34 ,p.u
V36 ,p.u
V40 ,p.u
V42 ,p.u
V46 ,p.u
V49 ,p.u
V54 ,p.u
V55 ,p.u
V56 ,p.u
V59 ,p.u
V61 ,p.u
V62 ,p.u
1.0500
1.0150
0.9680
0.9670
0.9630
0.9840
0.9800
0.9700
0.9850
1.0050
1.0250
0.9550
0.9520
0.9540
0.9850
0.9950
0.9980
1.0469
1.0325
1.0751
1.0668
1.0404
1.0425
1.0498
1.0634
1.0677
1.0509
1.0546
1.0366
1.0647
1.0499
1.0442
1.0527
1.0373
V85 ,p.u
V87 ,p.u
V89 ,p.u
V90 ,p.u
V91 ,p.u
V92 ,p.u
V99 ,p.u
V100,p.u
V103,p.u
V104,p.u
V105,p.u
V107,p.u
V110,p.u
V111,p.u
V112,p.u
V113,p.u
V116,p.u
0.9850
1.0150
1.0050
0.9850
0.9800
0.9900
1.0100
1.0170
1.0100
0.9710
0.9650
0.9520
0.9730
0.9800
0.9750
0.9930
1.0050
1.0626
1.0334
1.0663
1.0365
1.0534
1.0463
1.0821
1.0725
1.0461
1.0613
1.0490
1.0420
1.0531
1.0679
1.0583
1.0803
1.0412
QC-5,p.u
QC-34 ,p.u
QC-37 ,p.u
QC-44 ,p.u
QC-45 ,p.u
QC-46 ,p.u
QC-48 ,p.u
QC-74 ,p.u
QC-79 ,p.u
QC-82 ,p.u
QC-83 .p.u
QC-105 ,p.u
QC-107 ,p.u
QC-110 ,p.u
P loss,MW
T VD,p.u
CPU,s
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
NR*
NR*
NR*
ADE
0.9788
0.9895
0.9780
0.9966
0.9643
0.9933
1.0245
0.9642
1.0071
0.0256
0.0427
0.0211
0.0211
0.0247
0.0061
0.0344
0.0255
0.0255
0.0193
0.0166
0.0308
0.0338
0.2571
125.7512
NR*
NR*
TABLE 5 COMPARISION RESULTS O F IEEE 118 BUS TEST SYSTEMS

Variable
ADE
OGSA
GSA
CLPSO
Generator voltage
PSO
Variable
ADE
V1 ,p.u
V4 ,p.u
1.0442
1.0439
1.0350
1.0554
0.9600
0.9620
V6 ,p.u
1.0569
1.0301
V8 ,p.u
Variable
1.0259
ADE
Generator voltage
V10 ,p.u
1.0400
1.0332
1.0550
1.0853
1.0420
V91 ,p.u
V92 ,p.u
1.0534
1.0463
1.0297
1.0353
0.9729
0.9754
1.0805
V99 ,p.u
1.0821
1.0175
OGSA
1.0570
GSA
0.9669
CLPSO
0.9683
PSO
V100,p.u
Variable
1.0250
1.0885
0.9811
1.0756
GSA
GSA
Generator voltage
CLPSO
PSO
1.0032
1.0927
1.0288
0.9760
0.9615
0.9568
1.0395
1.0433
1.0880
0.9540
1.0725
ADE
1.0275
GSA
1.0786
GSA
0.9617
CLPSO
0.9584
PSO
Generator voltage
V103,p.u
1.0461
1.0158
1.0266
0.9611
1.0162
Page 7

V12 ,p.u
1.0400
1.0410
0.9630
1.0092
1.0225
V104,p.u
1.0613
1.0165
0.9808
1.0125
1.0992
V15 ,p.u
1.0617
0.9973
1.0127
0.9787
1.0786
V105,p.u
1.0490
1.0197
1.0163
1.0684
0.9694
V18 ,p.u
V19 ,p.u
1.0420
1.0482
1.0047
0.9899
1.0069
1.0003
1.0799
1.0805
1.0498
1.0776
V107,p.u
V110,p.u
1.0420
1.0531
1.0408
1.0288
0.9987
1.0218
0.9769
1.0414
0.9656
1.0873
V24 ,p.u
1.0195
1.0287
1.0105
1.0286
1.0827
V111,p.u
1.0679
1.0194
0.9852
0.9790
1.0375
V25 ,p.u
1.0469
1.0600
1.0102
1.0307
0.9564
V112,p.u
1.0583
1.0132
0.9500
0.9764
1.0920
V26 ,p.u
1.0325
1.0855
1.0401
0.9877
1.0809
V113,p.u
1.0803
1.0386
0.9764
0.9721
1.0753
V27 ,p.u
1.0751
1.0081
0.9809
1.0157
1.0874
V116,p.u
1.0412
0.9724
1.0372
1.0330
0.9594
V31 ,p.u
1.0668
0.9948
0.9500
0.9615
0.9608
V32 ,p.u
1.0404
0.9993
0.9552
0.9851
1.1000
T8
0.9788
0.9568
1.0659
1.0045
1.0112
V34 ,p.u
1.0425
0.9958
0.9910
0.0157
0.9611
T32
0.9895
1.0409
0.9534
1.0609
1.0906
V36 ,p.u
1.0498
0.9835
1.0091
1.0849
1.0367
T36
0.9780
0.9963
0.9328
1.0008
1.0033
V40 ,p.u
1.0634
0.9981
0.9505
0.9830
1.0914
T51
0.9966
0.9775
1.0884
1.0093
1.0000
V42 ,p.u
1.0677
1.0068
0.9500
1.0516
0.9701
T93
0.9643
0.9960
1.0579
0.9922
1.0080
V46 ,p.u
1.0509
1.0355
0.9814
0.9754
1.0390
T95
0.9933
0.9956
0.9493
1.0074
1.0326
V49 ,p.u
1.0546
1.0333
1.0444
0.9838
1.0836
T102
1.0245
0.9882
0.9975
1.0611
0.9443
V54 ,p.u
1.0366
0.9911
1.0379
0.9637
0.9764
T107
0.9642
0.9251
0.9887
0.9307
0.9067
V55 ,p.u
1.0647
0.9914
0.9907
0.9716
1.0103
T117
1.0071
1.0661
0.9801
0.9578
0.9673
V56 ,p.u
1.0499
0.9920
1.0333
1.0250
0.9536
V59 ,p.u
1.0442
0.9909
1.0099
1.0003
0.9672
QC-5,p.u
0.0256
-0.3319
0.00
0.0000
0.0000
V61 ,p.u
1.0527
1.0747
1.0925
1.0771
1.0938
QC-34 ,p.u
0.0427
0.0480
7.46
11.7135
9.3639
V62 ,p.u
1.0373
1.0753
1.0393
1.0480
1.0978
QC-37 ,p.u
0.0211
-0.2490
0.00
0.0000
0.0000
V65 ,p.u
1.0698
0.9814
0.9998
0.9684
1.0892
QC-44 ,p.u
0.0211
0.0328
6.07
9.8932
9.3078
V66 ,p.u
1.0309
1.0487
1.0355
0.9648
1.0861
QC-45 ,p.u
0.0247
0.0383
3.33
9.4169
8.6428
V69 ,p.u
1.0785
1.0490
1.1000
0.9574
0.9665
QC-46 ,p.u
0.0061
0.0545
6.51
2.6719
8.9462
V70 ,p.u
1.0460
1.0395
1.0992
0.9765
1.0783
QC-48 ,p.u
0.0344
0.0181
4.47
2.8546
11.8092
V72 ,p.u
1.0585
0.9900
1.0014
1.0243
0.9506
QC-74 ,p.u
0.0255
0.0509
9.72
0.5471
4.6132
V73 ,p.u
1.0314
1.0547
1.0111
0.9651
0.9722
QC-79 ,p.u
0.0255
0.1104
14.25
14.8532
10.5923
V74 ,p.u
1.0579
1.0167
1.0476
1.0733
0.9713
QC-82 ,p.u
0.0193
0.0965
17.49
19.4270
16.4544
V76 ,p.u
1.0523
0.9972
1.0211
1.0302
0.9602
QC-83 .p.u
0.0166
0.0263
4.28
6.9824
9.6325
V77 ,p.u
1.0568
1.0071
1.0187
1.0275
1.0781
QC-105 ,p.u
0.0308
0.0442
12.04
9.0291
8.9513
V80 ,p.u
1.0470
1.0066
1.0462
0.9857
1.0788
QC-107 ,p.u
0.0338
0.0085
2.26
4.9926
5.0426
V85 ,p.u
1.0626
0.9893
1.0491
0.9836
0.9568
QC-110 ,p.u
0.2571
0.0144
2.94
2.2086
5.5319
V87 ,p.u
1.0334
0.9693
1.0426
1.0882
0.9642
P loss,MW
125.7512
126.99
127.7603
130.96
131.99
V89 ,p.u
1.0663
1.0527
1.0955
0.9895
0.9748
T VD,p.u
NR*
1.1829
NR*
NR*
NR*
V90 ,p.u
1.0365
1.0290
1.0417
0.9905
1.0248
CPU,s
NR*
1152.3
1198.658
1472
1215
Transformer tap ratio
Capacitor banks
VII.CONCLUS ION
In this paper, one recently developed Adaptive
differential evolutionary algorithm has been successfully
implemented to solve ORPD problem of power systems for
minimizat ion of active power losses benefits arisen are
presented. The ORPD problem is formulated as a nonlinear
optimization problem with equality and inequality
constraints of the power network. In this study, the
minimizat ion of active power loss are considered and the
Ploss =2.633MW for IEEE 57 bus and Ploss =125.7512 MW for

IEEE 118 bus. The proposed ADE is tested on IEEE 57, and
IEEE 118 bus power system to demonstrate its effective
ness. Fro m the simu lation work, it is observed that the
proposed ADE y ields the optimal settings of the control
variables of the test power system. The simu lation result also
indicates the robustness and superiority of the proposed
approach to solve the ORPD problem of power system. The
proposed ADE algorith m may be recommended as a very
Page 8

promising algorith m for solving some mo re other co mplex [17] Esmin AAA, Lambert -Torres G, de souza ACZ, A hybrid particle
swarm optimization applied to loss power minimization,IEEE Trans
engineering optimization problem for future researchers.
power Syst 2005:20(2):859-866.
ACKNOWLEDGMENT
I would especially like to express my extreme
gratitude and sincere thanks to:
Dr.A. S HUNMUGALATHAM.E,Ph.d, Professor
and Head of the Department, Electrical and Electronics
Engineering, Velammal Co llege of Engineering and
Technology for her enthusiastic and innovative guidance
during the entire period of my project.
I would like to express my deep sense of gratitude
and heartiest thanks to:
My guide MR.T.CHANDRAS EKAR M.E,
Assistant Professor II, Electrical and Electronics
Engineering, Velammal Co llege of Engineering and
Technology for her constant source of encouragement and
for the valuable guidance. Her moral support encouraged me
to process through my work successfully.
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
R EFERENCES
Abido MA, Optimal power flow using particle swarm
optimization, Elecric power Energy Syst 2002:24(7):563-571.
Dommel HW,T inney WF, Optimal power flow solutions, IEEE
Trans power apparatus Syst 1968:1866-1876.
Durairaj S,kannan PS, Devaraj D, Multi-objective VAR dispatch
using particle swarm optimization,EmergElect power Syst 2005:4.
Abido MA,Bakshawain JM, Optimal VAR dispatch using a multiobjective evolutionary algorithm, In: IEEE congress on evolutionary
computation, van cover, BC, Canada:2006. P. 730-736.
Abido MA, Multi-objective VAR dispatch using strength pareto
evolutionary algorithm W.-K. Chen, Linear Networks and Systems,
Belmont, CA: Wadsworth, 1993, pp. 123-135.
Lee KY, Park YM, Ortiz JLA united approach to optimal real and
reactive power dispatch, IEEE Trans power apparatus Syst PAS
1985:104(5):1147-1153.
Granville s, Optimal reactive power dispatch through interior point
methods,IEEE Trans power Syst 1994:9(1):98-105.
Mansour MO, Abdel-Rahaman T M, Non-linear VAR optimization
using decomposition and coordination,IEEE Trans power
apparatus Syst PAS1984:103(2):246-255.
Mamandur KRC, Chenweth RD, Optimal control of reactive power
flow for improvements in voltage profiles and for real power loss
minimization,IEEE Trans power apparatus Syst PAS
1981:100(7):3185-3193.
Roy PK, Ghoshal SP, Thakur SS, Optimal VAR for improvements
in voltage profiles and for real power loss minimization using
biogeography based optimization, Electric Power Energy Syst
199:10(3):1243-9.
Iba k, Reactive power optimization by genetic algorithm,IEEE
Transpower Syst 1994:9(2):685-692.
Wu QH, Ma JT , Power system optimal reactive power dispatch
using evolutionary programming,IEEE Trans power apparatus Syst
1995:10(3):1243-1249.
Lai LL, MA JT, Application of evolutionary programming to
reactive power planning-comparison with nonlinear programming
approach,IEEE Trans power Syst 1997:12(7):198-206.
Swain AK, Morries AKA novel hybrid evolutionary programming
method for function optimization, In: proc congress on evolutionary
computation, Vol. 1:2000, p.699-705.
Das Bhagwan D, Patvardhan c, A new hybrid evolutionary strategy
for reactive power dispatch, IEEE Trans power Syst Res
2003;65:83-90. 1995:10(3):1243-1249.
Yoshida H, Kawata K, Fukuyama S, Nakanishi Y, A particle swarm
optimization for reactive power and voltage control considering
voltage security assessment,IEEE Trans power
Syst
2000:15(4):1232-1239.
[18] AbouELEla, Abido MA, Spea SR, Differential evolution algorithm

for optimal reactive power dispatch,IEEE Trans power Syst Res
2011:81:458-464.
[19] Vardarajan M, Swarup KS, Differential evolution for optimal
reactive power dispatch, IEEE Trans power Energy Syst
2008;30:435-441.
[20] BadarAltaf QH, Urme BS, Jungre AS, Reactive power control using
dynamic particle swarm optimization for real power loss
minimization, Int J Electric Power Energy Syst 2012;41:133-136.
[21] Li Yuancheng, Wang Yiliyang Li Bin, A hybrid artificial bee
colony assisted differential evolutionary algorithm for optimal
reactive power flow,Int J Electric power Energy Syst 2013;52:2533.
[22] Chaturvedi KT, Pandit M, Srivastava I, Self-organizing hierarchical
particle swarm optimization for non-convex economic dispatch,Roy
PK, Ghoshal SP, Thakur SS, Optimal VAR for improvements in
voltage profiles and for real power loss minimization using
biogeography based optimization, IEEE Trans Power
Syst
2008;23(3):1079-1087.
[23] Pandit M, Srivastava L, Pal K, Static/dynamic optimal dispatch of
energy and reserveusing recurrent differential evolution, to appear
in
IET proceedings- GenerTrasmDistri, doi:10.1049/ietgtd.2013.0127.ISSN 1751-8687.
[24] Storn R, Price K, Differential evolution- a simple and efficient
heuristic for global optimization over continuous spaces, Tech
Report TR-95-012,ICSI;1995.
[25] Storn R, Price K, Differential evolution- a simple and efficient
heuristic for global optimization over continuous spaces, J global
optim 1997;11: 34-359.
[26] Vesterstrom J, Thomsen R, A comparative study of differential
evolution, particle swarm optimization and evolutionary algorithm:
on numerical benchmark problems, In; IEEE congress on
evolutionary computation:2004. p. 90-987.
[27] Das S, Abrham A, Konar A, particle swarm optimization an d
differential evolutionary algorithms: technical analysis, applications
and
hybridization
perspectives.
<http;//www.softcomputing.net/aciis.pdf>.
[28] Yang Zhenyu, Tang KE, Yao Xin,Differential evolution for high
dimensional function optimization, In IEEE congress on,
Evolutionary computation (CEC2007); p.3523-3530.
[29] Vaisakh K, KantaRao P, differential evolution based optimal power
dispatch for voltage stability enhancement , J theorAppl Inform
Technol 2008; 638- 646.
[30] Balamurugan R, Suramanian S, Self adaptive differential evolution
based power dispatch of generators with valve-point effects and
multiple fuel options. computingSciEng 2007;1:10-17.
[31] Arya LD, Singh Pushpendra, Titare LS, Anticipatory reactive power
reserve maximization using differential evolution. Int J Electric
Power Energy Syst 2012;35:66-73.
[32] Arya LD, Singh Pushpendra, T itare LS, Optimum load shedding
based on sensitivity to enhance static voltage stability using DE,
Swarm EvolutComput 2012;6:25-38.
[33] Kalanmony Deb, multi-objective optimization using evolutionary
algorithm, John wiley& Sons Ltd.2010.
[34] Qin AK, Huang VL, Suganthan PN, Differential algorithm with
strategy adaptation for global numerical optimization, IEEE Trans
EvolutComput 2009;13(2):398-417.
[35] Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF, Differential
algorithm with ensemble of parameters and mutation strategies,
Appl Soft Comput 2011;11(2):1679-1696.
[36] Yu G, Wang X, Li P, Application of chaotic theory in differential
evolution algorithms, In : proceedings of international conference
on natural Coputation (ICNC);2010. P. 3816-3820.
[37] Capnetto R, ForttunaFazzino S, XibiliaMG,Chaotic sequences to
improve the performance of evolutionary algorithms, IEEE Trans
EvolutComput 2003;7(3):289-304.
[38] Coelho R, Mariani VC, Combining of Chaotic differential evolution
and quadratic programming for economic dispatch optimization with
valve point effect , IEEE Trans Power Syst 2006;21(2):989-996.
Page 9

[39] He D, Dong G, Wang F, Mao Z, optimization of dynamic economic
dispatch with valve point effect using chaotic sequence based
differential evolution algorithms, Energy Convers Manage
2011;52(2):1026-1032.
[40] Pal Kirti, Pandit M, Srivastava L, Joint energy and reserve dispatch
in a multi-area competitive market using time varying differential
evolution, Int J EngSciTechnol (IJEST)2011;3(1):87-10.
[41] Standard IEEE 57 Test Bus System.
[42] Standard IEEE 118 Test Bus System.
Page 10

An Adaptive Differential Evolution Algorithm For Reactive Power Dispatch

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

An Adaptive Differential Evolution Algorithm For Reactive Power Dispatch

Hochgeladen von

Copyright:

Verfügbare Formate

International Journal of Research in Advanced Technology - IJORAT

Vol. 1, Issue 3, DECEMBER 2015