Cuckoo
Cuckoo
a r t i c l e i n f o a b s t r a c t
Article history: A new optimization technique called Cuckoo Search (CS) algorithm for optimum tuning of PI controllers
Received 1 October 2014 for Load Frequency Control (LFC) is suggested in this paper. A time domain based-objective function is
Received in revised form 19 May 2015 established to robustly tune the parameters of PI-based LFC which is solved by the CS algorithm to attain
Accepted 26 May 2015
the most optimistic results. A three-area interconnected system is investigated as a test system under
various loading conditions where system nonlinearities are taken into account to confirm the effective-
ness of the suggested algorithm. Simulation results are introduced to show the enhanced performance of
Keywords:
the developed CS based controllers in comparison with Genetic Algorithm (GA), Particle Swarm
Cuckoo Search algorithm
Load Frequency Control
Optimization (PSO) and conventional integral controller. These results denote that the proposed con-
PI controller trollers offer better performance over others in terms of settling times and various indices.
Time delay Ó 2015 Elsevier Ltd. All rights reserved.
Generation Rate Constraint
Three area system
Introduction ANN suffers from the long training time, the selecting number of
layers and the number of neurons in each layer. Also, FLC requests
In the large scale power systems, LFC plays a serious role. The a hard work to catch the efficient signals and it needs fine tuning
LFC is aimed to ensure the frequency of each area and the inter area and simulation before operation.
tie line power within tolerable limits to deal with the fluctuation of Another approach is to use Evolutionary Algorithm (EA) tech-
load demands and system disturbances [1,2]. These important niques. EA is visualized to be very effective to deal with LFC prob-
functions are delegated to LFC due to the fact that a lem due to its ability to treat nonlinear objective functions. Among
well-designed power system should keep voltage and frequency the EA techniques, GA [24–29], PSO [30–33], Bacteria Foraging
in scheduled range while supplying an acceptable level of power [34–38], Artificial Bee Colony [39], and Ant Colony Optimization
quality [3,4]. [40] have attracted the attention in LFC controller design.
Several researches and techniques had been applied to the field Although these algorithms appear to be efficient for the design
of LFC during the last decades. Robust control [5–9], decentralized problem, they suffer from slow convergence problem in refined
control [10,11], linear quadratic problem [12], pole placement search stage, weak local search ability, which may lead them to
approach [13,14], variable structure control [15], and state feed- get trapped in local minimum solution. A new evolutionary com-
back [16], are used to deal with LFC problem design. However, putation algorithm, called CS algorithm has been presented by
these strategies have many problems which limit their applicabil- [41] and further formed newly by [42–44]. In addition, it is simple
ity. In an effort to overcome these problems, many researches have and population based stochastic optimization algorithm.
used artificial intelligence as Fuzzy Logic Controller (FLC) [17–21] Moreover, it requires less control parameters to be tuned. Also, it
and Artificial Neural Network (ANN) [21–23]. Although these is a compatible optimization tool for power system controller
methods are effective in dealing with the nonlinear characteristics design [45,46].
of the power system, they have their own problems. For example, This paper introduces a modern optimization algorithm called
CS for the optimum tuning of PI controller parameters in LFC prob-
lem. The motivation behind this research is to ensure and prove the
⇑ Corresponding author at: Electrical Department, Faculty of Engineering, Jazan
University, KSA.
robustness of CS based PI, and to enhance the performance of fre-
E-mail addresses: [email protected] (A.Y. Abdelaziz), ehabsali- quency deviation and tie line power under various loading condi-
[email protected] (E.S. Ali). tions in presence of system nonlinearities.
http://dx.doi.org/10.1016/j.ijepes.2015.05.050
0142-0615/Ó 2015 Elsevier Ltd. All rights reserved.
A.Y. Abdelaziz, E.S. Ali / Electrical Power and Energy Systems 73 (2015) 632–643 633
Nomenclature
Three area power system [17]. The detailed designed model of 3 area hydro-thermal power
system for load frequency control is shown in Fig. 1. The thermal
The system under study consists of 3 areas of equal sizes. Areas plant has a single stage reheat steam turbine and the hydro plant
1 and 2 are reheat thermal systems and area 3 is a hydro system is equipped with an electric governor. In this model, nonlinearities
Stop
KP
: ð6Þ
TPS þ 1
Fig. 2. Flowchart of Cuckoos Search optimization algorithm. For the ith area, the Area Control Error (ACE) signal made by fre-
quency and tie-line power variations is stated by:
are represented in Generation Rate Constraint (GRC) and commu- ACEi ¼ B Df i þ DPtiei : ð7Þ
nication time delay. GRC illustrates the limitation on the genera-
tion rate of change in the output generated power due to the Optimization model of load frequency control system
limitation of thermal and mechanical movements [4], for thermal
stations it is taken to be 0.1 Pu Mw per minute [40]. On the other For the three area considered, the conventional integral con-
hand, communication time delay is introduced by many signal pro- troller was exchanged by a PI one with the given equation:
cessing and data exchanging operations. In this paper, a time delay
between the control center and each unit is stimulated. Time delay K IIi
K i ðSÞ ¼ K PPi þ : ð8Þ
is in the order of 100 ms and can extend to 250 ms at the worst S
0.02
CS
GA
0.01 PSO
Integral
0
Change in f1
-0.01
-0.02
-0.03
-0.04
-0.05
0 10 20 30 40 50 60 70 80 90 100
Time in second
The control signal is specified by equation: The regular ranges of the optimized gains are [2 to 2] as
obtained in [35–37] and the objective function are calculated
U i ðSÞ ¼ K i ðSÞACEi ðSÞ: ð9Þ
under disturbance of 1% in all areas.
The sum of time multiple absolute errors in ACE is considered as
performance index, hence J can be outlined as: Cuckoo Search algorithm
N Z
X tsim
J¼ tjACEi jdt; ð10Þ The breeding behavior of cuckoo species and the basic items of
i¼1 0
this algorithm are discussed below.
To enhance the system response in terms of the settling time
and overshoots, it is necessary to minify equation (10). The design Cuckoo breeding behavior
process can be formed as the following constrained optimization
problem. Lessen J subject to: CS is a metaheuristic search technique that has been introduced
by Yang and Deb in 2010 [42]. The algorithm is inspired by obligate
K min
PPi 6 K PPi 6 K max
PPi ; brood parasitism of cuckoo species by laying their eggs in the nests
ð11Þ
K min
IIi 6 max
K IIi 6 K IIi : of other host birds. At the proper minute, the hen cuckoo flies
down to the host’s nest, ejects one egg out of the nest, lays an
0.02
CS
GA
0.01 PSO
Integral
0
Change in f3
-0.01
-0.02
-0.03
-0.04
-0.05
0 10 20 30 40 50 60 70 80 90 100
Time in second
0.005
-0.005
Change in ACE1
-0.01
-0.015
-0.02
CS
-0.025 GA
PSO
Integral
-0.03
0 10 20 30 40 50 60 70 80 90 100
Time in second
egg and flies off. This procedure takes about 10 s. A female may from a probability density function which has a power law tail.
visit up to 50 nests during a breeding season. The host birds may This procedure demonstrates the optimal random search pattern
detect that the eggs are not their own and either throw them away and is found in nature [45]. When generating a new egg, a Lévy
or abandon the nest. This has resulted in the evolution of cuckoo flight is done starting at the location of a randomly chosen egg,
eggs which mimic the eggs of local host birds [43]. Moreover, the if the objective function value at these new coordinates is better
timing of egg laying of some species is amazing. Parasitic cuckoos than another chosen egg then that egg is shifted to this new loca-
select a nest where the host bird just laid its own eggs. In general, tion. One of the advantages of CS over other optimization algo-
the cuckoo eggs hatch slightly earlier than their host eggs. It dis- rithms are that only one parameter, the fraction of nests to
lodges all host progeny from host nests. It is a larger bird than its abandon P a ; requires to be inspected. The use of Lévy flights as
hosts, and needs to monopolize the food supplied by the parents. the search method means that the CS can detect each optimum
The chick will roll the other eggs out of the nest by pushing them in a design space and it has been proved in comparison with
with its back. If the host’s eggs hatch before the cuckoos, the other algorithms [46].
cuckoo chick will push the other chicks out of the nest in an iden-
tical manner. Cuckoo Search implementation
0.015
CS
GA
0.01 PSO
Integral
0.005
Change in ACE3
-0.005
-0.01
-0.015
-0.02
0 10 20 30 40 50 60 70 80 90 100
Time in second
x 10-3
8
CS
7 GA
PSO
Integral
6
5
Change in P2
-1
-2
0 10 20 30 40 50 60 70 80 90 100
Time in second
0.1
CS
GA
PSO
0.05 Integral
0
Change in f1
-0.05
-0.1
-0.15
-0.2
0 10 20 30 40 50 60 70 80 90 100
Time in second
0.1
CS
GA
PSO
0.05 Integral
0
Change in f3
-0.05
-0.1
-0.15
-0.2
0 10 20 30 40 50 60 70 80 90 100
Time in second
2. Elitist selection process is applied, so only the eggs with highest where a > 0 is the step size which should be proportional to the
quality are passed to the next generation. scales of the optimization problem. The product intends entry-
3. The number of available hosts nests is specified and a host wise walk during multiplications. Lévy flights supply a random
can reveal a foreigner egg with a probability Pa 2 ½0; 1. If walk while their random steps are drawn from a Lévy distribution
cuckoo egg is detected by the host, it may be thrown away, for large steps.
or the host may leave its own nest and commit it to the
cuckoo intruder.
vy u ¼ tk ; ð1 < k < 3Þ;
Le ð13Þ
The last assumption can be approximated by a factor Pa of the n
nests being exchanged by new nests. The quality of a solution is which has an infinite variance with an infinite mean. Here the
relative to the objective function. Based on the previous rules, steps form a random walk process with a power law step-length
the flowchart of CS is displayed in Fig. 2. The parameters of CS distribution with a heavy tail. Some of the new solutions should
are shown in appendix. Other forms of fitness can be determined be generated by Lévy walk round the best solution; this will
in GA [48,49] and PSO [50,51]. accelerate the local search. However, a substantial fraction of
When generating a new solution xtþ1
i for the ith cuckoo, a Lévy the new solutions should be generated by far field randomization
flights is carried out and whose places should be far enough from the current best
solution, this will ensure the system will not be trapped in a local
xitþ1 ¼ xti þ a Le
vyðkÞ; ð12Þ optimum.
638 A.Y. Abdelaziz, E.S. Ali / Electrical Power and Energy Systems 73 (2015) 632–643
Results and simulations conventional integral controller are suffered from high settling
time and unwanted oscillations. Moreover, the developed con-
Various comparative cases are tested in this section to prove the trollers are more successful in enhancing the damping feature of
efficiency of the developed CS algorithm for optimizing controller power system compared with PSO and GA. Thus, power system
parameters. The proposed CS methodology, PSO and GA are pro- oscillations are efficiently attenuated with the implementation of
grammed in MATLAB 7.1 with I5, CPU 2.53 GHz and 4.0 GB RAM. the developed controllers. Hence, CS provides more satisfactory
The obtained results are the best for all algorithms depending on results than other controllers.
value of J. The convergence times for CS, PSO and GA are 23.3,
28.7 and 40.2 s respectively. Case 2: step increase in all areas
Case 1: step increase in DPD1 In this case, a 1% step increment in demand of all areas simul-
taneously is applied as the second operating point. The signals of
A 1% step increment in demand of the first area (DPD1 ) is the closed loop system are introduced in Figs. 8–12. It is clear from
employed as the first operating point. The system responses are these Figures, that the system oscillations are poorly damped for
shown in Figs. 3–7. In these Figures, the responses with conventional controller. Also compared with PSO and GA, the
0.03
CS
0.02 GA
PSO
Integral
0.01
0
Change in ACE1
-0.01
-0.02
-0.03
-0.04
-0.05
-0.06
-0.07
0 10 20 30 40 50 60 70 80 90 100
Time in second
0.04
CS
GA
PSO
0.02 Integral
0
Change in ACE3
-0.02
-0.04
-0.06
-0.08
0 10 20 30 40 50 60 70 80 90 100
Time in second
developed controllers have a lower settling time and system 10%. It is clear that the system is stable with the developed con-
response is driven back to zero speedily. Moreover, the seniority trollers. In addition, the designed controllers have the ability of
of the suggested algorithm in tuning controllers is demonstrated. adding adequate damping to the system oscillatory modes under
various conditions and the robustness of these controllers is
Case 3: parameter variation believed.
A parameter variation test is utilized to affirm the effectiveness Case 4: step response with different times delay
of the suggested CS algorithm in tuning controllers. Figs. 13–16
show the responses of frequency and ACE deviation of the second The communication time delay is added here, as a second
and third area respectively with variation in all time constants by source of nonlinearities, to investigate its effect on the closed loop
x 10-3
3
CS
2.5 GA
PSO
2 Integral
1.5
1
Change in P3
0.5
-0.5
-1
-1.5
-2
-2.5
0 10 20 30 40 50 60 70 80 90 100
Time in second
0.02
-0.02
-0.04
-0.06
Change in f1
-0.08
-0.1
-0.12
-0.14
Normal
-0.16 Increase by 10%
Decrease by 10%
-0.18
0 5 10 15 20 25 30 35 40 45 50
Time in second
0.02
-0.02
-0.04
-0.06
Change in f3
-0.08
-0.1
-0.12
-0.14
Normal
-0.16 Increase by 10%
Decrease by 10%
-0.18
0 5 10 15 20 25 30 35 40 45 50
Time in second
0.01
-0.01
-0.02
Change in ACE2
-0.03
-0.04
-0.05
Normal
-0.06
Increased by 10%
Decrease by 10%
-0.07
0 10 20 30 40 50 60
Time in second
delay is offered in Figs. 17 and 18. The simulation results detect ITAE ¼ tðjDACEi jÞdt; ð15Þ
i¼1 0
that, the developed controllers provide adequate performance
and they compensate the time delay which donates a more 3 Z
X 100
enhancement in system performance. ISE ¼ ðDACEi Þ2 dt; ð16Þ
i¼1 0
0.02
Normal
0.01 Increase by 10%
Decrease by 10%
0
-0.02
-0.03
-0.04
-0.05
-0.06
-0.07
-0.08
0 10 20 30 40 50 60
Time in second
-0.02
-0.04
-0.06
Change in f1
-0.08
-0.1
-0.12
0 5 10 15 20 25 30 35 40
Time in second
seen that the values of these system performance with the pro- Conclusions
posed controllers are smaller compared with those of PSO, GA
and conventional controller. This demonstrates that the overshoot CS algorithm is suggested in this paper to tune the param-
and settling time are largely minimized by applying the proposed eters of PI controllers for LFC problem. An integral time abso-
CS algorithm. lute error of the ACE for all areas is chosen as the objective
function to enhance the system response in terms of the set-
Merits of CS over others tling time and overshoots. The major contributions of this
paper are:
The settling times of disperse states for each area under differ-
ent operating conditions are shown in Table 3. It is clear that the 1. Establishment of the dynamic model for 3 area power system
settling time associate with CS is the smallest one compared with considering GRC and communication time delay as nonlineari-
PSO, GA and conventional integral control. Moreover, the values of ties sources with LFC based CS to assure the superiority of the
these times are smaller than those obtained in [17,21]. developed controllers over PSO, GA and conventional inte-
Consequently, CS based controllers provide better performance gral controller throughout different disturbances for various
than other controllers. Therefore, the proposed controllers signals.
approach using CS are more accurate and quicker than the other 2. The robustness of the developed controllers are confirmed
schemes for complex dynamical system. through parameter variations.
642 A.Y. Abdelaziz, E.S. Ali / Electrical Power and Energy Systems 73 (2015) 632–643
0.01
-0.01
-0.02
Change in ACE1
-0.03
-0.04
-0.05
-0.06
Without time delay
-0.07 Time delay=0.1 sec
Time delay=0.3 sec
Time delay=0.6 sec
-0.08
0 5 10 15 20 25 30 35 40 45 50
Time in second
Table 1
computational time and gets trapped in local minimum solution.
Gains for different algorithms.
Also, PSO suffers from weak local search ability and algorithm
K PP1 K II1 K PP2 K II2 K PP3 K II3 may lead to possible entrapment in local minimum solutions.
CS 0.2674 0.2219 0.2194 0.1841 0.1818 0.0681 4. The capability of the developed controllers to compensate the
PSO 0.299 0.232 0.234 0.168 0.192 0.088 communication time delay and preserve its satisfactory perfor-
GA 0.2198 0.1997 0.1986 0.1587 0.1876 0.1976 mance is demonstrated.
5. The effectiveness of the developed controllers in terms of vari-
ous indices and settling time is proved.
Table 2
Values of performance indices.
Table 3
Settling time of each variable for different controllers and operating conditions.
Df 1 Df 3 DACE2 DP 2 Df 1 Df 3 DACE2 DP 3
CS 17.94 18.14 17.26 20.79 25.89 26.29 17.26 38.4
PSO 18.41 18.87 17.68 21.46 26.11 26.74 18.36 42.18
GA 21.49 31.88 20.71 46.75 27.71 27.49 20.71 47.88
Integral 48.97 50.84 69.88 59.8 56.15 63.29 69.94 68.74
ANFIS [17] 36.9 62.7 62.7 55.2 31.6 32.4 62.7 66.3
ANN [21] – – – – 35 45 – 45
Fuzzy [21] – – – – 50 50 – 50
A.Y. Abdelaziz, E.S. Ali / Electrical Power and Energy Systems 73 (2015) 632–643 643