keywords" content="call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals, yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal,
keywords" content="call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals, yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal,
keywords" content="call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals, yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal,
=
+ + =
NG
i
i Gi i Gi i
C P b P a F
1
2
) ( (
(11)
The minimization problem is subjected to following equality and inequality constraints
4.1 Equality Constraints: These are the sets of nonlinear power flow equations that govern the power system:
0 ) cos(
1
= +
=
j i ij ij j
n
j
i Di Gi
Y V V P P o o u (12)
0 ) sin(
1
= + +
=
j i ij ij j
n
j
i Di Gi
Y V V Q Q o o u (13)
where
Gi
P and
Gi
Q are the real and reactive power outputs injected at bus i , the load demand at the same bus
is represented by
Di
P and
Di
Q , and elements of the bus admittance matrix are represented by
ij
Y and
ij
u .
4.2 Inequality Constraints: These are the set of constraints that represent the system operational and security
limits like the bounds on the following:
1) generators real and reactive power outputs:
ng i P P P
Gi Gi Gi
, , 1 ,
max min
= s s (14)
ng i Q Q Q
Gi Gi Gi
, , 1 ,
max min
= s s
(15)
2) voltage magnitudes at each bus in the network:
ng i V V V
i i i
, , 1 ,
max min
= s s
(16)
3) transformer tap settings:
NT i T T T
i i i
, , 1 ,
max min
= s s
(17)
4) reactive power injections due to capacitor banks:
CS i Q Q Q
Ci Ci Ci
, , 1 ,
max min
= s s
(18)
5) transmission lines loading:
nl i S S
i i
, , 1 ,
max
= s
(19)
6) voltage stability index:
NL i Lj Lj
i i
, , 1 ,
max
= s
(20)
7) SSSC device constraints:
SSSC Series voltage source magnitude
max min
se se se
V V V s s
(21)
Series voltage source angle
max min
se se se
u u u s s
(22)
The equality constraints are satisfied by running the power flow program. The generator bus real power
generations (
gi
P ), generator terminal voltages (
gi
V ), transformer tap settings (
i
T ), the reactive power
generation of capacitor bank (
Ci
Q ),
ji
P and
ji
Q of SSSC are control variables and they are self-restricted by
the representation itself. The active power generation at the slack bus (
gs
P ), load bus voltages (
Li
V ) and
Allocation of SSSC FACTS Device for Optimal Power Flow Solution Using DE Approach
4
reactive power generation (
gi
Q ), line flows (
i
S ), and voltage stability (
j
L )-index are state variables which are
restricted through penalty function approach.
V. DIFFERENTIAL EVOLUTION ALGORITHM OPTIMIZATION PROCESS
A differential evolution algorithm (DEA) is an evolutionary computation method that was originally
introduced by Storn and Price in 1995. DEA uses rather greedy selection and less stochastic approach to solve
optimisation problems than other classical EAs. There are also a number of significant advantages when using
DEA.
A Initialization:
In the first step of the DEA optimization process, the population of candidate solutions must be
initialized. Typically, each decision parameter in every vector of the initial population is assigned a randomly
chosen value from within its corresponding feasible bounds:
(23)
where i = 1,,NP and j = 1,,D. x
j,i
(G=0)
is the initial value (G=0) of the jth parameter of the i
th
individual vector. x
j
min
and x
j
max
are the lower and upper bounds of the j
th
decision parameter, respectively. Once
every vector of the population has been initialized, its corresponding fitness value is calculated and stored for
future reference.
B. Mutation:
The DEA optimisation process is carried out by applying the following three basic genetic operations;
mutation, recombination (also known as crossover) and selection. After the population is initialised, the
operators of mutation, crossover and selection create the population of the next generation P
(G+1)
by using the
current population P
(G)
. At every generation G, each vector in the population has to serve once as a target vector
X
i
(G)
, the parameter vector has index i, and is compared with a mutant vector. The mutation operator generates
mutant vectors (V
i
(G)
) by perturbing a randomly selected vector (X
r1
) with the difference of two other randomly
selected vectors (X
r2
and X
r3
).
(24)
Vector indices r1, r2 and r3 are randomly chosen, which r1, r2 and r3 {1,,NP} and r1 r2 r3 i. Xr1, Xr2
and Xr3 are selected anew for each parent vector. F is a user-defined constant known as the scaling mutation
factor, which is typically chosen from within the range [0, 1+] .
C. Crossover:
In this step, crossover operation is applied in DEA because it helps to increase the diversity among the
mutant parameter vectors. At the generation G, the crossover operation creates trial vectors (U
i
) by mixing the
parameters of the mutant vectors ( V
i
) with the target vectors (X
i
) according to a selected probability distribution:
(25)
The crossover constant CR is a user-defined value (known as the crossover probability), which is
usually selected from within the range [0, 1]. The crossover constant controls the diversity of the population and
aids the algorithm to escape from local optima. rand
j
is a uniformly distributed random number within the range
(0,1) generated anew for each value of j. s is the trial parameter with randomly chosen index {1,,D}, which
ensures that the trial vector gets at least one parameter from the mutant vector.
5.4 Selection: Finally, the selection operator is applied in the last stage of the DEA procedure. The selection
operator chooses the vectors that are going to compose the population in the next generation. This operator
compares the fitness of the trial vector and the corresponding target vector and selects the one that provides the
best solution. The fitter of the two vectors is then allowed to advance into the next generation according to
equation (26):
(26)
The DEA optimization process is repeated across generations to improve the fitness of individuals. The
overall optimization process is stopped whenever maximum number of generations is reached or other
predetermined convergence criterion is satisfied.
Allocation of SSSC FACTS Device for Optimal Power Flow Solution Using DE Approach
5
VI. OVERALL COMPUTATIONAL PROCEDURE FOR SOLVING THE PROBLEM
The implementation steps of the proposed DE based algorithm can be written as follows;
Step 1: Input the system data for load flow analysis
Step 2: Select FACTS device and its location in the system
Step 3: At the generation Gen =0; set the simulation parameters of DE and randomly initialize k individuals
within respective limits and save them in the archive.
Step 4: For each individual in the archive, run power flow under the selected network contingency to determine
load bus voltages, angles, load bus voltage stability indices, generator reactive power outputs and
calculate line power flows.
Step 5: Evaluate the penalty functions
Step 6: Evaluate the objective function values and the corresponding fitness values for each individual.
Step 7: Find the new generation individuals and store them.
Step 8: Increase the generation counter Gen = Gen+1.
Step 9: Apply the DE operators to generate new k individuals
Step 10: For each new individual in the archive, run power flow to determine load bus voltages, angles, load bus
voltage stability indices, generator reactive power outputs and calculate line power flows.
Step 11: Evaluate the penalty functions
Step 12: Evaluate the objective function values and the corresponding fitness values for each new individual.
Step 13: Apply the selection operator of DE and update the individuals.
Step 14: Update the new generation and store them.
Step 15: If one of stopping criterion have not been met, repeat steps 4-14. Else go to stop 16
Step 16: Print the results
VII. SIMULATION RESULTS
The proposed DE algorithm is employed to solve optimal power flow problem by incorporating SSSC
FACTS device for enhancement of system performance on standard IEEE 30-bus test system. The DE
parameters used for the simulation are summarized in Table I.
Table I: Optimal Parameter Settings for DE
S.No. Parameters of Differential evolution
Parameter values
1.
2.
3.
4.
Population size
Number of iterations
Scaling mutation factor, F
Crossover Factor, CR
50
250
0.5
0.9
The network and load data for this system is taken from [22]. To test the ability of the proposed DE
algorithm one objective function is considered that is minimization of cost of generation. In order to show the
affect of power flow control capability of the FACTS device in proposed DE OPF algorithm, two sub case
studies are carried out on the standard IEEE 30-bus system.
Case (a): power system normal operation (without FACTS devices installation),
Case (b): one SSSC device is installed in line connected between buses 9 and 10 with real and reactive power
flows (
ji
P , and
ji
Q ) as 1.25 times of base case values. The ratings of SSSC are:
se
V is in the range [0.001,
0.2],
se
u is in the range [0,2t ].
The first case is the normal operation of network without using any FACTS device, in second case
optimal location of device has been considered.
From the Table II, it can be seen that details of the control variables and the installation of SSSC in the
network gives the best performance of the system in the network in terms of reduction in cost of generation,
power loss reduction, maximum of voltage stability indices. It also gives that DE algorithm is able to enhance
the system performance while maintaining all control variables and reactive power outputs within their limits.
Table II: Optimal settings of control variables for IEEE 30-bus system
Control
Variables
Limits(p.u) DE
Without
FACTS
DE With
FACTS
device
SSSC
Min Max
Allocation of SSSC FACTS Device for Optimal Power Flow Solution Using DE Approach
6
P
G1
P
G2
P
G3
P
G4
P
G5
P
G6
0.50
0.20
0.10
0.10
0.15
0.12
2.000
0.800
0.350
0.300
0.500
0.400
1.7714
0.4869
0.2104
0.1183
0.2127
0.1200
1.7615
0.4911
0.1431
0.1362
0.2523
0.1200
V
G1
V
G2
V
G3
V
G4
V
G5
V
G6
0.9
0.9
0.9
0.9
0.9
0.9
1.10
1.10
1.10
1.10
1.10
1.10
1.083
1.0641
1.0365
1.0124
1.0339
1.0444
1.0736
1.0601
1.0355
0.9987
1.0319
1.0344
Tap - 1
Tap - 2
Tap - 3
Tap - 4
0.9
0.9
0.9
0.9
1.1
1.1
1.1
1.1
1.0471
0.9167
0.9529
0.9504
1.0317
0.9009
0.9666
0.9444
Q
C10
Q
C12
Q
C15
Q
C17
Q
C20
Q
C21
Q
C23
Q
C24
Q
C29
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.10
0.10
0.10
0.10
0.10
0.10
0.10
0.10
0.10
0.0467
0.1000
0.0786
0.0795
0.1000
0.0546
0.0160
0.0270
0.0233
0.0000
0.0373
0.0394
0.0549
0.0076
0.0988
0.0381
0.0525
0.0463
Cost ($/h)
Ploss (p.u.)
Ljmax
798.86
0.0857
0.1281
795.7573
0.0702
0.1271
The convergence characteristic of the cost of generation DE without and with SSSC at optimal location
is shown in Fig. 2.
Fig. 2: Convergence of cost of generation without and with sssc using de for ieee 30-bus system
Fig. 3: L-index without and with SSSC device using DE for IEEE 30-bus system
The Figures 4-6 show the percentage MVA loading of the lines, voltage profiles and voltage angles
indices of buses without and with SSSC at optimal location.
Fig.4:Percentage MVA line loadings of IEEE30-bus system after optimization without and with SSSC using DE
Allocation of SSSC FACTS Device for Optimal Power Flow Solution Using DE Approach
7
Fig. 5: Voltage profiles of IEEE 30-bus system after optimization without and with SSSC using DE
Fig. 6: Voltage angles of IEEE 30-bus system after optimization without and with SSSC using DE
A Comparison of fuel cost of generation without FACTS devices:
The comparison of fuel cost of the proposed method with those of the methods reported in the literature
is given in Table III. It can be seen that DE algorithm gives less cost of generation compared with the cost of
generation obtained with other OPF methods.
Table III: Comparison of fuel costs for IEEE 30-bus system
Method Fuel Cost ($/hr)
EP [16] 802.907
TS [16] 802.502
TS/SA [16] 802.788
ITS [16] 804.556
IEP [16] 802.465
SADE_ALM [17] 802.404
OPFPSO [18] 802.410
MDE-OPF [19] 802.376
Genetic Algorithm ($/hr) [20] 803.050
Gradient method [21] 802.430
PSO (proposed) without FACTS 800.867
PSO (proposed) with SSSC 797.187
DE(proposed) without FACTS 798.860
DE(proposed) with SSSC 795.757
VIII. CONCLUSIONS
This paper has presented an OPF model incorporating FACTS controller SSSC using DE algorithm for
enhancement of system performance. This model is able to solve power networks of any size and converges
with any number of iterations and independent of initial conditions. The standard IEEE 30-bus system has been
used to demonstrate the proposed method over a wide range of power flow variations in the transmission system.
The results shows that proposed OPF with Static Series Synchronous Compensator (SSSC) scheme using DE is
very effective compared to other methods in improving the security of the power system.
REFERENCES
[1]. N.Li, Y.Xu, and H.Chen (2000), FACTS Based Power Flow Control in Interconnected Power
Systems, IEEE Trans. on Power Systems, Vol.15, No.1, pp. 257-262, Feb.
[2]. N. G. Hingorani, L. Gyugyi, Understanding FACTS: Concepts and Technology of Flexible AC
Transmission Systems, IEEE Press, New- York, 2000.
Allocation of SSSC FACTS Device for Optimal Power Flow Solution Using DE Approach
8
[3]. Hsiao-Dong Chiang and Rene Jean Jumeau, Toward a practical performance index for detecting
voltage collapse in electric power systems, IEEE Transactions on power systems, Vol.10, No.21,
1992, pp.584-592.
[4]. P Kessel and H Glavitsch, Estimating the voltage stability of a power system, IEEE Trans. on PD,
Vol.1, No.3, pp.346-354, 1986.
[5]. IEEE Power Engineering Society/CIGRE, FACTS Overview, IEEE Service Centre, Piscataway, N.J.,
1995, Special issue, 95TP108.
[6]. IEEE Power Engineering Society/CIGRE, FACTS Applications, IEEE Service Centre, Piscataway,
N.J., 1996, Special issue,96TP116-0.
[7]. A. R. Messia, M. A. Perez, and E. Hernandez, "Co-ordinated application of FACTS devices to enhance
study-state voltage stability," International Journal on Electrical Power and Energy Systems, vol. 25,
no. 4, pp. 259-267, May 2003.
[8]. Enrique Acha, Claudio R. Fuerte-Esquivel, Hugo Ambriz-Perez, Cesar Angeles-Camacho. FACTS
modelling and simulation in power networks
[9]. Alsac O., Stott B. Optimal load flow with steady state security, IEEE Trans Pwr Appar Syst
1974;PAS-93;745-51.
[10]. Dommel H, Tinny W. Optimal power flow solution, IEEE Trans Pwr Appar Syst 1968; PAS-87(10);
1866-76.
[11]. P. E. O. Yumbla, J. M. Ramirez, C. A. Coello Coello. Optimal power flow subject to J. security
constraints solved with a particle swarm optimizer, IEEE Transactions on Power Systems, vol. 23, no.
1, Feb., 2008.
[12]. Abido MA. Optimal power flow using particle swarm optimization, Electric Power Energy Syst
2002; 24(7): 563-71
[13]. M.Noroozian, L.Angquist, M.Ghandhari, G.Anderson, "Use of UPFC for Optimal Power Flow
Control", IEEE Trans. on Power Delivery, Vol.12, No.4, October 1997.
[14]. Roy Billinton, Mahmud Fotuhi-Firuzabad, Sherif Omar Faried, Saleh Aboreshaid, "Impact of Unified
Power Flow Controllers om Power System Reliability", IEEE Trans. on Power Systems Vol.15, No.1,
February 2000
[15]. Kennedy and R. Eberhart (1995), Particle Swarm Optimization, Proc. of IEEE Conf. on Neural
Networks (ICNN), Vol. IV, pp. 1942-1948, Perth, Australia.
[16]. W. Ongsakul and T. Tantimaporn, Optimal power flow by improved evolutionary programming,
Electric Power Components and Systems, 34:79-95, 2006.
[17]. Peerapol Jirapong and Weerakorn Ongsakul Optimal placement of multi type FACTS devices for
total transfer capability enhancement using hybrid evolutionary algorithm, Electric power
componenets and systems, 01 September 2007, 35:981-1005.
[18]. Abido MA. Optimal power flow using particle swarm optimization, Electric Power Energy Syst
2002; 24(7): 563-71.
[19]. Ramasubramanian Jayashree and Mohammed Abdullah Khan A unified optimization approach for the
enhancement of available transfer capability and congestion management using unified power flow
controller, Serbian journal of electrical engineering, Vol.5, No.2, November 2008, 305-324.
[20]. D.Devaraj and B.Yegnanarayana, Genetic Algorithm-Based Optimal Power Flow for Security
Enhancement, IEE Proceedings on Generation, Transmission and Distribution 2005, 152(6), pp 899-
905.
[21]. X.P.Zhang, S.G.Petoussis and K.R.Godfrey Nonlinear interior point optimal power flow method
based on a current mismatch formulation, IEE Proc.-Gener. Transm. Distrb. Vol.152, No.6, January
2005, 795-805.
[22]. IEEE 30-bus system (1996), (Online) Available at //www.ee.washington.ed