Electric Power Systems Research 187 (2020) 106435

Contents lists available at ScienceDirect

Electric Power Systems Research

journal homepage: www.elsevier.com/locate/epsr

Optimal coordination of directional overcurrent relays in complex T

distribution networks using sine cosine algorithm
Kumari Sarwagya , Paresh Kumar Nayak, Suman Ranjan
⁎

Department of Electrical Engineering, Indian Institute of Technology (Indian School of Mines), Dhanbad 826004, Jharkhand, India

ARTICLE INFO ABSTRACT

Keywords: The modern power distribution networks are very complex due to the growing integration of distributed gen-
Coordination time interval erators in recent years. Optimal coordination of directional overcurrent relays (DOCRs) used for protection of
Directional overcurrent relay coordination such complex networks is a highly constrained and nonlinear optimization problem. In this paper, a new op-
Distribution system timization algorithm called Sine Cosine Algorithm (SCA) is used first time to solve the optimal coordination
Distributed generator
problems of DOCRs. SCA is a recently proposed population-based algorithm used for solving highly nonlinear
Sine cosine algorithm
optimization problems. The cyclic pattern of sine and cosine function allows a solution to be re-positioned
around another solution. This can guarantee exploitation of the space defined between solutions. The effec-
tiveness of SCA in solving the optimal coordination problems of DOCRs is tested on different fault data generated
on 3-bus, 8-bus, 15-bus and 30-bus test systems. The results clearly show that the effectiveness of the proposed
algorithm is superior in reducing the overall operating time of primary relays compared to the recently published
optimization algorithms for DOCRs coordination. Also, the proposed algorithm is robust in maintaining the
coordination between primary and backup relay pairs. Compared to existing optimization algorithms, the pro-
posed algorithm has reduced coordination interval time between primary and backup relay pairs.

1. Introduction dysfunction of either relays and/or circuit breakers. In such situation, a

backup protection is required to clear the fault. Backup protection is an
Overcurrent relays (OCRs) in coordination with circuit breakers, additional protection provided to a section which activates after an
reclosers and fuses are widely used for protection of conventional radial intentional time delay only when the primary protection of that section
distribution networks. In recent years, the integration of distributed fails to operate. The objective of coordination of DOCRs is to determine
generators (DGs) into distribution systems is growing due to numerous optimum values of PS and TMS for each relay, subject to certain con-
technical, economic and environmental benefits. However, with the strains such that the total operating time of all the primary relays can be
integration of DGs, the radial nature of the conventional distribution minimized and the miscoordination among the primary and backup
system is converted into meshed structure resulting in bidirectional relay pairs can be eliminated.
power flow [1]. The magnitude of the short circuit current is also highly Different approaches have been reported in the literature for op-
affected on DG types (e.g. synchronous or inverter interfaced) and pe- timal coordination of DOCRs used for protection of meshed distribution
netration levels of DGs. For fast and reliable protection of such complex systems. In earlier days, trial and error methods were usually adopted
networks, directional overcurrent relays (DOCRs) are usually preferred for relay coordination [3]. However, the trial and error methods suffer
compared to the simple OCRs [2]. The optimal coordination of DOCRs from the requirement of large number of iterations and slow con-
play important role in improving the overall performance of the pro- vergence rate. Later optimal coordination of DOCRs based on topolo-
tection scheme. gical analysis were proposed [4,5]. The topological analysis based ap-
The operating time of a DOCR depends on two settings; namely the proaches require less number of iterations to reach at a suitable solution
plug setting (PS) and the time multiplier setting (TMS). The main compared to the trial and error methods. However, using the topolo-
function of a DOCR is to detect a fault without any intentional delay if gical analysis method global optimum value of PS and TMS of DOCRs
occurs within its operating zone. Detection of fault within the pre- may not be guaranteed. In later stages, several optimization techniques
scribed zone without any intentional delay is known as primary pro- were proposed for solving the coordination problems of DOCRs. The
tection. Sometimes primary protection fails to clear the fault due to conventional optimization techniques based on linear the programming

⁎
Corresponding author.
E-mail address: [email protected] (K. Sarwagya).

https://doi.org/10.1016/j.epsr.2020.106435
Received 23 November 2019; Received in revised form 2 May 2020; Accepted 28 May 2020
Available online 08 June 2020
0378-7796/ © 2020 Elsevier B.V. All rights reserved.
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Fig. 1. Position finding of SCA.

Table 1
Fault currents seen by primary and backup relays during the occurrence of a
three-phase short circuit fault at the middle of the line.
Primary relay Fault current (A) Backup relay Fault current (A)

1 2075.0 5 400.70
2 1621.7 4 700.64
3 1779.6 1 760.17
4 1911.5 6 622.65
5 1588.5 3 558.13
6 1855.4 2 380.70

Table 2
Fig. 2. Single-line diagram of the 3-bus test system.
CT ratio and pickup tap settings of relays for the 3-bus test system.
Relay no. Pickup tap setting CT ratio
(LP) techniques such as simplex [6], two-phase simplex [7] and dual
simplex [8] are fast and simple. But, the LP based optimization tech- 1 5 300/5
niques are helpful in optimizing the TMS only, as the operating time of 2 1.5 200/5
3 5 200/5
the DOCR is a linear function of TMS. As DOCR coordination is a non-
4 4 300/5
linear optimization problem, non-linear programming (NLP) techniques 5 2 200/5
such as sequential quadratic programming [9], random search tech- 6 2.5 400/5
nique and gradient search technique [10] were also proposed in the
literature to overcome the limitations of LP based techniques. In NLP
based optimization technique, both the PS and TMS of DOCRs are op- premature convergence. Till date, a significant effort has been put by
timized together. The NLP based techniques exhibit superior perfor- the researchers for solving the optimal relay coordination problems of
mance over the LP techniques in solving the DOCR coordination pro- DOCRs. In almost every case the main focus is kept on optimizing the
blem. However, both the conventional optimization techniques can be relay settings such that the total operating time of the relays can be
trapped at the local minima and fail to achieve the global maxima. Also, minimized. However, till date the problem of coordination between
the rate of convergence of such optimization algorithms are slow with relays (primary and backup relay pairs) remain unaddressed. Thus, to
the increase of the system size. fill the research gap, in the present paper both the objectives i.e. opti-
In recent years, several heuristic and nature inspired algorithms mization of relay settings and the coordination between primary and
such as genetic algorithm (GA) [11], GA-NLP [12], seeker algorithm backup relay pairs are simultaneously addressed and reported with
(SA) [13], teaching learning-based optimization [14], informative dif- improved results.
ferential evolution algorithm [15], chaotic differential evolution [16], Recently, a novel population-based optimization algorithm called
artificial bees colony [17], biogeography-based optimization [18], Sine Cosine Algorithm (SCA) is reported in [35] for solving optimiza-
nondominated sorting genetic algorithm-II [19], hybrid gravitational tion problems. The main advantage of SCA is that it smoothly transits
search algorithm and sequential quadratic programming [20], cuckoo from exploration to exploitation using adaptive range in the sine and
search algorithm [21], hybrid particle swarm optimization–gravita- cosine functions. Also, the ranges of sine and cosine functions are up-
tional search algorithm [22], symbiotic organism search [23], modified dated to emphasize exploitation of the search space as the iteration
electromagnetic field optimization [24], fuzzy-GA [25], improved grey counter increases. In this paper, SCA is applied for optimal coordination
wolf optimizer (IGWO) [26], ant-lion optimization [27], firefly algo- of DOCRs. The performance of the proposed algorithm is implemented
rithm [28,29], hybridized whale optimization algorithm (HWOA) [30], on 3-bus, 8-bus, 15-bus and 30-bus test power systems by creating
mixed integer linear programming (MILP) [31,32], modified water three-phase faults at the midpoint of the lines. The performance of the
cycle algorithm [33] and oppositional jaya algorithm [34], have been proposed algorithm is compared with four previously reported im-
applied successfully to solve the optimal coordination problems of portant algorithms (SA [13], IGWO [26], HWOA [30] and MILP [39])
DOCRs. These heuristic and evolutionary optimization techniques have and found to be superior in achieving minimum overall operating time
superior performance in terms of achieving the global optimum com- of relays compared to the existing algorithms. The rest of the paper is
pared to the traditional trial and error, topological and conventional LP organized as follows. In Section 2, the coordination problems of DOCRs
and NLP algorithms. However, most of the heuristic and evolutionary using SCA is formulated. Results and discussions are provided in
algorithms require more computational time and also suffer from Section 3. Finally, the paper is concluded in Section 4.

2
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Table 3
Result of 3-bus system.
Relay no. Proposed algorithm SA [13] IGWO [26] HWOA [30]

TMS PS TMS PS TMS PS TMS PS

1 0.1000 2.0 0.1070 2.5 0.1000 1.5000 0.0500 1.250

2 0.1061 2.5 0.1080 2.0 0.1000 2.6166 0.0500 1.250
3 0.1000 2.5 0.1000 3.0 0.1001 2.9770 0.0500 1.250
4 0.1000 2.0 0.1000 2.5 0.1000 1.5858 0.0500 1.250
5 0.1000 1.0 0.1000 2.5 0.1000 2.8169 0.0612 1.756
6 0.1000 2.0 0.1120 1.5 0.1000 1.5009 0.8065 1.250
Total time (sec) 1.4419 1.5990 1.4789 1.5029

Table 4
Coordination time interval between primary and backup operation.
Relay no. Back up operation Primary operation CTI

TMS PS Top TMS PS Top

1 0.1292 2.5 0.5482 0.1000 2.0 0.2386 0.3096

2 0.1324 2.5 0.6840 0.1061 2.5 0.2592 0.4248
3 0.1671 2.5 0.6686 0.1000 2.5 0.2362 0.4324
4 0.1303 2.5 0.5826 0.1000 2.0 0.2459 0.3367
5 0.1000 2.5 0.4973 0.1000 1.0 0.1832 0.3141
6 0.1484 2.0 0.7541 0.1000 2.0 0.2786 0.4754

2. DOCRs coordination problem formulation

2.1. Mathematical modelling and coordination problem formulation of

DOCRs

Relay coordination problem can be formulated as linear function or

non-linear function. In case of linear function, PS is kept constant be-
tween minimum and maximum limits of the current flow while TMS is
optimized where as in case of non-linear function both PS and TMS are
simultaneously optimized. Besides that, quantized characteristic of
Fig. 4. Single-line diagram of the 8-bus test system.
relay settings adds more complexity to the coordination problem.
There are basically two objectives which must be handled to solve
TMSi *
the DOCRs coordination problem. The first objective is to minimize the Tik =
total operating time of all the relays installed in the system such that the
fault can be cleared in minimum time. Secondly, the coordination be-
( )
IRi, k
PSi
1
(1)

tween primary and backup relays must be maintained i.e. backup relay where, Tik is the operation time of ith relay for fault at kth location, IRi, k is
will operate after a certain time delay only when primary relay fails to the fault current observed by relay Ri for fault at location k. PSi is the
operate. Mathematically, the relay characteristics can be expressed as plug setting of relay Ri above which it starts operating and TMSi re-
[14], presents the time multiplier setting of relay Ri. α and β are constants
which vary with the characteristic of the relay. For inverse definite

Fig. 3. Convergence characteristic of the 3-bus test system.

3
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Table 5 associated zones. Thus, the objective function (OF) can be expressed as
Simulation result of SCA for 8-bus test system. [13],
Relay no. Proposed algorithm MILP [31] SA [13] HWOA [30] n l
min (OF ) = wik *Tik
TMS PS TMS PS TMS PS TMS PS i=1 k=1 (2)

1 0.1000 2.5 0.0772 2.5 0.113 2.0 0.1 1.25 where, n is the number of relays and l is the fault locations, wik is the
2 0.1000 2.0 0.2548 2.5 0260 2.5 0.5381 1.25 probability of occurrence of fault that may happen in each location of
3 0.1000 2.5 0.2185 2.5 0.225 2.5 0.1 1.25 the protective zones. All of the weights in (2) are considered to be 1
4 0.1421 1.5 0.1531 2.5 0.160 2.5 0.2164 1.25
5 0.1000 2.5 0.0903 2.5 0.1 2.5 0.1 1.25
[18], which means that the probability of occurrence of fault in all
6 0.1000 1.5 0.1506 2.5 0.173 2.5 0.2689 1.25 buses are same.
7 0.1056 1.5 0.2391 2.5 0.243 2.5 0.1 1.25 The second objective is to maintain the coordination between pri-
8 0.1000 2.5 0.1484 2.5 0.170 2.5 1.1 1.25 mary and back relay pairs. If, for any reason, the primary relay fails to
9 0.1000 2.5 0.1473 2.5 0.147 2.5 0.1 1.25
clear a fault within its operating zone, the backup relays must operate
10 0.1000 1.0 0.1759 2.5 0.176 2.5 0.1 1.25
11 0.1241 0.5 0.1869 2.5 0.187 2.5 0.1 1.25 to clear the fault. The time delay after which the backup relay operates
12 0.1000 1.5 0.2664 2.5 0.266 2.5 0.1 1.25 when primary relay fails to operate to clear a fault is known as co-
13 0.1000 2.5 0.0784 2.0 0.114 2.0 0.1 1.25 ordination time interval (CTI) and can be expressed as [10],
14 0.1000 1.5 0.2459 2.5 0.246 2.5 0.1 1.25
Total time 4.4310 8.0061 5.8568 CTI Tjk Tik , i = 1, 2, 3, …..m (3)
(sec) th
where Tjk is the time of operation of j relay which may be the first back
up of ith relay for fault at location k. Typically, the CTI used for elec-
Table 6 tromechanical relays is 0.3 s to 0.4 s, while a CTI in the order of 0.1 s to
CTI verification for 8-bus test system. 0.2 s is used in case of microprocessor based numerical relays [7].
Relay no. Back up operation Primary operation CTI
2.2. Coordination constraints
TMS PS Top TMS PS Top
There are certain bounds on the relay operating time which must be
1 0.1097 2.5 1.5080 0.1000 2.5 0.4087 1.0992 satisfied for proper operation of the relay. The PS and TMS must be
2 0.1485 2.5 0.5738 0.1000 2.0 0.2716 0.3022
3 0.2185 1.5 0.6693 0.1000 2.5 0.3134 0.3558
bounded to operate within the limits.
4 0.1515 2.5 0.7545 0.1421 1.5 0.4130 0.3414
5 0.1000 2.5 1.0065 0.1000 2.5 0.4978 0.5087 2.2.1. Operating time constraints
6 0.1386 2.5 0.5665 0.1000 1.5 0.2402 0.3262 The operating time of a relay depends on the PS, TMS and the fault
7 0.1410 2.5 0.6260 0.1056 1.5 0.2326 0.3933
current seen by the relay. Depending upon the characteristic of the
8 0.1392 2.5 0.5968 0.1000 2.5 0.2950 0.3018
9 0.1545 2.0 0.8262 0.1000 2.5 0.3763 0.4498 relay, operating time is determined via analytic formula or standard
10 0.1155 2.5 0.5610 0.1000 1.0 0.2445 0.3165 inverse curves. Therefore, the limits on relay operating time can be
11 0.1284 2.5 0.6506 0.1241 0.5 0.2446 0.4059 expressed as,
12 0.1470 2.5 0.5548 0.1000 1.5 0.2433 0.3114
13 0.1162 1.5 0.7983 0.1000 2.5 0.4287 0.3696 Tikmin Tik Tikmax , i = 1, 2, 3, …..m (4)
14 0.1169 2.5 0.5217 0.1000 1.5 0.2206 0.3010
where, and Tikmax are the minimum and the maximum operating
Tikmin
times of i relay placed at kth location, respectively.
th

minimum time (IDMT) relay, the values of α and β are 0.02 and 0.14,
respectively [12]. 2.2.2. Plug setting constraints
The first objective of DOCRs coordination problem is to determine The plug setting of the relay should be set such that it should remain
optimal values of PS and TMS such that the total weighted sum of silent during the flow of maximum load current through the feeder, but
operating times of all the primary relays can be minimized at their must operate for faults producing minimum fault current. In order to
fulfil the above requirements the boundaries of plug setting of ith relay

Fig. 5. Convergence curve of the 8-bus test system.

4
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Fig. 6. Single-line diagram of the 15-bus test system.

can be expressed as [15], where, TMSimin and TMSimax are the minimum and the maximum values
of TMS of ith relay, respectively. In this paper, the minimum and
max (PSimin , Iload
max
i)
PSi min (PSimax , I fault
min
i)
, i = 1, 2, 3, …..m (5) maximum values of TMS considered are 0.1 and 1.1, respectively [10].
where, and
PSimin are the minimum available plug setting of ith
max
Iloadi
relay and maximum load current that passes through it, respectively. 2.3. Sine cosine algorithm (SCA) for optimal coordination of DOCRs
Similarly, PSimax and I fault
min
i
are the maximum available plug setting of ith
relay and minimum fault current that passes through it, respectively. The SCA is a unique optimization technique which is inspired from
the basic sinusoidal and co-sinusoidal functions and was first time in-
2.2.3. Time multiplier setting constraints troduced in [35]. The SCA develops a set of random population which
The time multiplier setting also have boundary condition which oscillate inwards or outwards to achieve the best solution using a basic
must be maintained for fast and correct operation of the relay. Relay mathematical approach based on sine-cosine functions. SCA is in-
should not violate the boundary. It should operate between the tegrated with several random variables which are adaptive in nature
minimum and maximum limits of the TMS. Thus, the boundary setting that utilize the exploration and exploitation of search space in a very
of TMS of ith relay can be expressed as, efficient manner. During initial phase, randomness rate of random
variables are high such that favourable area of search space can be
TMSimin TMSi TMSimax , i = 1, 2, 3, …..m (6) detected within the total whole search space. Once exploration of

5
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Table 7
Simulation result of 15-bus test system.
Relay no. Proposed algorithm IGWO [26] SA [13] SBB [13]

TMS PS TMS PS TMS PS TMS PS

1 0.1000 2.5 0.1001 2.8114 0.118 1.0 2.5 0.100

2 0.1158 1.5 0.1000 1.5104 0.101 1.0 1.5 0.100
3 0.1685 0.5 0.1048 1.7950 0.105 2.0 2.0 0.124
4 0.1000 2.0 0.1002 3.0701 0.115 1.0 1.5 0.119
5 0.1000 2.5 0.1003 1.5191 0.109 2.0 1.5 0.152
6 0.1000 2.5 0.1004 1.5367 0.108 2.0 0.5 0.227
7 0.1000 1.5 0.1000 2.4252 0.106 2.0 1.5 0.152
8 0.1248 1.5 0.1012 2.3699 0.108 1.5 2.0 0.102
9 0.1000 0.5 0.1030 2.0256 0.106 2.0 2.5 0.117
10 0.2143 0.5 0.1000 1.5244 0.112 1.5 2.5 0.100
11 0.1000 0.5 0.1002 2.5299 0.100 1.5 1.5 0.111
12 0.1568 2.0 0.1008 2.8068 0.100 1.5 0.5 0.211
13 0.1000 2.5 0.1004 2.4412 0.107 2.0 0.5 0.259
14 0.1130 1.0 0.1001 1.6608 0.111 1.0 1.5 0.100
15 0.1000 1.0 0.1000 1.5666 0.103 1.0 0.5 0.207
16 0.1432 0.5 0.1001 1.7755 0.100 1.5 0.5 0.198
17 0.1294 0.5 0.1008 1.5505 0.100 2.0 2.5 0.100
18 0.1620 0.5 0.1130 1.6783 0.105 1.0 1.5 0.100
19 0.1000 0.5 0.1003 2.1283 0.102 2.0 0.5 0.218
20 0.1341 2.5 0.1040 1.5726 0.100 1.5 2.0 0.100
21 0.1000 0.5 0.1002 2.0357 0.166 0.5 0.5 0.189
22 0.1500 1.0 0.1001 1.5461 0.109 1.5 2.0 0.100
23 0.1362 2.5 0.1000 1.5502 0.109 1.0 0.5 0.188
24 0.1000 0.5 0.1002 1.6656 0.100 1.5 2.5 0.100
25 0.1000 2.5 0.1002 1.5019 0.103 2.0 0.5 0.258
26 0.1000 2.5 0.1002 2.9163 0.112 1.5 2.5 0.100
27 0.1000 0.5 0.1002 2.1045 0.104 2.0 1.0 0.185
28 0.1414 0.5 0.1002 1.5029 0.105 2.5 2.0 0.136
29 0.1000 0.5 0.1017 1.6389 0.104 1.5 2.0 0.100
30 0.1000 0.5 0.1006 2.1199 0.101 2.0 0.5 0.217
31 0.1000 0.5 0.1000 2.0376 0.100 2.0 1.5 0.138
32 0.1000 2.5 0.1008 3.0167 0.105 1.5 2.0 0.100
33 0.1000 0.5 0.1012 1.5459 0.100 2.5 2.0 0.137
34 0.1154 2.0 0.1006 1.5149 0.107 2.5 1.0 0.196
35 0.1519 2.5 0.1002 1.9585 0.103 2.0 2.5 0.109
36 0.1374 1.5 0.1002 3.3271 0.100 2.0 1.0 0.183
37 0.1125 2.5 0.1016 1.7971 0.103 2.5 1.0 0.213
38 0.1000 1.0 0.1002 2.5855 0.106 2.5 1.0 0.214
39 0.1000 1.0 0.1004 2.7681 0.103 2.5 1.0 0.198
40 0.1000 0.5 0.1010 2.5714 0.104 2.5 2.0 0.152
41 0.1000 2.5 0.1003 1.7723 0.104 2.5 2.0 0.146
42 0.1000 1.5 0.1001 3.4527 0.104 1.5 1.0 0.160
Total time (sec) 11.9535 12.6446 12.227 15.335

promising region is finished, the randomness rate gets reduced and now exploitation and vice-versa using adaptive variable. Every optimization
random variable changes steadily, such that exploitation of the pro- algorithm must maintain a balance between exploration and exploita-
mising region can take place. The position updating equation for both tion in the given searched space so as to achieve the optimal solution. In
phases can be expressed as [35,36], SCA, adaptive change in the range of sine and cosine function is done
using variable r1 which is governed by (10) and can be represented as in
Xit + 1 = Xit + r1 × sin r2 × r3 Pit Xit (7)
Fig. 1 [35].
Xit + 1 = Xit + r1 × cos r2 × r3 Pit Xit (8) a
r1 = a t
where, th
is the position of the current solution in i dimension at t
Xit th T (10)
iteration, r1, r2 and r3 are random numbers and Pi is the position of the where, T is the maximum number of iterations, a is a constant and t is
destination point in ith dimension. Inserting an additional variable r4 the current iteration.
that varies between 0 and 1 which will shift the search from one phase SCA stores the best solution in a variable as destination point so that
to another. When the value of r4 is less than 0.5, the position of current it will not vanish during the course of optimization and update the next
solution will lie on sine curve while for the value of r4 greater than or position with reference to the destination point.
equal to 0.5 the position of current solution will lie on cosine curve. The
Eqs. (7) and (8) can be written by combining them as,
3. Results and discussion
Xit + r1 × sin r2 × r3 Pit Xit , r4 < 0.5
Xit + 1 = The proposed algorithm is tested on four different test systems; 3-
Xit + r1 × cosr2 × r3 Pit Xit , r4 0.5 (9)
bus, 9-bus, 15-bus and 30-bus systems to validate the optimization
SCA has a great benefit of exploring another search space when the technique. The practicality of the proposed optimization technique in
limiting values of sine or cosine function gets violated whereas when solving DOCRs coordination problem is verified and is compared with
the values lies within the limit then exploitation of that promising re- the recently published results based on SA [13], IGWO [26], HWOA
gion is carried out. SCA enjoys swift shifting from exploration to [30], MILP [31,32], DE [38] and HS [38]. In order to maintain the

6
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Table 8 3.1. 3-bus test system

CTI verification for 15-bus test system.
Relay no. Back up operation Primary operation CTI A 3-bus (B1 to B3) test system having three generators (G1 to G3) and
six DOCRs (R1 to R6) are considered as shown in Fig. 2. The ratings of
TMS PS Top TMS PS Top individual components and line data are given in [4]. Using the given
standard data, three-phase fault current at each bus is calculated con-
1 0.1105 2.5 1.0137 0.1000 2.5 0.3108 0.7029
2 0.1420 1.0 0.7286 0.1158 1.5 0.3102 0.4184 sidering the occurrence of a three-phase fault at the middle of the line
3 0.1120 2.5 0.6096 0.1685 0.5 0.2902 0.3194 as shown in Table 1. The current transformer (CT) ratios of each relay
4 0.1000 2.5 0.7701 0.1000 2.0 0.3096 0.4605 along with tap settings are given in Table 2.
5 0.1380 2.0 0.6458 0.1000 2.5 0.3238 0.3220 For the fault cases shown in Table 1, the proposed SCA is applied to
6 0.1490 2.0 0.6269 0.1000 2.5 0.3145 0.3124
obtain the optimum value of PS and TMS for each fault case. The result
7 0.1103 2.5 0.5820 0.1000 1.5 0.2592 0.3228
8 0.1242 2.5 0.9086 0.1248 1.5 0.3315 0.5771 of proposed algorithm is compared with the three recently available
9 0.1314 1.5 0.5244 0.1000 0.5 0.1729 0.3515 methods; namely the SA [13], IGWO [26] and HWOA [30]. The com-
10 0.1106 2.5 0.7576 0.2143 0.5 0.3802 0.3774 parison results are provided in Table 3. As observed from the table, the
11 0.1474 1.0 0.5580 0.1000 0.5 0.1881 0.3698
proposed algorithm takes 1.4419 sec to operate all the primary relays
12 0.1105 2.5 0.8601 0.1568 2.0 0.4954 0.3647
13 0.1241 2.5 0.6476 0.1000 2.5 0.3201 0.3275
which is less as compared to the existing algorithms. Thus, the proposed
14 0.1000 2.5 1.0345 0.1130 1.0 0.2599 0.7746 algorithm exhibits superior performance as compared to the available
15 0.1088 1.0 0.5381 0.1000 1.0 0.2282 0.3099 methods.
16 0.1235 2.0 0.7564 0.1432 0.5 0.2675 0.4889 Table 4 shows the coordination constraints and it is found that all
17 0.1000 2.5 0.6312 0.1294 0.5 0.2265 0.4047
relays are operating within the constraints and the value of CTI is al-
18 0.1227 1.0 0.5976 0.1620 0.5 0.2749 0.3227
19 0.1243 2.5 0.6973 0.1000 0.5 0.1721 0.5252 ways greater than 0.3 sec [13]. Moreover, CTI margin also get modified
20 0.1132 2.5 0.9644 0.1341 2.5 0.4061 0.5582 and in most of the cases it is below 0.50 sec. The convergence char-
21 0.1000 2.0 0.9540 0.1000 0.5 0.1699 0.7840 acteristic of 3-bus test system is shown in Fig. 3. It is clearly seen from
22 0.1032 2.5 0.6122 0.1500 1.0 0.3184 0.2938
the figure that the curve converges very quickly that is within 12% of
23 0.1252 2.0 1.2209 0.1362 2.5 0.4441 0.7768
24 0.1366 1.5 0.6586 0.1000 0.5 0.1852 0.4735
the maximum iteration. Speed of convergence of the proposed algo-
25 0.1056 2.5 0.6635 0.1000 2.5 0.3375 0.3259 rithm for the 3-bus test system is found to be 0.809 sec.
26 0.1150 2.5 0.7210 0.1000 2.5 0.3367 0.3843
27 0.1091 2.0 0.5136 0.1000 0.5 0.1924 0.3212
28 0.1195 2.5 0.5980 0.1414 0.5 0.2549 0.3431 3.2. 8-bus test system
29 0.1357 1.0 0.5356 0.1000 0.5 0.1701 0.3655
30 0.1908 1.0 0.6106 0.1000 0.5 0.1787 0.4319
31 0.1000 2.5 0.6986 0.1000 0.5 0.1741 0.5245
The network for 8-bus (B1 to B8) test system is shown in Fig. 4. As
32 0.1284 2.0 0.8340 0.1000 2.5 0.3555 0.4785 shown in the figure, it consists of three generators, seven lines and
33 0.1908 1.0 0.5750 0.1000 0.5 0.1849 0.3901 fourteen DOCRs. The external grid (EG) connected at B4 is modelled
34 0.2136 1.5 0.7006 0.1154 2.0 0.3328 0.3679 with a short circuit power of 400 MVA [13]. Assuming that three-phase
35 0.2467 2.5 1.5389 0.1519 2.5 0.5365 1.0024
fault is occurred at the middle of the line and the value of current for
36 0.1209 2.0 0.6726 0.1374 1.5 0.3581 0.3144
37 0.3006 2.5 1.6270 0.1125 2.5 0.3654 1.2616 each of the fault case is given in [13]. The CT ratios of relays R1, R2, R4,
38 0.1204 2.5 0.5596 0.1000 1.0 0.2375 0.3221 R5, R6, R8, R10, R11, R12 and R13 are 1200:5, whereas CT ratios of relays
39 0.1553 1.5 0.5301 0.1000 1.0 0.2356 0.2945 R3, R7, R9 and R14 are 800:5.
40 0.1265 1.5 0.4927 0.1000 0.5 0.1838 0.3089 The optimized values of TMS and PS obtained by the proposed SCA
41 0.1180 2.5 0.6199 0.1000 2.5 0.2990 0.3209
algorithm for 8-bus test system is shown in Table 5. Results of the
42 0.1000 2.5 0.8481 0.1000 1.5 0.2603 0.5877
proposed algorithm is compared with MILP [31], SA [13] and HWOA
[30]. As observed from the table, the overall operating time of all the
uniformity, inverse definite minimum time (IDMT) relays are chosen primary relays are reduced significantly by the proposed algorithm
and a three-phase fault is considered at the middle of the line. MATLAB compared to the existing methods which is a great achievement of the
software is used for the simulation on system of i-7 processor, 1.8 GHz proposed SCA algorithm.
clock speed and 16 GB RAM. The CTI constraints have also been verified in Table 6 and CTI is
considered as 0.3 sec [13]. It is found that no relay is violating the

Fig. 7. Convergence characteristic of the 15-bus test system.

7
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Fig. 8. Single-line diagram of the IEEE 30-bus test system.

constraints and in each case backup relay will operate at least 0.3 sec The plug setting of relay varies between 0.5 to 2.5 in steps of 0.5 [13].
after the operating time of primary relay. The convergence character- The optimized values of TMS and PS obtained by the proposed SCA
istic of 8-bus test system is shown in Fig. 5. It can be clearly seen from algorithm for 15-bus test system is shown in Table 7. Results of the
the figure that SCA has high convergence speed and it converges within proposed algorithm are compared with IGWO [26], SA [13] and SBB
18% of the total iteration. Speed of convergence of the proposed al- [13]. As observed from the table, the overall operating time of all the
gorithm for the 8-bus test system is found to be 1.06 sec. primary relays are reduced significantly by the proposed algorithm
compared to the existing methods which is a great achievement of the
3.3. 15- bus test system proposed SCA algorithm.
The CTI constraints have also been verified in Table 8 and CTI is
The 15-bus (B1 to B15) test system consists of seven DGs, twenty one considered as 0.3 sec [13]. It is found that no relay is violating the
lines and forty two DOCRs as shown in Fig. 6. Each DG has a syn- constraints and in each case backup relay will operate at least 0.3 sec
chronous reactance of 15% at 15 MVA and 20 kV ratings. The short after the operating time of primary relay. The convergence character-
circuit capacity of the EG connected in the figure is of 200 MVA [13]. istic of 15-bus test system is shown in Fig. 7. It can be clearly seen from
The system data and CT ratio of each of the relays are same as in [13]. the figure that SCA has high convergence speed and it converges within

8
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Table 9 Table 10
Simulation result of 30-bus test system. CTI verification for 30-bus test system.
Relay no. Proposed algorithm DE [38] HS [38] Relay no. Back up operation Primary operation CTI

TMS PS TMS PS TMS PS TMS PS Top TMS PS Top

1 0.1658 0.8039 0.1000 1.968 0.1001 2.2823 1 0.1891 2.0117 0.5578 0.1658 0.8039 0.2560 0.3018
2 0.2216 0.5000 0.1000 0.500 0.1001 0.5006 2 0.1924 2.5000 0.9133 0.2216 0.5000 0.5445 0.3688
3 0.1544 2.5000 0.1709 2.500 0.2008 2.0845 3 0.2120 2.500 0.7752 0.1544 2.5000 0.3763 0.3988
4 0.1546 1.2517 0.1370 2.500 0.1534 2.1177 4 0.1993 1.982 0.6753 0.1546 1.2517 0.3666 0.3086
5 0.1000 1.5375 0.1372 2.500 0.1568 2.2603 5 0.1587 1.9044 0.5901 0.1000 1.5375 0.2512 0.3391
6 0.1527 1.6481 0.1455 2.500 0.1618 2.1949 6 0.2389 1.7741 1.0164 0.1527 1.6481 0.6679 0.3485
7 0.2392 2.5000 0.1000 2.163 0.1093 1.9959 7 0.2415 1.9067 1.2346 0.2392 2.5000 0.6730 0.5616
8 0.1924 2.5000 0.1514 2.500 0.1678 2.3441 8 0.1547 1.6971 0.9675 0.1924 2.5000 0.5438 0.4237
9 0.1000 2.5000 0.1000 2.154 0.1001 2.1813 9 0.1698 2.5000 0.5029 0.1000 2.5000 0.1892 0.3137
10 0.1574 1.0153 0.1825 2.500 0.2191 1.9803 10 0.1994 2.4670 0.7031 0.1574 1.0153 0.3992 0.3039
11 0.2724 2.5000 0.1000 0.781 0.1040 0.7300 11 0.2494 2.5000 0.9807 0.2724 2.5000 0.6417 0.3390
12 0.1000 0.9640 0.1000 0.500 0.1001 0.5614 12 0.1692 1.5000 0.5098 0.1000 0.9640 0.1834 0.3264
13 0.1129 0.6363 0.1000 0.554 0.1052 0.5235 13 0.1764 2.5000 0.7264 0.1129 0.6363 0.3856 0.3408
14 0.1000 2.5000 0.1000 0.500 0.1001 0.5003 14 0.2187 2.4553 1.2366 0.1000 2.5000 0.3341 0.9025
15 0.1000 1.8663 0.1654 2.500 0.1832 2.3610 15 0.1239 2.5000 0.7681 0.1000 1.8663 0.4118 0.3563
16 0.1000 2.5000 0.1810 2.500 0.2513 1.5888 16 0.1384 2.5000 0.5187 0.1000 2.5000 0.1727 0.3460
17 0.2204 0.6284 0.1571 2.500 0.1935 2.0471 17 0.166 1.6983 1.3423 0.2204 0.6284 0.5546 0.7877
18 0.1000 2.5000 0.1387 2.500 0.1680 2.0890 18 0.1473 1.7826 0.5438 0.1000 2.5000 0.2380 0.3058
19 0.1037 1.3544 0.1901 2.500 0.2282 2.0034 19 0.1876 2.5000 0.7281 0.1037 1.3544 0.2968 0.4313
20 0.1000 2.5000 0.1924 2.500 0.2260 2.1280 20 0.1000 2.1442 0.7715 0.1000 2.5000 0.2391 0.5325
21 0.1000 1.0114 0.1350 2.500 0.1631 2.0815 21 0.1000 2.0892 1.3542 0.1000 1.0114 0.2013 1.1529
22 0.1170 0.9386 0.1729 2.500 0.2064 2.1890 22 0.1596 2.5000 0.5646 0.1170 0.9386 0.2516 0.3130
23 0.1363 0.9255 0.1602 2.500 0.1889 2.1125 23 0.1685 2.000 0.6814 0.1363 0.9255 0.3168 0.3645
24 0.2008 0.9908 0.2090 2.500 0.2606 1.8900 24 0.2367 1.5000 0.9331 0.2008 0.9908 0.4128 0.5202
25 0.1000 0.5000 0.1510 2.500 0.1656 2.4140 25 0.2693 1.7930 0.9159 0.1000 0.5000 0.2808 0.6350
26 0.1040 2.5000 0.1425 2.500 0.1730 2.1852 26 0.2612 1.9825 0.8814 0.1040 2.5000 0.5129 0.6467
27 0.1000 0.5000 0.1267 2.500 0.1574 1.9668 27 0.2268 2.5000 0.9775 0.1000 0.5000 1.2548 0.3363
28 0.1000 2.5000 0.1730 2.500 0.1903 2.4121 28 0.1595 2.5000 0.9746 0.1000 2.5000 0.3660 0.6086
29 0.1004 1.5589 0.1578 2.500 0.1867 2.1393 29 0.1022 2.0000 0.5707 0.1004 1.5589 0.2180 0.3524
30 0.1354 0.5536 0.1239 2.500 0.1395 2.4161 30 0.1835 2.5000 0.7816 0.1354 0.5536 0.4439 0.3377
31 0.1000 1.8529 0.1000 0.500 0.1000 0.6023 31 0.1284 1.8580 0.5193 0.1000 1.8529 0.1939 0.3254
32 0.1844 0.5000 0.1000 0.500 0.1000 0.7242 32 0.1643 2.5000 0.7773 0.1844 0.5000 0.3694 0.4079
33 0.2823 0.5000 0.1553 2.500 0.1783 2.2162 33 0.2982 2.4522 1.0806 0.2823 0.5000 0.7527 0.3278
34 0.2088 2.5000 0.1389 2.500 0.1689 2.0189 34 0.2052 2.0217 0.7109 0.2088 2.5000 0.3902 0.3207
35 0.2298 0.7827 0.1264 2.500 0.1417 2.3048 35 0.2134 2.5000 1.1106 0.2298 0.7827 0.4619 0.6486
36 0.1000 0.7286 0.1800 2.500 0.1983 2.3581 36 0.1000 2.5000 0.6337 0.1000 0.7286 0.2673 0.3665
37 0.1614 2.5000 0.1000 2.254 0.1000 2.4106 37 0.1821 1.8309 0.7469 0.1614 2.5000 0.4373 0.3096
38 0.1344 1.5262 0.1000 0.500 0.1001 0.6104 38 0.1487 2.5000 0.7734 0.1344 1.5262 0.3946 0.3788
39 0.1000 2.5000 0.1657 2.500 0.1898 2.2205 39 0.1375 2.5000 0.6631 0.1000 2.5000 0.3259 0.3372
Total Time (sec) 14.6863 17.8122 19.2133

38% of the total iteration. Speed of convergence of the proposed al-

gorithm for the 15-bus test system is found to be 1.943 sec. 4. Conclusion

In this paper, optimal relay coordination problems of DOCRs used

3.4. IEEE 30- bus test system for protection of complex meshed distribution systems including DGs is
solved using Sine Cosine Algorithm (SCA). The optimized values of PS
The IEEE 30-bus (B1 to B30) test system consists of twenty lines and and TMS of DOCRs are obtained using SCA. The smooth transit and
thirty nine DOCRs as shown in Fig. 8. The specification of each of the proper balance between exploration and exploitation in SCA using
components of the system is provided in [37]. The CT ratio of each adaptive variables helps in obtaining the promising regions of the
relay is taken as 1000:5 [20]. search space which eventually leads to the better optimal solution. The
The optimized value of TMS and PS obtained by the proposed SCA proposed methodology is implemented on four different test systems
algorithm for the 30-bus test system is shown in Table 9. Results of the namely the 3-bus, 8-bus, 15-bus and 30-bus test systems. The results
proposed algorithm are compared with DE [38] and HS [38]. As ob- obtained in each case are compared with six recently published opti-
served from the table, the overall operating time of all the primary mization algorithms (SA [13], IGWO [17], HWOA [21], DE [38], MILP
relays are reduced significantly by the proposed algorithm compared to [31] and HS [38]). The results clearly show that the proposed technique
the existing methods which is a great achievement of the proposed SCA is superior compared to the available algorithms in achieving the
algorithm. minimum overall operating time of primary relays and maintaining the
The CTI constraints of each of the relays of the 30-bus test system correct coordination between primary and backup relay pairs. Co-
are calculated considering CTI of 0.3 sec [20] and are shown in ordination time interval between primary and backup relay pairs is also
Table 10. As observed from the table, none of the relays are violating improved compared to the available methods. Thus, using the proposed
CTI constraints. Hence, in each case backup relay will operate at least algorithm significantly better solutions can be obtained with less ex-
0.3 sec after the operating time of primary relay. The convergence ecution time compared to the available methods. In future, the work
characteristic of IEEE 30-bus test system is shown in Fig. 9. Speed of can be extended for more complex structure using hybridization of SCA
convergence of the proposed algorithm for the 30-bus test system is with other modern optimization techniques.
found to be 1.86 sec.

9
K. Sarwagya, et al. Electric Power Systems Research 187 (2020) 106435

Fig. 9. Convergence characteristic of the IEEE 30-bus test system.

CRediT authorship contribution statement [17] M.H. Hussain, I. Musirin, A.F. Abidin, S.R. Abdul Rahim, Solving directional
overcurrent relay coordination problem using artificial bees colony, Int. J. Electr.
Electron. Sci. Eng. 8 (5) (2014) 705–710.
Kumari Sarwagya: Conceptualization, Methodology, Software, [18] F.A. Albasri, A.R. Alroomi, J.H. Talaq, Optimal coordination of directional over-
Validation. Paresh Kumar Nayak: Supervision, Writing - review & current relays using biogeography-based optimization algorithms, IEEE Trans.
Power Del 30 (4) (2015) 1810–1820.
editing, Project administration. Suman Ranjan: Data curation, [19] Z. Moravej, F. Adelnia, F. Abbasi, Optimal coordination of directional overcurrent
Investigation, Formal analysis. relays using NSGA-II, Elect. Power Syst. Res. 119 (2015) 228–236.
[20] J. Radosavljević, M. Jevtić, Hybrid GSA-SQP algorithm for optimal coordination of
directional overcurrent relays, IET Gen. Trans. Distrib. 10 (8) (2016) 1928–1937.
Declaration of Competing Interest [21] A. Ahmarinejad, S.M. Hasanpour, M. Babaei, M. Tabrizian, Optimal overcurrent
relays coordination in microgrid using cuckoo algorithm, Energy Proc. 100 (2016)
280–286.
None [22] A. Srivastava, J.M. Tripathi, S.R. Mohanty, B. Panda, Optimal over-current relay
coordination with distributed generation using hybrid particle swarm optimiza-
tion–gravitational search algorithm, Electric Power Comput. Syst. 44 (5) (2016)
References 506–517.
[23] D. Saha, A. Datta, P. Das, Optimal coordination of directional overcurrent relays in
[1] K. Sarwagya, P.K. Nayak, An extensive review on the state-of-art on microgrid power systems using symbiotic organism search optimisation technique, IET Gen.
protection, IEEE Power, Communication and Information Technology Conference Trans. Distrib. 10 (11) (2016) 2681–2688.
(PCITC-2015), 15th-17th Oct. Bhubaneswar, India, S.O.A University, 2015. [24] H.R.E.H. Bouchekara, M. Zellagui, M.A. Abido, Optimal coordination of directional
[2] H.A. Abyaneh, M. Al-Dabbagh, H.K. Karegar, S.H.H. Sadeghi, R.A.J. Khan, A new overcurrent relays using a modified electromagnetic field optimization algorithm,
optimal approach for coordination of overcurrent relays in interconnected power Appl. Soft Comput. 54 (2017) 267–283.
systems, IEEE Trans. Power Deliv. 18 (April (2)) (2003) 430–435. [25] D. Solati Alkaran, M.R. Vatani, M.J. Sanjari, G.B. Gharehpetian, M.S. Naderi,
[3] M.J. Damborg, R. Ramaswami, S.S. Venkata, J.M. Postforoosh, Computer aided Optimal overcurrent relay coordination in interconnected networks by using fuzzy-
transmission protection system design, IEEE Trans. Power Appl. Syst. 103 (1) based GA Method, IEEE Trans. Smart Grid 9 (July (4)) (2018) 3091–3101.
(1984) 51–59. [26] Z. Jamal, M.H. Sulaiman, O. Aliman, Z. Mustaffa, Optimal overcurrent relays co-
[4] A.J. Urdaneta, N. Ramon, G.P. Luis Jimenez, Optimal coordination of directional ordination using an improved grey wolf optimizer, Int. J. Adv. Comp. Sc. Appl. 9
relays in interconnected power system, IEEE Trans Power Deliv. 3 (3) (1988) (11) (2018) 117–125.
903–911. [27] A.Y. Hatata, A. Lafi, Ant lion optimizer for optimal coordination of directional
[5] L. Jenkins, H.P. Khincha, S. Shivakumar, P.K. Dash, An application of functional overcurrent relays in distribution systems containing DGs, IEEE Access. 6 (2018)
dependencies to the topological analysis of protection schemes, IEEE Trans. Power 72241–72252.
Deliv. 7 (Jan. (1)) (1992) 77–83. [28] A. Tjahjono, et al., Adaptive modified firefly algorithm for optimal coordination of
[6] A.J. Urdaneta, H. Restrepo, S. Marquez, J. Sanchez, Coordination of directional overcurrent relays, IET Gen. Trans. Distrib. 11 (10) (2017) 2575–2585.
relay timing using linear programming, IEEE Trans. Power Deliv. 11 (Jan. (1)) [29] T. Khurshaid, A. Wadood, S. Gholami Farkoush, C. Kim, J. Yu, S. Rhee, Improved
(1996) 122–129. firefly algorithm for the optimal coordination of directional overcurrent relays,
[7] B. Chattopadhyay, M.S. Sachdev, T.S. Sidhu, An online relay coordination algo- IEEE Access. 7 (2019) 78503–78514.
rithm for adaptive protection using linear programming technique, IEEE Trans. [30] T. Khurshaid, A. Wadood, S. Gholami Farkoush, J. Yu, C. Kim, S. Rhee, An improved
Power Deliv. 11 (1996) 165–173. optimal solution for the directional overcurrent relays coordination using hy-
[8] H.B. Elrefaie, M.R. Irving, S. Zitouni, A parallel processing algorithm for co-ordi- bridized whale optimization algorithm in complex power systems, IEEE Access. 7
nation of directional overcurrent relays in interconnected power systems, IEEE (2019) 90418–90435.
Proc. Gen. Trans. Distrib. 141 (5) (1994) 514–520. [31] S.T.P. Srinivas, K. Shanti Swarup, A new mixed integer linear programming for-
[9] D. Birla, R.P. Maheshwari, H.O. Gupta, A new nonlinear directional overcurrent mulation for protection relay coordination using disjunctive inequalities, IEEE
relay coordination technique and banes and boons of near-end faults based ap- Power Energy Tech. Syst. J. 6 (June (2)) (2019) 104–112.
proach, IEEE Trans. Power Deliv. 21 (2006) 1176–1182. [32] Y. Damchi, M. Dolatabadi, H.R. Mashhadi, J. Sadeh, MILP approach for optimal
[10] V. Ravikumar Pandi, H.H. Zeineldin, W. Xiao, Determining optimal location and coordination of directional overcurrent relays in interconnected power systems,
size of distributed generation resources considering harmonic and protection co- Electric Power Syst. Res. 158 (2018) 267–274.
ordination limits, IEEE Trans. Power Syst. 28 (2013) 1245–1254. [33] A. Korashy, Salah Kamel, Abdel-Raheem Youssef, Francisco Jurado, Modified water
[11] F. Razavi, H.A. Abyaneh, M. Al-Dabbagh, R. Mohammadi, H. Torkaman, A new cycle algorithm for optimal direction overcurrent relays coordination, Appl. Soft
comprehensive genetic algorithm method for optimal overcurrent relays co- Comput. 74 (2019) 10–25.
ordination, Elect. Power Syst. Res. 78 (4) (2008) 713–720. [34] J. Yu, C. Kim, S. Rhee, Oppositional jaya algorithm with distance-adaptive coeffi-
[12] P.P. Bedekar, S.R. Bhide, Optimum coordination of directional overcurrent relays cient in solving directional over current relays coordination problem, IEEE Access. 7
using the hybrid GA-NLP approach, IEEE Trans. Power Deliv. 26 (2011) 109–119. (2019) 150729–150742.
[13] T. Amraee, Coordination of directional overcurrent relays using seeker algorithm, [35] S. Mirjalili, SCA: a sine cosine algorithm for solving optimization problems, Knowl.-
IEEE Trans. Power Deliv. 27 (2012) 1415–1422. Based Syst. 96 (2016) 120–133.
[14] M. Singh, B.K. Panigrahi, A.R. Abhyankar, Optimal coordination of directional over- [36] D.R. Nayak, R. Dash, B. Majhi, S. Wang, Combining extreme learning machine with
current relays using teaching learning-based optimization (TLBO) algorithm, Int. J. modified sine cosine algorithm for detection of pathological brain, Comput. Electr.
Elect. Power Energy Syst. 50 (2013) 33–41. Eng. 68 (2018) 366–380.
[15] A.S. Noghabi, J. Sadeh, H.R. Mashhadi, Considering different network typologies in [37] R. Mohammadi, H.A. Abyaneh, H.M. Rudsari, et al., Overcurrent relays coordina-
optimal overcurrent relay coordination using a hybrid GA, IEEE Trans. Power Deliv. tion considering the priority of constraints, IEEE Trans. Power Deliv. 26 (3) (2011)
24 (4) (2009) 1857–1863. 1927–1938.
[16] T.R. Chelliah, R. Thangaraj, S. Allamsetty, M. Pant, Coordination of directional [38] M.N. Alam, B. Dash, V. Pant, A comparative study of metaheuristic optimization
overcurrent relays using opposition based chaotic differential evolution algorithm, approaches for directional overcurrent relays, Electric Power Syst. Res. 128 (2015)
Electric Power Energy Syst. 55 (2014) 341–350. 39–52.

10