Beruflich Dokumente
Kultur Dokumente
Mousumi Basu
To cite this article: Mousumi Basu (2016): Group Search Optimization for Solution of
Different Optimal Power Flow Problems, Electric Power Components and Systems, DOI:
10.1080/15325008.2015.1122109
Download by: [University of Nebraska, Lincoln] Date: 27 March 2016, At: 01:33
Electric Power Components and Systems, 00(0):1–10, 2016
Copyright C Taylor & Francis Group, LLC
CONTENTS
Abstract—This article presents group search optimization for the
Downloaded by [University of Nebraska, Lincoln] at 01:33 27 March 2016
1. INTRODUCTION
Optimal power flow (OPF) is an important tool for power sys-
tem operators both in power system planning and operation
for many years. The main purpose of an OPF is to deter-
mine the settings of control variables for economic and se-
cure operation of a power system. The OPF minimizes the
power system operating objective function while satisfying
a set of equality and inequality constraints. The equality con-
straints are power flow equations and inequality constraints are
the limits on control variables and functional operating con-
straints. OPF is a highly non-linear, non-convex, large scale
static optimization problem. Several optimization techniques
have emerged so far and have been applied to solve the OPF
problem.
Earlier, OPF algorithms were based on classical
Keywords: group search optimization, optimal power flow, fuel cost
minimization, emission minimization, voltage profile improvement, voltage mathematics-based methods. The gradient-based method [1],
stability enhancement non-linear programming (NLP) [2], quadratic programming
Received 23 May 2014; accepted 8 November 2015
(QP) [3], Newton-based method [4, 5], linear programming
Address correspondence to Mousumi Basu, Department of Power
Engineering, Jadavpur University, 2nd Campus, Salt Lake, Sector III, (LP) [6], and interior point methods (IPMs) [7–9] have been
Kolkata 700 098, India. E-mail: mousumibasu@yaoo.com successfully applied to solve OPF problems.
1
2 Electric Power Components and Systems, Vol. 00 (2016), No. 00
The problem of OPF was originally formulated in 1962 Due to its high efficiency, GSO has been applied in many
by Carpentier [1], and he solved the OPF problem by using fields. Moreover, some papers also indicate GSO as solutions
the reduced gradient method. Later, Dommel and Tinney [2] to some power system optimization problems, such as non-
worked out the problem, based on Kuhn–Tucker optimality cri- convex economic dispatch problems [24], etc.
terion using a combination of the gradient method and penalty The effectiveness of the proposed GSO algorithm is tested
functions. In the following years, much research took place to on IEEE 30-bus, 57-bus, and 118-bus test systems for four
improve the quality of the OPF solution. single and compound-objective problems. The single objec-
These classical optimization techniques have been widely tive problems are (1) fuel cost minimization, (2) emission
applied to varieties of OPF problems. However, these tech- minimization, (3) voltage deviation minimization, and (4) en-
niques fail to deal with systems having complex non-smooth, hancement of voltage stability. It has been seen that perfor-
non-convex, and non-differentiable objective functions and mance of the proposed GSO method is better compared to
constraints. The NLP-based procedure has many drawbacks, other evolutionary methods.
such as insecure convergence properties, convergence to local
optimum, and algorithmic complexity. The LP formulation re-
Downloaded by [University of Nebraska, Lincoln] at 01:33 27 March 2016
The atmospheric pollutants such as sulfur oxides (SOx ) and Minimize F4 = L . (10)
nitrogen oxides (NOx ) caused by thermal generating units can
Downloaded by [University of Nebraska, Lincoln] at 01:33 27 March 2016
Transformer constraints: The upper and lower values for resource and is bestowed with the best fitness value called the
the discrete transformer tap settings are limited by physical producer. Some numbers of the group except the producer are
considerations and these are given below: randomly selected as scroungers and the rest of the members
are rangers. Scroungers perform area copying to join the re-
Timin ≤ Ti ≤ Timax , i = 1, 2, . . . , N T . (17)
source found by the producer and search around it. Rangers
Security constraints: These include the constraints on volt- employ ranging behavior by random walk in the searching
age magnitudes at PQ buses and transmission line loadings. space to raise the chance of escaping local optima.
Voltage of each PQ bus must be within its lower and operat- By using vision ability, producer scans three points around
ing limits. Line flow through each transmission line must be its position in certain distances and head angles in the search
within its capacity limits. These are described as follows: space for the better states. At the kth iteration, the producer
behavior is as follows:
VLimin ≤ VLi ≤ VLimax , i = 1, 2, .., N P Q , (18)
Sli ≤ Slimax , i = 1, 2, . . . , N T L . (19) (1) The producer scans at 0◦ and tests three points toward
its position using Eqs. (21)–(23):
Downloaded by [University of Nebraska, Lincoln] at 01:33 27 March 2016
X z = X kP + r1lmax D kp φ k , (21)
3. GSO r2 θmax
X r = X kP + r1lmax D kP φ k + , (22)
GSO [22, 23] is inspired by animal searching behavior 2
and group living theory. The framework is based on the r2 θmax
X l = X kP + r1lmax D kP φ k − , (23)
producer–scrounger (PS) model assuming that group mem- 2
bers search either for “finding” or for joining opportunities. where XP is the position of the producer, is a normally
The concept of animal scanning mechanisms is employed distributed random number with mean 0 and standard
metaphorically for designing an optimum searching strategy deviation 1, r2 is a uniformly distributed random num-
in order to solve optimization problems. ber in the range of (0, 1), and lmax is maximum pursuit
The population of GSO is called a group and each indi- distance and θmax is maximum pursuit angle.
vidual in the population is called a member. Each member is
(2) The producer will then find the best point. If the best
defined by its position and head angle. In n-dimensional search
point has a better value in comparison with its current
space, the ith member of GSO at the kth iteration has a current
position, the producer will fly to that point. If not, it will
position X ik ∈ R n and a head angle φik = (φi1k
, . . . , φi(n−1)
k
)∈
remain in its current position turning its head using the
R . The search direction of the ith member Dik (φik ) =
n−1
equation given below:
k
(di1 , ...., din
k
) ∈ R n can be calculated from φik via polar to
Cartesian coordinate transformation [24]: φ k+1 = φ k + r2 αmax , (24)
n−1
k where αmax ∈ R 1 is the maximum turning angle.
k
di1 = cos φiq
q=1 (3) If the producer cannot find a better area after
aiterations, it will turn its head back to 0◦ as follows:
n−1 k
dikj = sin φi(k j−1) cos φiq , j = 2, ...., (n − 1) .
φ k+a = φ k , (25)
q= j
k
k
din = sin φi(n−1) (20) where a ∈ R 1 is a constant.
The GSO algorithm comprises three kinds of members, The scroungers keep searching for opportunities to join
i.e., producers, scroungers, and rangers, assuming that there is the resources found by the producer. At the kth iteration, the
only one producer and the remaining members are scroungers area copying behavior of the ith scrounger can be modeled as
and rangers. Here, the simplest joining policy is used where follows:
all scroungers will join the resource found by the producer.
X ik+1 = X ik + r3 ◦ X kP − X ik , (26)
Group members search for the patches by moving over the
search space. The producer and the scroungers can switch where X ik is the position of the ith scrounger at the kth iteration.
between the two roles [26] assuming that they do not differ in r3 is a uniform random number in the range of (0, 1). Operator
their relevant phenotypic characteristics. “◦“ calculates the entry wise product of the two vectors.
At each iteration, a group member, located in the most Rangers are dispersed from their positions by random walk
promising area, adopts animal scanning to seek the optimal at the search space. At the kth iteration, a ranger produces a
Basu: Group Search Optimization for Solution of Different Optimal Power Flow Problems 5
TABLE 1. Optimal value of control variables obtained from GSO for IEEE 30-bus system for different cases
TABLE 2. Optimal value of control variables obtained from GSO for IEEE 57-bus system for different cases
control variables obtained from the proposed GSO are given 4.3. IEEE 118-bus System
in Table 2. The standard IEEE 118-bus system consists of 186 transmis-
sion lines, 54 generator buses, 64 load buses, 9 branches under
4.2.3. Enhancement of Voltage Stability load tap setting transformer, and 14 reactive power sources.
In this case, the proposed GSO approach is applied for en- The system line data, bus data, generator data, and the mini-
hancement of voltage stability, i.e., minimization of L max . mum and maximum limits for the control variables have been
Here, the population size and maximum iteration number have adapted from [29, 31]. The upper and lower limits of reac-
been selected 100 and 100, respectively, for this test system. tive power sources and transformer tap settings are taken from
The optimal values of control variables obtained from the pro- [31]. The total system active power demand is 42.4200 p.u.
posed GSO are given in Table 2.
The proposed GSO approach is applied for minimization of are summarized in Table 5. The convergence characteristic ob-
fuel cost as the objective function. Here, the population size tained from proposed GSO for L max minimization is shown in
and maximum iteration number have been selected, 200 and Figure 6.
100, respectively, for this test system. The best, average, and
worst fuel cost and average CPU time among 50 runs of solu- 4.3.4. Improvement of Voltage Profile
tions obtained from proposed GSO are summarized in Table 3. In this case, the proposed GSO approach is applied for im-
The cost convergence characteristic obtained from proposed provement of the voltage profile. Here, the population size
GSO for minimum fuel cost solution is shown in Figure 4. and maximum iteration number have been selected, 200 and
100, respectively, for this test system. The best, average, and
worst voltage deviation and average CPU time among 50 runs
4.3.2. Minimization of Emission
of solutions obtained from proposed GSO are summarized in
The proposed GSO approach is applied for minimization of Table 6. The convergence characteristic obtained from pro-
emission as the objective function. Here, the population size posed GSO for voltage deviation is shown in Figure 7.
and maximum iteration number have been selected, 200 and
100, respectively, for this test system. The best, average, and
worst emission and average CPU time among 50 runs of
solutions obtained from proposed GSO are summarized in
Table 4. The emission convergence characteristic obtained
from proposed GSO for minimum emission solution is shown
in Figure 5.
IEEE 118-bus system. [11] Yuryevich, J., and Wong, K. P., “Evolutionary programming
based optimal power flow algorithm,” IEEE Trans Power Syst.,
5. CONCLUSION Vol. 14, No. 4, pp. 1245–1250, 1999.
[12] Abido, M. A., “Optimal power flow using particle swarm op-
In this article, GSO, one of the most important computational timization,” Electr. Power Energy Syst., Vol. 24, No. 7, pp.
intelligence-based techniques, has been successfully applied 563–571, 2002.
[13] Yumbla Onate, P. E., Ramirez, J. M., and Coello, C. A., “Optimal
to solve four different OPF problems. The OPF problem is
power flow subject to security constraints solved with a particle
formulated as a non-linear optimization problem with equality swarm optimizer,” IEEE Trans. Power Syst., Vol. 23, No. 1, pp.
and inequality constraints of the power system. In this study, 33–40, 2008.
different objective functions such as fuel cost minimization, [14] Roa-Sepulveda, C. A., and Pavez-Lazo, B. J., “A solution to the
emission minimization, and enhancement of the voltage pro- optimal power flow using simulated annealing,” Electr. Power
file and voltage stability are considered. The proposed GSO Energy Syst., Vol. 25, No. 1, pp. 47–57, 2003.
[15] Bakirtzis, A. G., Biskas, P. N., Zoumas, C. E., and Petridis,
approach is tested on IEEE 30-bus, 57-bus, and 118-bus test V., “Optimal power flow by enhanced genetic algorithm,” IEEE
systems to demonstrate its effectiveness. The results obtained Trans. Power Syst., Vol. 17, No. 2, pp. 229–236, 2002.
from the proposed GSO approach are better than the results [16] Ongsakul, W., and Tantimaporn, T., “Optimal powers flow by
obtained from other evolutionary methods reported in the lit- improved evolutionary programming,” Electr. Power Compon.
erature. Syst., Vol. 34, No. 1, pp. 79–95, 2006.
[17] Sayah, S., and Zehar, K., “Modified differential evolution algo-
rithm for optimal power flow with non-smooth cost functions,”
REFERENCES Energy Convers. Manage., Vol. 49, No. 11, pp. 3036–3042,
2008.
[1] Carpentier, J., “Contribution a l’etude du dispatching [18] Abou El Ela, A. A., Abido, M. A., and Spea, S. R., “Opti-
economique,” Bull. Soc. Franc. Electr., Vol. 3, pp. 431–474, mal power flow using differential evolution algorithm,” Electr.
1962. Power Syst. Res., Vol. 80, No. 7, pp. 878–885, 2010.
[2] Dommel, H., and Tinney, W., “Optimal power flow solution,” [19] Bhattacharya, A., and Chattopadhyay, P. K., “Application of
IEEE Trans. Power Appar. Syst., Vol. PAS-87, No. 10, pp. biogeography-based optimization to solve different optimal
1866–1876, 1968. power flow problems,” IET Gener. Transm. Distrib., Vol. 5, No.
[3] Burchett, R. C., Happ, H. H., and Vierath, D. R., “Quadratically 1, pp. 70–80, 2011.
convergent optimal power flow,” IEEE Trans. Power Appar. [20] Niknam, T., Narimani, M. R., Aghaei, J., and Azizipanah-
Syst., Vol. PAS-103, No. 11, pp. 3267–3276, 1984. Abarghooee, R., “Improved particle swarm optimization for
[4] Sun, D. I., Ashley, B., Brewer, B., Hughes, A., and Tinney, W. multi-objective optimal power flow considering cost, loss, emis-
F., “Optimal power flow by Newton approach,” IEEE Trans. sion and voltage stability index,” IET Gener. Transm. Distrib.,
Power Appar. Syst., Vol. PAS-103, No. 10, pp. 2864–2875, Vol. 6, No. 6, pp. 515–527, 2012.
1984. [21] Surender Reddy, S., Bijwe, P. R., and Abhyankar, A. R., “Faster
[5] Tinney, W. F., and Hart, C. E., “Power flow solution by Newton’s evolutionary algorithm based optimal power flow using incre-
method,” IEEE Trans. Power Appar. Syst., Vol. PAS-86, No. 11, mental variables,” Electr. Power Energy Syst., 54, No. 1, pp.
pp. 1449–1460, 1967. 198–210, 2014.
[6] Mota-Palomino, R., and Quintana, V. H., “Sparse reactive power [22] He, S., Wu, Q. H., and Saunders, J. R., “Group search optimizer:
scheduling by a penalty-function linear programming tech- An optimization algorithm inspired by animal searching behav-
nique,” IEEE Trans. Power Syst., Vol. 1, No. 3, pp. 31–39, ior,” IEEE Trans. Evol. Computat., Vol. 13, No. 5, pp. 973–990,
1986. 2009.
10 Electric Power Components and Systems, Vol. 00 (2016), No. 00
[23] Shen, H., Zhu, Y., Zou, W., and Zhu, Z., “Group search [28] “The IEEE 57-bus test system,” available at: http://www.ee.
optimizer algorithm for constrained optimization,” Comput. washington.edu/research/pstca/pf57/pg tca57bus.htm
Sci. Environ. Eng. Eco. Inf. (2011) (CSEEE 2011), Part II, [29] “Index of data,” available at: http://motor.ece.iit.edu/data
Berlin, Heidelberg: Springer-Verlag, CCIS 159, pp. 48–53, [30] Duman, S., Sonmez, Y., Guvenc, U., and Yorukeren, N., “Opti-
2011. mal reactive power dispatch using a gravitational search algo-
[24] Moradi-Dalvand, M., Mohammadi-Ivatloo, B., Najafi, A., rithm,” IET Gener. Transm. Distrib., Vol. 6, No. 6, pp. 563–576,
and Rabiee, A., “Continuous quick group search opti- 2012.
mizer for solving non-convex economic dispatch problems,” [31] “The IEEE 118-bus test system,” available at: http://www.ee.
Electr. Power Syst. Res., Vol. 93, pp. 93–105, December, washington.edu/research/pstca/pf118/pg tca118bus.htm
2012.
[25] Kessel, P., and Glavitsch, H., “Estimating the voltage stability
BIOGRAPHY
of a power system,” IEEE Trans. Power Del., Vol. 1, No. 3, pp.
346–354, 1986. Mousumi Basu received her Bachelor’s degree, Master’s de-
[26] Mustard, D., “Numerical integration over the n-dimensional gree, and Ph.D. from Jadavpur Universty, Kolkata, India, in
spherical shell,” Math. Computat., Vol. 18, No. 88, pp. 578–589,
1964.
1991, 1993, and 2003, respectively. She is currently with
Downloaded by [University of Nebraska, Lincoln] at 01:33 27 March 2016
[27] Mahadevan, K., and Kannan, P. S., “Comprehensive learning the Department of Power Engineering, Jadavpur University,
particle swarm optimization for reactive power dispatch,” Appl. Kolkata, India. Her research is focused on power system opti-
Soft Comput., Vol. 10, No. 2, pp. 641–652, 2010. mization and soft computing techniques.