2018 International Conference on Computing, Power and Communication Technologies (GUCON)

Galgotias University, Greater Noida, UP, India. Sep 28-29, 2018

A Protective Optimal Coordination Scheme for

Directional Overcurrent Relays Using Modified
Seeker Algorithm
Tahir Khurshaid, Student Member, Abdul Wadood Chang-Hwan Kim
IEEE Deptartment of Electrical Engineering, Deptartment of Electrical Engineering,
Deptartment of Electrical Engineering, Yeungnam University Yeungnam University
Yeungnam University Gyeongbuk, South Korea Gyeongbuk South Korea
Gyeongbuk South Korea wadood@ynu.ac.kr kranz@ynu.ac.kr
tahir@ynu.ac.kr
Kumail Hassan Kharal Sang-Bong Rhee
Saeid Gholami Farkoush Deptartment of Electrical Engineering, Deptartment of Electrical Engineering,
Deptartment of Electrical Engineering, Yeungnam University Yeungnam University
Yeungnam University Gyeongbuk South Korea Gyeongbuk South Korea
Gyeongbuk South Korea kumailhassan@ynu.ac.kr rrsd@yu.ac.kr
saeid_gholami@ynu.ac.kr

Abstract—The Protection coordination of overcurrent
relays in power framework plays a crucial role to protect the
electrical distribution systems by presenting primary as well as
backup protection to system. The coordination between these
relays should be kept at minimum to minimize the overall
operating time and assure that the least power outages and
damage is produced during the fault conditions. This is
necessary to assure that the relays setting should not create an
unintended operation and consecutive sympathy trips. This
paper describes a Modified seeker algorithm (MSA) for
optimal coordination of directional overcurrent relays and is
formulated as an optimization problem. The robustness,
effectiveness and efficiency of the MSA algorithm is tested on
IEEE 8 bus. The results achieved by the modified seeker
algorithm are compared with other evolutionary optimization
techniques and it was observed that the proposed scheme is
quite competent for dealing with such problems. From
analyzing the obtained results, it has been found that the MSA
approach provides the best and optimum solution. MSA has
achieved a lot of relaxation to its easy implementation, modesty
and robustness. MATLAB computer programming has been
implemented to see the effectiveness of the proposed algorithm.
Keywords—Modified Seeker algorithm (MSA), Directional
over current relays, coordination optimization, Power system
protection, Time dial setting
I. INTRODUCTION
Recently real protection system gains more importance in
interconnected distribution system for transferring of real
power to industries, telecommunication networks as well as
to consumer’s level. This continuous supply of power can
only be possible with a reliable and healthy power system. If
this electric power system fails to supply the power there is a
possibility of shut down of the plant and industries, in order
to keep the system in a healthy condition there is a need to
model a reliable protection system which can supply power
continuously without any interruption. In any power plant the
safety of the power framework must be designed so that the
protective relay should clear the erroneous area of the system
to prevent equipment from damage and ensure minimum
This research was supported by Korea Electric Power Corporation,
grant number (R17XA05-38).
system barring to strong section of the network. In power
system, the utmost protection system is the overcurrent
protection. Either in distribution or sub-transmission
systems, this type of protection could be used as a primary or
secondary protection, also in this scheme adjacent electrical
equipment protected by proper coordination of relays, which
makes the system reliable, and life worthy. The primary and
secondary Protection work in parallel as backup protection
wait for the operating time of primary protection to clear the
fault if it fails than backup protection should initiate its
operation after certain interval of time known as coordination
time interval (CTI).The system will malfunction or mal-
operate if the relays not coordinated in the interval of time.
These relaysare useful choice from technical as well as
economical point of view for industrial sector in term of
primary protection in sub-transmission systems and back up
protection in transmission system [1, 2]. The faulty section in
power system is immediately isolated with the help of circuit
breakers, once fulfill the requirements of selectivity,
sensitivity and reliability which make coordination important
for these relays [3]. The main goal of coordination issue is to
assure that relays do not operate out of circle, avoid the
irrelevant disconnectivity of the healthy section and prevent
mal operation of the relays so that the framework has the
minimum possible fault fairing time. The objective of
optimum coordination problem is to sort out an optimum
relay settings, subject to relay characteristic graphs, and
constrains limits of relays setting. In ring or multiple source
networks the overcurrent relay coordination is highly
constrained optimization problem. Generally, this
coordination problem is mixed integer nonlinear
programming (MINLP) which can be cleared by using
evolutionary or metaheuristic method. Different evolutionary
technique have been interrogated to deal the power system
problem in the technical survey [4-8]. In addition the
changes in network topology and configuration should be
taken into account for optimal relay setting [9-10].The
coordination problem is formulated as a linear Programming
Problem in [11-13]. In [13] the values of time dial setting are
minimized with the help of linear formulation. In [14-19]
different genetic algorithm were resolved to find the
coordination problem. In [17] grey wolf optimizer for relay

978-1-5386-4491-1/18/$31.00 ©2018 IEEE 535

coordination is suggested. In [18] to improve the
performance and convergence characteristic of genetic
algorithm a hybrid genetic algorithm with nonlinear
programming is suggested. In [19] considering different
network topologies genetic based algorithm has been
implemented for coordination problem. A modified particle
swarm optimization technique is suggested to accomplish the
minimum values for coordination [20-22].In [23] five
distinct types of Modified differential evolution (MDE)
techniques is depicted to follow the coordination issue to
clear out the better results of MDE concerning to other
techniques. This paper proposes a modified seeker algorithm
which appears and inspires by the acting behavior of human
for searching. Various application of this algorithm could be
found in [25-27]. In this algorithm searching is done in
versatile way for search direction and step length.The
fundamental thought process of this research article to locate
the minimal values of time dial setting (TDS) and plug
setting value (PS) in order to decline the operating time of
overcurrent relays under certain set of values (constraints)
like relay settings and backup constraints.
II. PROBLEM FORMULATION
In a multisource system the coordination of directional
overcurrent relay is formulated as an optimization issue.
However the coordination issue has an objective function
and constraints that satisfies the distinct limits.
A. Objective Function
The motive of the coordination issue is to decrease the
sum of operating time of primary relays while keeping the
coordination of secondary relays accordingly. The objective
function can be explained as given.
Objective function = σே
௜ୀଵ ‫ݓ‬௜ ܶ௜
Where the parameter‫ݓ‬௜ and ܶ௜ are weight and operating
time of the relay. For all relays value‫ݓ‬௜ ൌ ͳ. So that the
performance curve for operating relay ܴ௜ can be chosen from
some of the selectable choice of IEC standards and define as
follow.
ఈ
ܶ௜ ൌ ܶ‫ܵܦ‬௜ ቌ ಺೑೔
ೖ ቍ(2)
൬ ൰ ିଵ
಺೛೔
Where ߙ and ݇ are constant parameter that shows the
relay characteristic and predicted as ߙ ൌ ͲǤͳͶ and ݇ ൌ ͲǤͲʹ
for normal inverse kind of relay. The symbols ܶ‫ܵܦ‬௜ and ‫݌ܫ‬௜
are time dial setting and pickup current of the ݅‫ ݄ݐ‬relay while
‫݂ܫ‬௜ is the fault current for relayܴ௜ .The relay pickup tap setting
could be calculated by using the below equation.
ூ೛೔
ܲܶܵ௜ ൌ (3)
ோ಴೅ 
Where IP is the main/primary pickup current and RCT
denotes the CT ratio.
B. Constraints
The total operating time could be minimized to two kinds of
constraints, the constraints of relay parameter and
coordination constraints. The first constraints contain the
boundaries of time dial result (TDS) and current setting PTS,
while the other constraints is appurtenant to the coordination
of main and secondary relays. The limits can be expressed
as follow.
ܶ‫ܵܦ‬௜ ௠௜௡ ൑ ܶܵ‫ܦ‬௜ ൑ ܶ‫ܵܦ‬௜ ௠௔௫ (4)
௠௜௡ ௠௔௫
ܲܶܵ௜ ൑ ܲܶܵ௜ ൑ ܲܶܵ௜ (5)
However for a reasonable security margin the pickup
current must be lower than the short circuit current and
higher than the highest load current at same time. While the
other constraints is convenient for acclimation of main and
secondary relays operating time. The coordination should be
kept in proper way that the secondary operating time of relay
should be higher than the primary relay if the primary relay
couldn’t solve the fault the secondary relay initiates its
operation by opening the circuit breaker within a certain
interval defined by coordination time interval (CTI).
RJ RI
F
Fig. 1. Primary/backup pair for relay.
The coordination topology depicted in figure 1 as for as
when a fault F occurs it is sensed by both relay Ri and Rj .The
primary relay response first having less operating time than
backup relay. For a fault F, beyond bus bar i, relay Ri should
respond first to clear the fault. Let the operation time of Ri is
set 0.1s. The backup relay should wait for 0.1s plus operating
time of the circuit breaker at bus bar i and overshoot time of
the relays Rj [24].For maintaining selectivity of primary and
(1) backup protection and to keep the grading of relay
coordination accurately, the operating time of backup relay
(Rj) should always be higher than that of primary relay (Ri)
by an amount in which Ri was supposed to have cleared the
fault and this time is usually the sum of operating time of Ri
and breaker operating time. The current and voltage wave for
primary/back up pair is shown in figure 2.
Fig.2.Voltage and current waveform for primary/backup pair.
Hence the coordination constraints are defined as
ܶ௝ ൒ ܶ௜ ൅ ‫ܫܶܥ‬ (6)
Where the parameter ܶ௜ and ܶ௝ are primary and backup
relay operating times
III. Modified Seeker Optimization Technique (MSA)
The MSA optimization method is a natural and biological
algorithm inspired by the natural behavior of human
searching in case of social learning, experience, memory and
uncertainty reasoning, like other evolutionary algorithms this
536
algorithm starts its initialization by effectuating a population weak or worst member by the best member, same case is
of indiscriminate individuals. However in this method the with the proposed algorithm.In this mechanism there is a
population member is known as seeker which represent their competition between seekers for finding the best and worst
respective population. When the total population is split into position in a sub-population. Those seekers which found the
few sub-populations their starts a competition between the best position in the sub-population are promoted to next
seeker for finding the global optimum. So all sub-populations generation by replacing the worst seekers. If the total
in this competition trying to measure their discovery to number of sub-population is K than in each sub-population
vanish from the local minima. The main and important the worst seeker are discarded and its position is taken by
parameter of this technique is to measure the search direction the best seeker of the remaining K sub-populations. The
and step length of seeker during the race. These parts are
worst seekers in each subpopulation is discarded by best
dependable on the objective value function associated with
constraints. locations of the rest K-1 sub-populations. As shown in Fig.
3 the two worst seekers of each subpopulation are retrieved
A. Step Length with the best seekers of the resting two subpopulations.
In the proposed scheme the step length has been found in
an adaptive way while in previous evolutionary optimization
techniques the step length is fixed. However the step length
should be lower in order to the extremum. The step length
can be illustrated as fuzzy judgment regarding the optimal
point in case of evolutionary technique which are inspiredby
the performance of human search. In this case two types of
membership is assigned that is a linear membership function
and bell-type membership function. These two functions are
used in the fuzzification and defuzzification itinerary. For
step length determination and to model a fuzzy rule all the
fitness points in the section are categorized from minimum to
maximum range. After that each seeker is assigned a number Fig.3. Inter subpopulation learning Mechanism.
dependent on its performance and rank. In the Fuzzy system
that rank or number which is assigned to seeker is fed as an C. Steps of Modified Seeker Algorithm
input to that framework with a linear membership form as The modified seeker algorithm is implemented, as
follows: shown in flow chart
Rank of seeker (s‫ ݏ א‬ൌ ͳ…Npop)
ሺܰ௣௢௣ െ ܴ௜ ሻ
ߤ௜ ൌ ߤ௠௔௫ െ ሺߤ െ ߤ௠௜௡ ሻǤ Ǥ ǡ ܰ‫݌݋݌‬ሺ͹ሻ
ሺܰ௣௢௣ െ ͳሻ ௠௔௫
Where parameter ߤ௜ and ܴ௜ represent the membership
value and the rank of the ith seeker in the splinted area
respectively. The good and bad position in population
depends on the higher and lower membership of the seeker.
The membership can be assigned by using a bell membership
function and can be expressed as
మ ൗିଶఈ ൯
Bell member function = ߤఈ௜௝ ൌ ݁ ൫ఈ೔ೕ ೔ೕ (8)
The membership values for the members outside is[-
3ߙ ൅ ͵ߙሿand are fixed atߤ௠௜௡ , whereas the parameter ߙ
shows an indicator and could be found byߙ ൌ ߱Ǥ ሺܺ௕௘௦௧ െ
ܺ௥௔௡ௗ ሻ which helps in search radius in a random vector.
However the parameter ߱weighting factor and its function is
to reduce the step length towards future while ܺ௕௘௦௧ is the
best seeker in same population,
ఠ೘ೌೣ ିఠ೘೔೙
߱ሺ‫ݐ‬ሻ ൌ ߱௠௔௫ െ Ǥ ‫(ݐ‬9)
௧೘ೌೣ
Where‘t’ represents the number of iteration. Finally,
using the bell function the step length will defuzzified as
follows:
ߙ௜௝ ൌ ߙ௝ ඥെŽ‘‰ሺ‫݀݊ܽݎ‬ሺߤ௜ ǡ ͳሻሻ(10) Fig. 4. General Flow chart of Modified Seeker Algorithm
Where ‫݀݊ܽݎ‬ሺߤ௜ ǡ ͳሻ generates a random number in the IV. RESULTS AND DISCUSSION
interval [ ߤ௜ ǡ ͳሿ.
The proposed algorithm used to coordinate the DOCR
B. Inter sub-population learning Mechanism tested on IEEE 8-bus system and the results had been gained
In all the evolutionary optimization algorithms there is race utilizing Matlab optimization toolbox. The system detail of
for finding the best and optimal position by replacing the IEEE-8 test system is given in [21]. This test system

537
comprises of seven lines and 14 relays as shown in Fig. 5, 8 6093 7 1890
and has 28 design variables and 20 constraints. For pickup 8 6093 9 1165
tap setting values to get a comparison seven discrete tap 9 2484 10 2484
setting value are selected (i.e., 0.5, 0.6, 0.8, 1.0, 1.5, 2.0, 10 3883 11 2344
and 2.5). The proposed setting for current transformer ratio, 11 3707 12 3707
minimum and maximum values of time dial and plug setting 12 5899 13 987
for relays is shown in Table I. A coordination interval of 0.3 12 5899 14 1874
is chosen. Table II shows the short-circuit current for near- 13 2991 8 2991
end short-circuit faults. While Table III, shows seeker 14 5199 1 996
parameter proposed for the IEEE 8 bus system .The optimal 14 5199 9 1165
operating times of primary relays (TDS) value are shown in TABLE III. SEEKER PARAMETERS FOR 8 BUS SYSTEM.
table IV While table V obtains the comparative result of the
proposed technique with other evolutionary algorithm Seeker Parameters value
explain in the refrences. ߤ௠௔௫ 0.0111
ߤ௠௜௡ 0.9500
߱௠௔௫ 0.9000
߱௠௜௡ 0.1000
ܰ௉ை௉ 100
TABLE IV. OPTIMAL TDS, FOR 8-BUS SYSTEM.
Relay No Proposed Algorithm
TDS PTS
1 0.1311 2.0
2 0.1215 2.5
3 0.1264 2.5
4 0.1453 2.5
5 0.1810 2.5
6 0.1201 2.5
7 0.1102 2.5
8 0.1203 2.5
9 0.1463 2.5
10 0.1437 2.5
Fig. 5. Single line diagram of 8 bus system 11 0.1754 2.5
12 0.1217 2.5
TABLE I. PROPOSED SETTINGS FOR IEEE 8 BUS SYSTEM 13 0.1054 2.0
14 0.1103 2.5
Relay CTR TDSmin TDSmax PTSmin PTSmax
Total Operating Time σ ܶ݅݅ 5.2375
1 1200/5 0.1 1.1 0.5 2.5
2 1200/5 0.1 1.1 0.5 2.5 TABLE V. COMPARISON OF THE PROPOSED METHOD WITH THE
3 800/5 0.1 1.1 0.5 2.5 LITERATURE.
4 1200/5 0.1 1.1 0.5 2.5 Method Objective function
5 1200/5 0.1 1.1 0.5 2.5 Linear method [28] 11.0645
6 1200/5 0.1 1.1 0.5 2.5
Nonlinear method[28] 6.41169
7 800/5 0.1 1.1 0.5 2.5
8 1200/5 0.1 1.1 0.5 2.5 Genetic algorithm [19] 11.001
9 800/5 0.1 1.1 0.5 2.5 Hybrid GA-LP [18] 10.9499
10 1200/5 0.1 1.1 0.5 2.5 Seeker algorithm [29] 8.4270
11 1200/5 0.1 1.1 0.5 2.5 Proposed algorithm 5.2375
12 1200/5 0.1 1.1 0.5 2.5
13 1200/5 0.1 1.1 0.5 2.5 As seen in table IV and V that the proposed technique
14 800/5 0.1 1.1 0.5 2.5 optimizes the TDS values to minimum. As compared to other
evolutionary techniques, this technique achieves and
TABLE II. NEAR END 3‫ ׎‬SHORT CIRCUIT TEST FOR IEE-8 BUS performs better. The depicted methodology gives an optimal
SYSTEM
solution and lower total operating time ሺσ ܶ݅݅ሻand is capable
Primary Fault current Back up Fault current of solving the directional overcurrent relay problem in a fast
Relays (A) relays (A) and better way. Fig. 6 shows best values of objective
1 3232 6 3232
function found during the course of simulation or we can say
2 5924 1 996
the convergence characteristics which show that the
2 5924 7 1890
convergence is fast and obtain better solution for objective
3 3556 2 3556
function in less number of iterations.
4 3783 3 2244
5 2401 4 2401
6 6109 5 1197
6 6109 14 1874
7 5223 5 1197
7 5223 13 987

538
 40
35
30
25
Best Score
20
15
10
5
100 200 300 900
0 400 500 600 700 800
Number of iteration
Fig. 6.Convergence graph of MSA
V. CONCLUSION
This paper proposed a modified seeker algorithm which
mime on the act of human searching associated with its
social learning and memory reasoning etc. One case study
was utilized to validate the effectiveness of the proposed
scheme by reducing considerable amount of the total
operating time of the primary relays. The main achievement
of the proposed idea is to familiar with the concept of robust
coordination for finding an optimal total operating time for
the coordination problem in power system. The Proposed
algorithm is successfully applied on IEEE 8 bus system. This
technique efficiently finds the best optimal solution and
value of time dial settings and plug multiple settings for
different linear and nonlinear model.
In futur , the proposed technique can be used to solve
overcurrent relay problems of complex and higher buses
power systems.
REFERENCES
[1] D. Birla, M. P. Maheshwari, H.O. Gupta, “An approach to tackle the
threat of sympathy trips in directional overcurrent relay coordination,”
IEEE Trans. Power Deliv. Vol. 22, pp. 851–858, 2007.
[2] A. J. Urdaneta, L. G. Perez, H. Restrepo, “Optimal coordination of
directional overcurrent relays considering dynamic changes in the
network topology,”IEEE Trans. Power Deliv. Vol. 12, pp. 1458–
1464, 1997.
[3] J. Blackburn Protective relaying, principles and applications. New
York: Marcel Dekker Inc; 1987
[4] N. Sahoo, S. Ganguly, D. Das, “Multi-objective planning of electrical
distribution systems incorporating sectionalizing switches and tie-
lines using particle swarm optimization,” Swarm Evolutionary
Comput. Vol. 3,pp. 15–32, 2012.
[5] M. Kowsalya, “Optimal size and siting of multiple distributed
generators in distribution system using bacterial foraging
optimization,” Swarm Evolutionary Comput. Vol. 15, pp. 58–65,
2014.
[6] N. Jain, S. Singh, S. Srivastava, “PSO based placement of multiple
wind DGs and capacitors utilizing probabilistic load flow model,”
Swarm Evolutionary Comput. Vol. 19,pp. 15–24, 2014.
[7] A.A.A. Mousa, “Hybrid ant optimization system for multiobjective
economic emission load dispatch problem under fuzziness,” Swarm
Evolutionary Comput. Vol. 18,pp. 11–21, 2014.
[8] M.P. Camargo, J.L. Rueda, I. Erlich, O. Añó, “Comparison of
emerging metaheuristic algorithms for optimal hydrothermal system
operation,” Swarm Evolutionary Comput. Vol. 18,pp. 83–96, 2014.
[9] S.K. Bhattacharya, S.K. Goswami, “Distribution network
reconfiguration considering protection coordination constraints,”
Electric Power Compt. Syst. Vol. 36,pp. 1150–1165, 2008.
[10] H. A. Abyaneh, H. Majid Al-Dabbagh, K. Karegar, S. H. H. Sadeghi,
R.A. J. Khan, “A new optimal approach for coordination of
overcurrent relays in interconnected power systems,” IEEE Trans.
Power Deliv. Vol. 18,pp. 430–435, 2003.
[11] A. J. Urdaneta, H. Restrepo, S. Marquez, J. Sanchez, “Coordination
of directional overcurrent relay timing using linear programming,”
IEEE Trans. Power Deliv. Vol. 11,pp. 122–129, 1996.
[12] H. K. Karegar, H. A. Abyaneh, V. Ohis, M. Meshkin, “Pre-
processing of the optimal coordination of overcurrent relays,”
Electric Power Syst. Res. Vol. 75, pp. 134–141, 2005.
[13] M. Ezzeddine, R. Kaczmarek, “A novel method for optimal
coordination of directional overcurrent relays considering their
available discrete settings and several operation characteristics,”
Electric Power Syst. Res. Vol. 81,pp. 1475–1481, 2011.
[14] S. Manohar, B.K. Panigrahi, A.R. Abhyankar, “Optimal overcurrent
relay coordination in distribution system,” in: Proceedings of the
International Conference on Energy, Automation and Signal
1000
(ICEAS), IEEE, 2011.
[15] Bedekar, Prashant P., Sudhir R. Bhide, Vijay S. Kale, “Optimum
coordination of overcurrent relays in distribution system using
genetic algorithm,” in: Proceedings of the International Conference
on Power Systems, ICPS'09. IEEE, 2009.
[16] Singh, Dharmendra Kumar, S.Gupta, “Optimal coordination of
directional overcurrent relays: a genetic algorithm approach,” In:
Proceedings of the 2012 IEEE Students’ Conference on Electrical,
Electronics and Computer Science (SCEECS), IEEE, 2012.
[17] Kim, Chang-Hwan, Tahir Khurshaid, Abdul Wadood, Saeid Gholami
Farkoush, and Sang-Bong Rhee, "Gray Wolf Optimizer for the
Optimal Coordination of Directional Overcurrent Relay," Journal of
Electrical Engineering & Technology,Vol. 13, pp. 1043-1051, 2018.
[18] P. P. Bedekar, S. R. Bhide, “Optimum coordination of directional
overcurrent relays using the hybrid GA-NLP approach,” IEEE Trans.
Power Deliv. Vol. 26,pp. 109–119, 2011.
[19] A. S. Noghabi, J. Sadeh, H. R. Mashhadi, “Considering different
network topologies in optimal overcurrent relay coordination using a
hybrid GA,” IEEE Trans. Power Deliv. Vol. 24,pp. 1857–1863, 2009.
[20] A. Rathinam, D. Sattianadan, K. Vijayakumar, “Optimal
coordination of directional overcurrent relays using particle swarm
optimization technique,” Int. J. Comput. Appl. Vol. 10, pp. 40–43,
2010.
[21] H.H. Zeineldin, E.F. El-Saadany, M.M.A. Salama, “Optimal
coordination of overcurrent relays using a modified particle swarm
optimization,” Electric Power Syst. Res. Vol. 76,pp. 988–995, 2006.
[22] M. M. Mansour, S. F. Mekhamer, NE-S. El-Kharbawe, “A modified
particle swarm optimizer for the coordination of directional
overcurrent relays,” IEEE Trans. Power Deliv. Vol. 22,pp. 1400–
1410, 2007.
[23] Abdul Wadood, Chang-Hwan Kim, Tahir Khurshiad, Saeid Gholami
Farkoush, and Sang-Bong Rhee. "Application of a Continuous
Particle Swarm Optimization (CPSO) for the Optimal Coordination
of Overcurrent Relays Considering a Penalty Method," Energies Vol.
11, p. 869, 2018.
[24] Abdul Wadood, Chang-Hwan Kim, Saeid Gholami Farkoush, Sang-
Bong Rhee, “An Adaptive Protective Coordination Scheme for
Distribution System using Digital Overcurrent Relays,” The Korean
Institute of Illuminating and Electrical Installation Engineers,pp. 53-
53, 2017.
[25] C. Dai, Y. Zhu, W. Chen, and X. Zhang, “Seeker optimization
algorithm for optimal reactive power dispatch,” IEEE Trans. Power
Syst., Vol. 24, no. 3, pp. 1218–1231, Aug. 2009.
[26] B. Shaw1, V. Mukherjee, and S. Ghoshal, “Seeker optimization
algorithm: Application to the solution of economic load dispatch
problems,” Inst. Eng. Technol. Gen., Transm. Distrib. vol. 5, no. 1, p.
8191, Aug. 2011.
[27] C. Dai, Y. Zhu, and W. Chen, “Seeker optimization algorithm for
digital IIR filter design,” IEEE Trans. Ind. Electron., vol. 57, no. 5,
pp. 1710–1718, May 2010
[28] Arash Mahari, Heresh Seyedi, “An analytic approach for optimal
coordination of overcurrent relays,”Gener. Transm. Distrib. IET Vol.
7, pp. 1–7, 2013.
[29] Turaj Amraee, “Coordination of directional overcurrent relays using
seeker algorithm,” IEEE Trans. Power Deliv. Vol. 27, pp. 1415–1422,
2012.
539