# An Improved Particle Swarm Optimization Algorithm Using Eagle Strategy for Power Loss Minimization

Authors: Hamza Yapıcı; Nurettin Çetinkaya
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

The power loss in electrical power systems is an important issue. Many techniques are used to reduce active power losses in a power system where the controlling of reactive power is one of the methods for decreasing the losses in any power system. In this paper, an improved particle swarm optimization algorithm using eagle strategy (ESPSO) is proposed for solving reactive power optimization problem to minimize the power losses. All simulations and numerical analysis have been performed on IEEE 30-bus power system, IEEE 118-bus power system, and a real power distribution subsystem. Moreover, the proposed method is tested on some benchmark functions. Results obtained in this study are compared with commonly used algorithms: particle swarm optimization (PSO) algorithm, genetic algorithm (GA), artificial bee colony (ABC) algorithm, firefly algorithm (FA), differential evolution (DE), and hybrid genetic algorithm with particle swarm optimization (hGAPSO). Results obtained in all simulations and analysis show that the proposed method is superior and more effective compared to the other methods.


---

## Body

## 1. Introduction

The reactive power optimization approach is important for power quality, system stability, and optimal operation of electrical power systems. Reactive power control can be set with adjusting the voltage levels, tap positions of transformers, shunt capacitors, and other control variables. The reactive power optimization approach can minimize the power losses and improve the voltage profiles. Many conventional methods such as dynamic programming, linear and nonlinear programing, interior point method, genetic algorithm, and quadratic programming have been employed for solving reactive power optimization problem [1–5].Moreover, in the last years, various intelligence computation methods have proposed for the reactive power optimization such as particle swarm optimization, differential evolution, ant colony, and BC [6–9]. The optimization methods along with fuzzy logic [10] have been used to adjust the optimal setting of power system variables, containing flexible AC transmission systems (FACTs) devices, where the power system losses have been reduced by the optimal placement of thyristor-controlled series compensation (TCSC) and static VAR compensator (SVC). A dynamic weights based particle swarm optimization (PSO) algorithm has been used for reducing power loss [11]. This approach has been implemented to IEEE 6-bus system. The PSO based reactive power optimization method has been presented in [12] for minimizing the total support cost from generators and reactive compensators. In [13], modified artificial fish swarm algorithm (MAFSA) has been proposed to optimize the reactive power optimization and this method has been applied to IEEE 57-bus system. A seeker optimization algorithm has been presented for reactive power dispatch method in [14]; the authors applied the algorithm to several benchmark functions, IEEE 57 and IEEE 118 test systems and then compared with different conventional nonlinear programming methods (such as different versions of GA, DE, and PSO). The optimum conditions for operating the electric power systems have been determined by GA [15]. Authors selected the main objective of the study as the definition of the load buses voltage amplitude values. By this way, they get the minimum power losses in the transmission lines. In [16], reactive power optimization has been solved by adjusting generator voltages, transformer taps, and capacitors/reactors and three GA/SA/TS hybrid algorithms have been used. In the other study [17], the reactive power optimization problem has been solved by using evolutionary computation techniques such as genetic and particle swarm optimization algorithms, and voltage bus magnitude, transformer tap setting, and the reactive power injected by capacitor banks were selected as control variables. Authors applied the proposed algorithms to IEEE 30-bus and IEEE 118-bus systems. In [18], distributed generation has been taken into distribution system and a multiobjective model for reactive power optimization has been investigated to reduce the system loss and voltage deviation and minimize the total reactive compensation devices capacity. Simulation and analysis have been carried out on IEEE 33-bus system with a dynamically adaptive multiobjective particle swarm optimization (DAMOPSO) algorithm. In [19], an improved mind evolutionary algorithm (IMEA) has been presented for optimal reactive power dispatch and voltage control. The proposed method has been carried out on IEEE 30-bus system and simulation results have been compared with GA to prove its efficiency and superiority. On the other study, GA has been proposed for optimization of reactive power flow in a power system [20]. The authors used two different objective functions: active power losses and the voltage-stability-oriented index.In this study, a particle swarm optimization algorithm using eagle strategy (ESPSO) has been developed to implement reactive power optimization for reducing power losses. Eagle strategy (ES) has been originated by the foraging behavior of eagles such as golden eagles. This strategy has two important parameters: random search and intensive chase. At first it explores the search space globally, and then in the second case the strategy makes an intensive local search with using an effective local optimizer method [21–23]. So, SPO has been improved using ES and implemented to reactive power optimization problem.Moreover, simulations and analysis of reactive power optimization problem have been performed on IEEE 30-bus test system, IEEE 118-bus test system, and a real power subsystem, and the proposed approach has been compared with various algorithms to show performance. It can be seen that, in case studies, the proposed approach has been outperformed compared to other methods mentioned.


## 2. Problem Formulation

This paper defines the objective function as reducing power losses of power system. The objective function given in [14, 15, 17, 24] for reactive power optimization problem is given in (1). The equality and inequality constraints are denoted in (3). Note that the real distribution subsystem considered in this paper has no generators; therefore, we did not handle the generator constraints for this power system. Moreover, control variables are self-constrained but dependent variables are implemented to the objective function by using penalty terms. So, the objective function can be given as in (2) as follows:(1)PLoss=∑i=1Nighi,j·Vi2+Vj2-2·Vi·Vj·cos⁡θi,j,(2)fx→,y→=PLoss+λ1∑NVΔVL2+λ2∑NQΔQG2+λ3∑NiΔIli,j2,where λ1, λ2, and λ3 are the penalty factors which are equal to 1000, NV is the number of load buses, and NQ is the number of generator buses which injected reactive power. If VL<VLmin then ΔVL is equal to VLmin-VL and if VLmax<VL then ΔVL is equal to VL-VLmax. On the other hand, if QG<QGmin then ΔQG is equal to QGmin-QG and if QGmax<QG then ΔQG is equal to QG-QGmax. If Ili,j>Ili,jmax then Ili,j is equal to Ili,jmax.Note that superscripts “min” and “max” in (3) express lower and upper limits, respectively. Here, x→ is the vector of control variable where x→=VGTKQCT and y→ is the vector of dependent variable where y→=VLQGIlT.(3)PGi-Pli-Vi·∑j∈NiVj·ghi,j·cos⁡θi,j+bhi,j·sin⁡θi,j=0,i∈Nslb,QGi-Qli-Vi·∑j∈NiVj·ghi,j·sin⁡θi,j-bhi,j·cos⁡θi,j=0,i∈Npq,TKmin≤TK≤TKmax,K∈NK,Qcimin≤Qci≤Qcimax,i∈NC,PGimin≤PGi≤PGimax,i∈NG,QGimin≤QGi≤QGimax,i∈NG,Vimin≤Vi≤Vimax,i∈Ni,Ili,j<Ili,jmax,i,j∈Ni.


## 3. Method

### 3.1. Eagle Strategy (ES)

Eagle strategy (ES) is a two-stage process, developed by Yang et al. [22]. ES is inspired by the foraging behavior of eagles that they fly random in analogy to the Lévy flights. It uses different algorithms which make global search and local search for fitting different proposes. ES has some similarities with random restart hill climbing method, but there are two important differences: ES is a two-stage method, and so a global search randomization method and an intensive local search are combined and ES uses Lévy walks so it can explore the global search space more effectively. Essentially, ES makes the global search in the n-dimensional space with Lévy flights; if any probable solution is found, an intensive local optimizer is put to use for local search such as differential evolution, particle swarm optimization algorithm, and artificial bee colony that these have local search capability. Then the procedure starts again with new global search in the new area [21–23, 25, 26].Note that ES is not an algorithm; it is a method. In fact, various algorithms can be used at the different stages. This provides that it combines the advantages of these different algorithms so as to obtain better results.Lévy distribution [22] is given as follows:(4)Ls~λΓλsin⁡πλ/2π1s1+λ,s≫s0>0,1<λ≤3,where Γλ is standard gamma function ands is the step length. When λ=3, it becomes Brownian motion as a special case. We used λ=2; thus Lévy walks become the Cauchy distribution.Pseudocode of ES can be given as in Pseudocode1.Pseudocode 1
Load objective functionf(x)
Initial population(atk=0)
While
(
m
i
n
i
m
u
m
f
k
+
1
-
m
i
n
i
m
u
m
f
k ≤ tolerance or
k
>
m
a
x
n
u
m
b
e
r
o
f
i
t
e
r
a
t
i
o
n
s
)
Random global search (Levy walks)
Local search by using PSO
If a better solution is found
Update the current best
End if
k=k+1
end


### 3.2. Particle Swarm Optimization (PSO)

This technique processing is so easy that PSO utilizes some parameters and definitions of the optimization process and then it starts the process with an initial random population, named particles. Each of these particles has a possible solution for the main problem and is processed as a part inn-dimensional space. In the variable space, each particle has a position identified by xik=xi1k,xi2k,…,xink and a velocity identified by vik=vi1k,vi2k,…,vink. Velocity and position of each particle is updated using (5) and (6), respectively. If a particle has a best position, it is carried to the next. Additionally, best positions are represented as pbest and the best position of all particles is represented as gbest [27–29]. (5)vik+1=wivik+c1r1pbesti-xik+c2r2gbesti-xik,(6)xik+1=xik+vik+1.The weight function is(7)wi=wmax-wmax-wminkmax×k,where r1 and r2 are selected randomly in the range 0,1 and c1 and c2 are acceleration coefficients that inspect the motion of a particle.Pseudocode of PSO see Pseudocode2.Pseudocode 2
Load objective functionf(x)
Generate the initial population and velocity ofn particles
Find global best (atk=0)
While
(
minimum
f
k
+
1
-
minimum
f
k ≤ tolerance or
k
>
m
a
x
n
u
m
b
e
r
o
f
i
t
e
r
a
t
i
o
n
s
)
Calculate new velocity and position of each particle via (5) and (6)
Evaluate the new fitness
Iffxik+1<fpbestik
pbestik+1=xik+1
Update global best
Update weight
k=k+1
end


### 3.3. Eagle Strategy with Particle Swarm Optimization (ESPSO)

We know that for local search we can use an algorithm such as PSO, DE, and ABC; therefore, PSO is applied to the local search stage of ES method. On the other side, randomization with Lévy walks can be used in the global search. The proposed method is a population-based algorithm.We used the parameters of PSO used in most applications [18, 19], where c1=c2=2, wmin=0.4, and wmax=0.9; then we set λ=2. We used 500 iterations for benchmark functions and 100 iterations for reactive power optimization problem. There are two important situations, Γ→∞ and Γ→0. If Γ→∞, the velocity of particles cannot be decreased and particles are far from one another. If Γ→0, then the particles are short sighted, so particles will be trapped in a confined space and velocity of this particles can be very small.There are several stopping criteria given in the literature: a fixed number of generations, the number of iterations since the last change of the best solution being greater than a specified number, the number of iterations reaching maximum number, a located string with a certain value, and no change in the average fitness after some generations. In this paper, the stopping criteria are chosen as the maximum number of iterations and the tolerance value for fitness whereminimumfk+1-minimumfk≤tolerance.Steps of proposed method have been explained in Algorithm1.Algorithm 1
Step
1. Load function and its parameters
Step
2. Generate initial population randomly
Step
3. While minimumfk+1-minimumfk≤tolerance or
k > max number of iterations,
performing random global search using Levy Flightxk+1=xk+αLs,λ,
(λ=1.5,  α=1,  and step length s set as s=5)
Then, find a promising solution
Step
4. Determine a random number. Set switching parameter p for controlling
between global search and local search. (We setp=0.2)
Ifp<rand
switch to local search stage (go to Step  5)
else
switch to global search stage (go to Step  6)
Step
5. In intensive local search stage, search around a promising solution,
Calculate new velocity and position of each particle via (5) and (6),
Then evaluate new fitness (Use the objective function based on Newton–Raphson
power flow for reactive power optimization problem)
Iff(xi(k+1))<f(pbesti(k))
pbestik+1=xi(k+1)
Step
6. Update,
k=k+1
Step
7. Stopping criterion,
Maximum number of iterations or a given tolerance (tolerance set as1.0000e-9
for reactive power optimization problem)
Step
8. If any criterion is provided, then stop the algorithm else go to Step 3


## 3.1. Eagle Strategy (ES)

Eagle strategy (ES) is a two-stage process, developed by Yang et al. [22]. ES is inspired by the foraging behavior of eagles that they fly random in analogy to the Lévy flights. It uses different algorithms which make global search and local search for fitting different proposes. ES has some similarities with random restart hill climbing method, but there are two important differences: ES is a two-stage method, and so a global search randomization method and an intensive local search are combined and ES uses Lévy walks so it can explore the global search space more effectively. Essentially, ES makes the global search in the n-dimensional space with Lévy flights; if any probable solution is found, an intensive local optimizer is put to use for local search such as differential evolution, particle swarm optimization algorithm, and artificial bee colony that these have local search capability. Then the procedure starts again with new global search in the new area [21–23, 25, 26].Note that ES is not an algorithm; it is a method. In fact, various algorithms can be used at the different stages. This provides that it combines the advantages of these different algorithms so as to obtain better results.Lévy distribution [22] is given as follows:(4)Ls~λΓλsin⁡πλ/2π1s1+λ,s≫s0>0,1<λ≤3,where Γλ is standard gamma function ands is the step length. When λ=3, it becomes Brownian motion as a special case. We used λ=2; thus Lévy walks become the Cauchy distribution.Pseudocode of ES can be given as in Pseudocode1.Pseudocode 1
Load objective functionf(x)
Initial population(atk=0)
While
(
m
i
n
i
m
u
m
f
k
+
1
-
m
i
n
i
m
u
m
f
k ≤ tolerance or
k
>
m
a
x
n
u
m
b
e
r
o
f
i
t
e
r
a
t
i
o
n
s
)
Random global search (Levy walks)
Local search by using PSO
If a better solution is found
Update the current best
End if
k=k+1
end


## 3.2. Particle Swarm Optimization (PSO)

This technique processing is so easy that PSO utilizes some parameters and definitions of the optimization process and then it starts the process with an initial random population, named particles. Each of these particles has a possible solution for the main problem and is processed as a part inn-dimensional space. In the variable space, each particle has a position identified by xik=xi1k,xi2k,…,xink and a velocity identified by vik=vi1k,vi2k,…,vink. Velocity and position of each particle is updated using (5) and (6), respectively. If a particle has a best position, it is carried to the next. Additionally, best positions are represented as pbest and the best position of all particles is represented as gbest [27–29]. (5)vik+1=wivik+c1r1pbesti-xik+c2r2gbesti-xik,(6)xik+1=xik+vik+1.The weight function is(7)wi=wmax-wmax-wminkmax×k,where r1 and r2 are selected randomly in the range 0,1 and c1 and c2 are acceleration coefficients that inspect the motion of a particle.Pseudocode of PSO see Pseudocode2.Pseudocode 2
Load objective functionf(x)
Generate the initial population and velocity ofn particles
Find global best (atk=0)
While
(
minimum
f
k
+
1
-
minimum
f
k ≤ tolerance or
k
>
m
a
x
n
u
m
b
e
r
o
f
i
t
e
r
a
t
i
o
n
s
)
Calculate new velocity and position of each particle via (5) and (6)
Evaluate the new fitness
Iffxik+1<fpbestik
pbestik+1=xik+1
Update global best
Update weight
k=k+1
end


## 3.3. Eagle Strategy with Particle Swarm Optimization (ESPSO)

We know that for local search we can use an algorithm such as PSO, DE, and ABC; therefore, PSO is applied to the local search stage of ES method. On the other side, randomization with Lévy walks can be used in the global search. The proposed method is a population-based algorithm.We used the parameters of PSO used in most applications [18, 19], where c1=c2=2, wmin=0.4, and wmax=0.9; then we set λ=2. We used 500 iterations for benchmark functions and 100 iterations for reactive power optimization problem. There are two important situations, Γ→∞ and Γ→0. If Γ→∞, the velocity of particles cannot be decreased and particles are far from one another. If Γ→0, then the particles are short sighted, so particles will be trapped in a confined space and velocity of this particles can be very small.There are several stopping criteria given in the literature: a fixed number of generations, the number of iterations since the last change of the best solution being greater than a specified number, the number of iterations reaching maximum number, a located string with a certain value, and no change in the average fitness after some generations. In this paper, the stopping criteria are chosen as the maximum number of iterations and the tolerance value for fitness whereminimumfk+1-minimumfk≤tolerance.Steps of proposed method have been explained in Algorithm1.Algorithm 1
Step
1. Load function and its parameters
Step
2. Generate initial population randomly
Step
3. While minimumfk+1-minimumfk≤tolerance or
k > max number of iterations,
performing random global search using Levy Flightxk+1=xk+αLs,λ,
(λ=1.5,  α=1,  and step length s set as s=5)
Then, find a promising solution
Step
4. Determine a random number. Set switching parameter p for controlling
between global search and local search. (We setp=0.2)
Ifp<rand
switch to local search stage (go to Step  5)
else
switch to global search stage (go to Step  6)
Step
5. In intensive local search stage, search around a promising solution,
Calculate new velocity and position of each particle via (5) and (6),
Then evaluate new fitness (Use the objective function based on Newton–Raphson
power flow for reactive power optimization problem)
Iff(xi(k+1))<f(pbesti(k))
pbestik+1=xi(k+1)
Step
6. Update,
k=k+1
Step
7. Stopping criterion,
Maximum number of iterations or a given tolerance (tolerance set as1.0000e-9
for reactive power optimization problem)
Step
8. If any criterion is provided, then stop the algorithm else go to Step 3


## 4. Performance of ESPSO on Benchmark Functions

For testing proposed method, seven well-known benchmark functions are handled with comparison of widely used six algorithms (GA, PSO, ABC, FA, and hGAPSO). These benchmark functions are listed in Table1.Table 1
Benchmark functions.
Equation
Name
D
Feasible bounds
f
1
=
∑
i
=
1
D
x
i
2
Sphere/parabola
30
(
-
100,100
)
D
f
2
=
-
20
exp
⁡
-
0.2
1
D
∑
i
=
1
D
x
i
2
-
exp
⁡
1
D
∑
i
=
1
D
cos
⁡
2
π
x
i
+
20
+
e
Ackley
30
(
-
32,32
)
D
f
3
=
∑
i
=
1
D
-
1
100
x
i
+
1
-
x
i
2
2
+
x
i
-
1
2
Rosenbrock
30
(
-
30,30
)
D
f
4
=
1
4000
∑
i
=
1
D
x
i
2
-
∏
i
=
1
D
cos
⁡
x
i
i
+
1
Generalized Griewank
30
(
-
600,600
)
D
f
5
=
-
∑
i
=
1
4
c
i
exp
⁡
-
∑
j
=
1
3
a
i
j
x
j
-
p
i
j
2
Hartman 3
3
(
0,1
)
D
f
6
=
4
x
1
2
-
2.1
x
1
4
+
1
3
x
1
6
+
x
1
x
2
-
4
x
2
2
+
4
x
2
4
Six-hump camel-back
2
(
-
5,5
)
D
f
7
=
1
+
x
1
+
x
2
+
1
2
19
-
14
x
1
+
3
x
1
2
-
14
x
2
+
6
x
1
x
2
+
3
x
2
2
×
30
+
2
x
1
-
3
x
2
2
18
-
32
x
1
+
12
x
1
2
+
48
x
2
-
36
x
1
x
2
+
27
x
2
2
Goldstein-Price
2
(
-
2,2
)
DAll the methods run in 500 iterations and over 50 times for each function. The results obtained by proposed ESPSO algorithm on some benchmark functions are statistically different from the other algorithms and ESPSO has a good performance on the test functions. Results point out that ESPSO algorithm is appropriate for optimizations of unimodal and multimodal functions. Table2 shows the results obtained by all methods mentioned in this section. In Table 2, it can be seen that the proposed approach has obtained better results than the other methods.Table 2
Comparison of ESPSO with other methods on test functions.
Function
Index
GA
PSO
ABC
FA
hGAPSO
ESPSO
f
1
Best
1.1091
0.9206
0.8991
0.0037
0.8874
0.0026
Mean
1.7623
1.0038
1.2978
0.0126
1.1172
0.9032
f
2
Best
0.9398
0.7646
0.8991
0.0317
0.0918
0.0125
Mean
1.6693
1.6237
2.6842
0.1004
1.9044
1.0005
f
3
Best
101.9834
24.0076
38.5673
17.2783
22.9814
16.5622
Mean
217.0324
65.3482
94.0345
19.2953
28.0912
54.8731
f
4
Best
0.1983
0.0078
0.0659
9.9047
e
-
04
1.1092
e
-
3
3.4597
e
-
4
Mean
0.9219
0.0396
0.15415
0.0117
0.0335
0.1931
f
5
Best
−3.8664
−3.8642
−3.8652
−3.8628
−3.8629
−3.8628
Mean
−3.8824
−3.8659
−3.8739
−3.8656
−3.8728
−3.8638
f
6
Best
−1.0525
−1.0393
−1.0353
−1.0317
−1.0318
−1.0316
Mean
−1.1316
−1.0626
−1.0445
−1.0319
−1.0336
−1.0330
f
7
Best
3.1870
3.0782
3.0390
3.0256
3.0280
3.0130
Mean
3.7683
3.5900
3.4802
3.3380
3.4517
3.2300Unlike other algorithms, ESPSO performs global search and local search by using parameterp until converging to optimum as possible. In addition, it generates initial population randomly using uniform distribution function in MATLAB. Consequently, from the local search to global search, fitness value is changed from the worst to the best, so as a generation can not only find a good search but also switch to new search area in the search space.


## 5. Implementing Reactive Power Optimization

In reactive power optimization problem, transformer tap positions and shunt capacitor banks are discrete or integer variables. However, the proposed method only uses continuous variable. To use these variables, each particle of ESPSO explores in the space as searching for continuous variable, and objective function is evaluated by cutting the corresponding dimensions of particles into integers. This means that the real position values of particles consist of values of capacitor banks and transformers tap positions represented as a vector to be used for calculating objective function.Here, inequality constraints are handled in iterations as follows: if variables violate their limit, they are clamped to their upper limit and the remaining mismatch is taken by another one not on limit based on their inertia, and during computation if any PV bus reactive power is violated then PV bus is assumed as PQ bus fixing at the brink value.Furthermore, the procedure of solving reactive power problem can be explained as follows.The proposed approach of ESPSO loads parameters of power system and initial condition and specifies upper and lower limits. Initial particles are determined randomly via uniform distribution to locate their initial positions, and initial velocities of particles are constituted. The algorithm evaluates the fitness using objective function and adjusts local bests and global best from locals.While stopping criteria are provided, ESPSO performs that searching global best by Lévy flight and then determining a random number. If this determined random number is less thenp parameter, local search would be performed and locals would be updated via local search property of PSO (update velocities and positions of particles). Then, new fitness computed and if fitness found in local search stage is less then fitness found in first stage, global solution and positions of particles would be updated: (fk+1←fk, pbestsk+1←xk, and then k=k+1).


## 6. Results of Simulations

To verify the ability, capability, and performance of the proposed ESPSO on reactive power optimization problem, it is implemented to IEEE 30-bus test system, IEEE 118-bus test system, and a real distribution subsystem. For testing and proving the performance of proposed method, it is compared with various algorithms such as GA, PSO [17], ABC [24], FA [30], DE [31], and hGAPSO [32].The population-based algorithms GA, PSO, DE, and their improved version have a great interest in engineering optimization problems and they all have been successfully implemented to reactive power optimization problems [4, 6, 7, 11, 12, 16, 17, 31, 32]. In some other studies, ABC and FA [24, 30] have also been used for reactive power optimization. So, ESPSO is compared with these algorithms.In [17], authors proposed GA and PSO to solve reactive power optimization problem for some test systems where, on IEEE 30-bus system, they obtained power losses 4.78 MW and 4.39 MW with GA and PSO, respectively. In [24], authors obtained power losses with ABC in the study for 30-bus system as 3.09 MW. In a different study for IEEE 30-bus power system, power loss has been tabulated as 4.71 MW with FA [30]. Authors considered four different test systems with various algorithm and they obtained power losses for 30-bus system as 5.01 MW with DE [31]. In [32] minimum power losses have been tabulated as 3.69 MW for IEEE 30-bus test system. (Note that data and settings of all methods can be found in these studies.)The results of studies in [17] with GA and PSO, [24] with ABC, [31] with DE, and [32] with hGAPSO are taken into consideration for IEEE 118-bus test system. In these studies, authors obtained power losses with GA, PSO, ABC, and DE as 139.16, 135.64, 119.6923, and 128.318, respectively.The proposed method is coded in MATLAB software for 30-bus and 118-bus test systems. Maximum number of iterations is set as 100 and ESPSO is run over 50 times. The best solutions for both systems are tabulated after 50 times running.


### 6.1. IEEE 30-Bus Test System

Power system includes 41 branches, 6 generators, 21 load buses, and 9 shunt compensators. Branches of 4–12, 6–9, 6–10, and 28-27 are adjustable tab under load and symbolized asTK4-12, TK6-9, TK6-10, and TK28-27, respectively. All data and parameters of power system used can be found in [33]. The system loads are as follows: Pload=2.834 pu and Qload=1.262 pu. The transformers tap settings and bus voltages lower and upper limits are 0.9 pu and 1.1 pu and shunt compensators limits are 0.0 pu and 0.05 pu, respectively, that variables limits are denoted in Table 3.Table 3
Limits of variables (pu).
Bus
1
2
5
8
11
13
P
G
m
i
n
0.500
0.200
0.150
0.100
0.100
0.120
P
G
m
a
x
2.000
0.800
0.500
0.350
0.300
0.400
Q
G
m
i
n
−0.200
−0.200
−0.150
−0.150
−0.100
−0.150
Q
G
m
a
x
2.000
1.000
0.800
0.600
0.500
0.600
Variable
V
m
i
n
V
m
a
x
T
K
m
i
n
T
K
m
a
x
Q
C
m
i
n
Q
C
m
a
x
Limit
0.90
1.10
0.90
1.10
0.00
0.50For comparing the proposed approach with other algorithms mentioned previously, index related to performance consists of the minimization of power loss given in Table4. Table 4 shows that ESPSO found system loss less than other techniques, so that it can be deduced that the proposed method is clearly more robust and better than others in this case study. Variables values obtained by solving reactive power optimization problem for IEEE 30-bus system are also illustrated in Table 4. The power loss is reduced to 3.0128 MW with ESPSO, which is less than that obtained by the other methods. On the other hand, the bus voltages are kept within their limits; it shows that the proposed method has a best performance for optimizing voltage quality. Outputs of generators are denoted in Table 5 and the variation of power loss obtained by proposed approach is also given in Figure 1. Furthermore, the variation graphs of control variables are illustrated in Figures 2–4.Table 4
Control variables values and power loss (control variables given pu).
Variables
GA
PSO
ABC
FA
DE
hGAPSO
ESPSO
V
1
1.0345
1.0606
1.0927
1.1000
1.0500
1.0300
1.0770
V
2
1.0463
1.0524
1.0880
1.0967
1.0446
1.0400
1.0775
V
5
1.0294
1.0284
1.0695
1.0850
1.0247
1.0400
1.0700
V
8
1.0283
1.0289
1.0722
1.0895
1.0265
1.0200
1.0700
V
11
1.0517
0.9833
1.0860
1.0930
1.1000
1.0300
1.0800
V
13
1.0214
0.9924
1.0926
1.0969
1.1000
0.9500
1.0810
T
K
6
-
9
1.0314
1.0530
0.9983
1.0478
1.0000
1.0300
1.0050
T
K
6
-
10
1.0994
1.1000
0.9994
0.9439
1.1000
1.0800
1.0050
T
K
4
-
12
1.1000
1.0745
0.9984
1.0318
1.0800
1.7000
0.9800
T
K
28
-
27
0.9071
0.9247
1.0034
1.0044
0.9200
1.0400
0.9720
Q
C
10
0.0153
0.1174
0.0155
0.0534
0.2600
—
0.2050
Q
C
24
0.0063
0.0056
0.0371
0.0663
0.1000
—
0.1170
P
loss (MW)
4.78
4.39
3.09
4.71
5.01
3.69
3.079Table 5
Generators powers (MW).
Variables
ESPSO
P
G
1
51.50
P
G
2
80.00
P
G
5
50.00
P
G
8
35.00
P
G
11
30.00
P
G
13
39.98Figure 1
The convergence curve of power loss (MW) for 30-bus power system.Figure 2
The variation of generator voltages for IEEE 30-bus power system.Figure 3
The variation of tap ratios for IEEE 30-bus power system.Figure 4
The variation of shunt compensators for IEEE 30-bus power system.


### 6.2. IEEE 118-Bus Test System

The IEEE 118-bus system data are given in [34]. This power system contains 54 generators, 9 transformers, and 186 lines. The total load of system is 4242 MW. In this study, tap settings of the transformers and the voltage limits are taken into consideration within 0.9 pu–1.1 pu and 0.94 pu–1.06 pu, respectively.The results obtained by proposed method are given in Table6. To compare the performance of proposed method, the minimum power loss obtained by different methods is also tabulated. The power loss has been reduced to 119.5500 MW. Table 6 illustrates that in this section the proposed method is more robust and effective than the other methods. Moreover, the convergence of power loss for IEEE 118-bus power system is given in Figure 5. Table 7 and Figure 6 show the tap ratios, the values of shunt compensators, the voltage, and power of generators, respectively.Table 6
Comparison of the power loss for IEEE 118-bus test system.
Variables
P
l
o
s
s (MW)
GA
139.16
PSO
135.64
ABC
119.6923
FA
—
DE
128.318
hGAPSO
—
ESPSO
119.5500Table 7
Tap ratio.
Variables
ESPSO
T
K
(
8
-
5
)
0.9850
T
K
(
26
-
25
)
0.9900
T
K
(
30
-
17
)
0.9910
T
K
(
38
-
37
)
0.9850
T
K
(
63
-
59
)
0.9500
T
K
(
64
-
61
)
1.0000
T
K
(
65
-
66
)
0.9950
T
K
(
68
-
69
)
0.9450
T
K
(
81
-
80
)
1.0050Figure 5
The convergence curve of power loss (MW) for 118-bus power system.Figure 6
Variables of IEEE 118-bus power system: (a) value of shunt compensator (pu), (b) voltages of generators (pu), and (c) power of generators (MW).
(a)
(b)
(c)


### 6.3. Case Study on a Real Distribution Subsystem

The proposed method has been used to minimize the power loss by using reactive power optimization on Eregli Distribution Subsystem in Turkey. All data and parameter have been supplied from Eregli Branch Office of Meram Electricity Distribution Corporation.The power subsystem considered in this paper includes 1311 buses at 0.4 kV, 9 buses at 31.5 kV, and 3 buses at 15.8 kV and 12 branches with adjustable tab under load. First bus is selected as the slack bus, 2–9 buses are PV buses, and others are selected as PQ buses (switching capacitor banks are located on all 0.4 kV buses). In this respect, vector dimensions become 1333 dimensions composed of nine voltage magnitude values, 12 tab settings, and 1311 switchable capacitor banks. The discrete control variables given in Table8 are changed with step of 0.01 per unit (pu). The active power load and reactive power load are 0.9869 pu and 0.2242 pu, respectively, and total power losses are 1.0961 MW (note that pu values are computed on 100 MVA base).Table 8
The limits of control variables.
Parameter
Min. val. (pu)
Max. val. (pu)
Voltage
0.9
1.1
Capacitor
0.1
0.61
Tap position
0.9
1.1For comparing the proposed method with GA, PSO, ABC, FA, and hGAPSO, the performance index including minimum active power losses is illustrated in Figure7. All algorithms are run in 100 iterations and over 50 times. The results tabulated by all algorithms have been obtained after 50 times running. In addition, ESPSO has found the minimum power loss as 0.8973 MW, and all results are given in Table 9 (values of capacitor banks have not been given because of containing too many items). It can be seen that ESPSO is more effective and superior compared to other algorithms.Table 9
Control variables values and power loss (control variables given pu).
Variables
GA
PSO
ABC
FA
DE
hGAPSO
ESPSO
V
1
1.0100
1.0200
1.0400
1.0600
1.0600
1.0600
1.0600
V
2
1.0300
1.0400
1.0200
1.0100
0.9900
1.0300
1.0500
V
3
0.9800
1.0200
1.0400
1.0100
1.0600
1.0600
1.0300
V
4
1.0400
1.0300
1.0200
1.0400
0.9800
1.0300
1.0500
V
5
0.9900
1.0600
1.0400
0.9900
0.9500
1.0600
1.0200
V
6
0.9600
1.0600
1.0200
1.0500
1.0100
1.0300
1.0100
V
7
1.0600
1.0600
1.0400
1.0600
1.0100
1.0600
1.0100
V
8
1.0600
1.0500
1.0200
1.0500
0.9700
1.0300
1.0400
V
9
1.0200
1.0400
1.0000
1.0000
0.9900
1.0000
1.0500
T
1
1.07
1.03
1
0.98
1.05
1
1
T
2
1.05
1
1
0.98
1.04
0.97
0.98
T
3
1
1.06
1
1.04
1.05
0.97
1.04
T
4
1.01
1
1
1.01
1
0.98
1.01
T
5
1.03
1
1.05
0.97
0.98
1.01
1
T
6
1
1
1.03
1.01
0.98
1.05
1
T
7
0.98
0.97
1.03
0.99
0.97
1.04
0.98
T
8
0.96
0.98
0.97
1.03
1
0.98
1.03
T
9
1
1
0.98
0.98
0.98
1
0.99
T
10
0.98
0.98
0.97
1.04
1.04
1
1
T
11
0.97
0.96
1.06
1
1.05
1.01
1
T
12
0.99
0.07
1.05
1
1.01
1.01
1
P
l
o
s
s (MW)
0.91576
0.91189
0.91758
0.90622
0.91760
0.90922
0.89730Figure 7
Convergence of active power loss (MW).In order to clarify the ability of ESPSO that is statistically more robust and better than other methods, it can be shown that the minimum power loss obtained by ESPSO is smaller than all others listed and it conducts global searches accurately. After 50 times running it can be seen that the power losses are decreased from 1.0961 MW to 0.8973 MW by the proposed ESPSO which is the highest power loss reduction. The results obtained by all algorithms handled in this paper are given below, which indicates minimum power loss, voltage magnitude of buses, and tap ratios.


## 6.1. IEEE 30-Bus Test System

Power system includes 41 branches, 6 generators, 21 load buses, and 9 shunt compensators. Branches of 4–12, 6–9, 6–10, and 28-27 are adjustable tab under load and symbolized asTK4-12, TK6-9, TK6-10, and TK28-27, respectively. All data and parameters of power system used can be found in [33]. The system loads are as follows: Pload=2.834 pu and Qload=1.262 pu. The transformers tap settings and bus voltages lower and upper limits are 0.9 pu and 1.1 pu and shunt compensators limits are 0.0 pu and 0.05 pu, respectively, that variables limits are denoted in Table 3.Table 3
Limits of variables (pu).
Bus
1
2
5
8
11
13
P
G
m
i
n
0.500
0.200
0.150
0.100
0.100
0.120
P
G
m
a
x
2.000
0.800
0.500
0.350
0.300
0.400
Q
G
m
i
n
−0.200
−0.200
−0.150
−0.150
−0.100
−0.150
Q
G
m
a
x
2.000
1.000
0.800
0.600
0.500
0.600
Variable
V
m
i
n
V
m
a
x
T
K
m
i
n
T
K
m
a
x
Q
C
m
i
n
Q
C
m
a
x
Limit
0.90
1.10
0.90
1.10
0.00
0.50For comparing the proposed approach with other algorithms mentioned previously, index related to performance consists of the minimization of power loss given in Table4. Table 4 shows that ESPSO found system loss less than other techniques, so that it can be deduced that the proposed method is clearly more robust and better than others in this case study. Variables values obtained by solving reactive power optimization problem for IEEE 30-bus system are also illustrated in Table 4. The power loss is reduced to 3.0128 MW with ESPSO, which is less than that obtained by the other methods. On the other hand, the bus voltages are kept within their limits; it shows that the proposed method has a best performance for optimizing voltage quality. Outputs of generators are denoted in Table 5 and the variation of power loss obtained by proposed approach is also given in Figure 1. Furthermore, the variation graphs of control variables are illustrated in Figures 2–4.Table 4
Control variables values and power loss (control variables given pu).
Variables
GA
PSO
ABC
FA
DE
hGAPSO
ESPSO
V
1
1.0345
1.0606
1.0927
1.1000
1.0500
1.0300
1.0770
V
2
1.0463
1.0524
1.0880
1.0967
1.0446
1.0400
1.0775
V
5
1.0294
1.0284
1.0695
1.0850
1.0247
1.0400
1.0700
V
8
1.0283
1.0289
1.0722
1.0895
1.0265
1.0200
1.0700
V
11
1.0517
0.9833
1.0860
1.0930
1.1000
1.0300
1.0800
V
13
1.0214
0.9924
1.0926
1.0969
1.1000
0.9500
1.0810
T
K
6
-
9
1.0314
1.0530
0.9983
1.0478
1.0000
1.0300
1.0050
T
K
6
-
10
1.0994
1.1000
0.9994
0.9439
1.1000
1.0800
1.0050
T
K
4
-
12
1.1000
1.0745
0.9984
1.0318
1.0800
1.7000
0.9800
T
K
28
-
27
0.9071
0.9247
1.0034
1.0044
0.9200
1.0400
0.9720
Q
C
10
0.0153
0.1174
0.0155
0.0534
0.2600
—
0.2050
Q
C
24
0.0063
0.0056
0.0371
0.0663
0.1000
—
0.1170
P
loss (MW)
4.78
4.39
3.09
4.71
5.01
3.69
3.079Table 5
Generators powers (MW).
Variables
ESPSO
P
G
1
51.50
P
G
2
80.00
P
G
5
50.00
P
G
8
35.00
P
G
11
30.00
P
G
13
39.98Figure 1
The convergence curve of power loss (MW) for 30-bus power system.Figure 2
The variation of generator voltages for IEEE 30-bus power system.Figure 3
The variation of tap ratios for IEEE 30-bus power system.Figure 4
The variation of shunt compensators for IEEE 30-bus power system.


## 6.2. IEEE 118-Bus Test System

The IEEE 118-bus system data are given in [34]. This power system contains 54 generators, 9 transformers, and 186 lines. The total load of system is 4242 MW. In this study, tap settings of the transformers and the voltage limits are taken into consideration within 0.9 pu–1.1 pu and 0.94 pu–1.06 pu, respectively.The results obtained by proposed method are given in Table6. To compare the performance of proposed method, the minimum power loss obtained by different methods is also tabulated. The power loss has been reduced to 119.5500 MW. Table 6 illustrates that in this section the proposed method is more robust and effective than the other methods. Moreover, the convergence of power loss for IEEE 118-bus power system is given in Figure 5. Table 7 and Figure 6 show the tap ratios, the values of shunt compensators, the voltage, and power of generators, respectively.Table 6
Comparison of the power loss for IEEE 118-bus test system.
Variables
P
l
o
s
s (MW)
GA
139.16
PSO
135.64
ABC
119.6923
FA
—
DE
128.318
hGAPSO
—
ESPSO
119.5500Table 7
Tap ratio.
Variables
ESPSO
T
K
(
8
-
5
)
0.9850
T
K
(
26
-
25
)
0.9900
T
K
(
30
-
17
)
0.9910
T
K
(
38
-
37
)
0.9850
T
K
(
63
-
59
)
0.9500
T
K
(
64
-
61
)
1.0000
T
K
(
65
-
66
)
0.9950
T
K
(
68
-
69
)
0.9450
T
K
(
81
-
80
)
1.0050Figure 5
The convergence curve of power loss (MW) for 118-bus power system.Figure 6
Variables of IEEE 118-bus power system: (a) value of shunt compensator (pu), (b) voltages of generators (pu), and (c) power of generators (MW).
(a)
(b)
(c)


## 6.3. Case Study on a Real Distribution Subsystem

The proposed method has been used to minimize the power loss by using reactive power optimization on Eregli Distribution Subsystem in Turkey. All data and parameter have been supplied from Eregli Branch Office of Meram Electricity Distribution Corporation.The power subsystem considered in this paper includes 1311 buses at 0.4 kV, 9 buses at 31.5 kV, and 3 buses at 15.8 kV and 12 branches with adjustable tab under load. First bus is selected as the slack bus, 2–9 buses are PV buses, and others are selected as PQ buses (switching capacitor banks are located on all 0.4 kV buses). In this respect, vector dimensions become 1333 dimensions composed of nine voltage magnitude values, 12 tab settings, and 1311 switchable capacitor banks. The discrete control variables given in Table8 are changed with step of 0.01 per unit (pu). The active power load and reactive power load are 0.9869 pu and 0.2242 pu, respectively, and total power losses are 1.0961 MW (note that pu values are computed on 100 MVA base).Table 8
The limits of control variables.
Parameter
Min. val. (pu)
Max. val. (pu)
Voltage
0.9
1.1
Capacitor
0.1
0.61
Tap position
0.9
1.1For comparing the proposed method with GA, PSO, ABC, FA, and hGAPSO, the performance index including minimum active power losses is illustrated in Figure7. All algorithms are run in 100 iterations and over 50 times. The results tabulated by all algorithms have been obtained after 50 times running. In addition, ESPSO has found the minimum power loss as 0.8973 MW, and all results are given in Table 9 (values of capacitor banks have not been given because of containing too many items). It can be seen that ESPSO is more effective and superior compared to other algorithms.Table 9
Control variables values and power loss (control variables given pu).
Variables
GA
PSO
ABC
FA
DE
hGAPSO
ESPSO
V
1
1.0100
1.0200
1.0400
1.0600
1.0600
1.0600
1.0600
V
2
1.0300
1.0400
1.0200
1.0100
0.9900
1.0300
1.0500
V
3
0.9800
1.0200
1.0400
1.0100
1.0600
1.0600
1.0300
V
4
1.0400
1.0300
1.0200
1.0400
0.9800
1.0300
1.0500
V
5
0.9900
1.0600
1.0400
0.9900
0.9500
1.0600
1.0200
V
6
0.9600
1.0600
1.0200
1.0500
1.0100
1.0300
1.0100
V
7
1.0600
1.0600
1.0400
1.0600
1.0100
1.0600
1.0100
V
8
1.0600
1.0500
1.0200
1.0500
0.9700
1.0300
1.0400
V
9
1.0200
1.0400
1.0000
1.0000
0.9900
1.0000
1.0500
T
1
1.07
1.03
1
0.98
1.05
1
1
T
2
1.05
1
1
0.98
1.04
0.97
0.98
T
3
1
1.06
1
1.04
1.05
0.97
1.04
T
4
1.01
1
1
1.01
1
0.98
1.01
T
5
1.03
1
1.05
0.97
0.98
1.01
1
T
6
1
1
1.03
1.01
0.98
1.05
1
T
7
0.98
0.97
1.03
0.99
0.97
1.04
0.98
T
8
0.96
0.98
0.97
1.03
1
0.98
1.03
T
9
1
1
0.98
0.98
0.98
1
0.99
T
10
0.98
0.98
0.97
1.04
1.04
1
1
T
11
0.97
0.96
1.06
1
1.05
1.01
1
T
12
0.99
0.07
1.05
1
1.01
1.01
1
P
l
o
s
s (MW)
0.91576
0.91189
0.91758
0.90622
0.91760
0.90922
0.89730Figure 7
Convergence of active power loss (MW).In order to clarify the ability of ESPSO that is statistically more robust and better than other methods, it can be shown that the minimum power loss obtained by ESPSO is smaller than all others listed and it conducts global searches accurately. After 50 times running it can be seen that the power losses are decreased from 1.0961 MW to 0.8973 MW by the proposed ESPSO which is the highest power loss reduction. The results obtained by all algorithms handled in this paper are given below, which indicates minimum power loss, voltage magnitude of buses, and tap ratios.


## 7. Conclusion

Eagle strategy is a method of combination of global search and intensive local search for optimization. In this paper, an approach, ES with PSO based reactive power optimization method, has been implemented to a reactive power optimization problem for minimizing the power losses of 30-bus test system, 118-bus test system, and a real distribution subsystem. It can be seen that two case studies in this paper which are performance test on benchmark functions and the minimization of power losses of various power systems may help to clarify the capability of proposed approach for optimization problem. Furthermore, ESPSO is effectively solving optimization problems and finding the optimum more successfully than the other algorithms. On the other hand, about benchmark functions performance, the proposed approach has a better performance than all other algorithms. So, it can be seen that the proposed ESPSO algorithm is influential and able to solve power loss minimization problem and may become a good candidate for other optimization problems such as reactive power dispatch, cost minimization, or multiobjective optimization.



---

*Source: 1063045-2017-03-30.xml*