2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)
Indian Institute of Technology (Banaras Hindu University) Varanasi, India, Dec 9-11, 2016
Optimum Coordination of Overcurrent Relays Using
the Modified Jaya Algorithm
P. P. Bedekar
Electrical Engineering Department
Govt. College of Engineering
Amravati, India
e-mail: bedekar_pp@rediffmail.com
Abstract—Application of modified Jaya algorithm for
determining the optimum time multiplier setting (TMS) and plug
setting (PS) of overcurrent relays (OCRs) is presented in this
paper. The OCR time coordination is of great importance as it
reduces the power outages by avoiding the backup relays to mal-
operate. For this, the OCRs should have PS and TMS values set
to their optimum values. Setting the PS and TMS of OCRs to
their optimum values can be formulated as a constrained non-
linear optimization problem. The objective is to find the value of
PS and TMS of OCRs so as to make the time of operation of
relays as minimum as possible. This is to be achieved under the
constraint of maintaining the coordination of relays.
Jaya algorithm is a recently proposed simple optimization
technique which can be used for solving the constrained
optimization problems. The main contribution of this paper is
modification in the original Jaya algorithm and application of
modified Jaya algorithm to determine the values of PS and TMS
of OCRs, which are optimum. The results are compared with the
results obtained using genetic algorithm (GA). It has been shown
that the modified Jaya algorithm outperforms the GA. Also it is
shown that the problem can be decomposed in parts to reduce the
complexity without loss of accuracy.
Keywords— Backup protection; Constrained optimization;
Overcurrent relay coordination; Jaya algorithm; Modified Jaya
algorithm; Genetic algorithm
I. INTRODUCTION
Power system protection plays vital role in the power
system stability. Overcurrent protection is the main protection
provided to sub-transmission and distribution systems. It is
used as backup protection to transmission systems [1]. The
main purpose of primary relay is to protect the system against
faults within its primary zone, but primary relay fails to
operate then backup should give tripping command to the
associated circuit breaker. The relays must have proper
coordination so that there should not be any maloperation.
This can be done by calculating the operating time of relays,
properly. The relay operating time depends on its TMS and
PS. So main aim of researchers is to select suitable values of
these settings of relays so that overall time of relay operation
should reduce, and simultaneously there should be
coordination with other relays.
Determination of optimum values of TMS, considering
predetermined and fixed values of PS, can be formulated as
978-1-5090-5384-1/16/$31.00 ©2016 IEEE
P. N. Korde
Electrical Engineering Department
G. H. Raisoni Institute of Engineering and Technology
Pune, India
n_pragati25@rediffmail.com
constrained linear programming problem (LPP) [2, 3]. Several
methods, like simplex, two phase simplex, revised simplex,
big-M, dual simplex, GA, PSO etc., have been proposed to
solve this problem [2-13].
If the optimum values of both PS and TMS are calculated
then the problem becomes a constrained nonlinear
programming problem [14]. Several methods have been used
to calculate the optimum value of these parameters of OCRs
which reduces the total operating time of relays while
maintaining the coordination between them. Hybrid GA-Non
linear programming method has been proposed in [15]. A
review of OCR coordination has been presented in [16, 17].
This paper suggests a simple modification in the original
Jaya algorithm and then presents application of modified Jaya
algorithm for determine the value of PS and TMS of OCRs
which are optimum. Jaya algorithm is a recently proposed,
powerful optimization method, using which the constrained
optimization problems can be solved easily [18, 19]. This
algorithm is based on the concept that solution obtained in any
iteration should move nearer to the best solution and at the
same time should move away from the worst solution.
The penalty method has been used to incorporate the
constraints in the objective function. The algorithm has been
tested successfully on many systems and in this paper two of
them are presented.
II. PROBLEM FORMULATION
The problem of finding the optimum value of PS and
TMS of OCRs, can be stated as a non-linear optimization
problem. The objective function of relay coordination, is
stated as follows [3-7],
i.e.,
r
(1)
min f ¦W n
.t n , k
n 1
where
r: total relays,
tn,k : is the time of operation of relay Rn for k as fault point,
and
Wn: weight to be assigned for operating time for relay Rn
Since distribution systems have all the lines of
approximately same length and the lines are short, value 1 is
assigned to weight for all relays [2].
The objective of minimizing the total operating time of
relays is to be achieved under four sets of constraints [15]
479
A. Coordination Criteria of Relays E. Relays Characteristics
When fault takes place, primary and backup relay There are different types of OCRs, having different types
simultaneously sense the fault. Mal-operation can be avoided, of characteristics as given in equation (6)
by making an arrangement such that backup relay will operate The operating time of OCRs is given as:
only if the primary relay fails. Considering the fault to be at D ( TMS ) (6)
t
point k, and Rm and Rn are the primary and backup relay op
( PSM )
E
1
respectively, then the constraint to give proper coordination is where,
stated as top: operating time of relay, and
t n ,k  t m ,k t ' t (2)
PSM: plug setting multiplier.
where, for fault at k
t m , k is the time of operation of Rm, The α, β constant details are given in Table I [1, 10, 15,
20].
t n , k is the time of operation of Rn,

' t is the selective time interval (STI) TABLE I

VALUES OF O AND J FOR DIFFERENT TYPES OF OCRS
B. Bounds on Relay Operating Time
OCR type D E
The relays can’t have operating time less than a particular
value and more than another particular value. This can be Instantaneous Fixed Operating time.
written in the form of constraint as Definite Time Pre-calculated and fixed operating
t n , m in d t n , k d t n , m ax (3) time
Inverse Definite 0.14 0.02
where, Minimum Time
t n , m in is the lower bound on the time of operation of relay at (IDMT)
location n for fault in its primary zone Very Inverse 13.5 1
Extremely 80 2
t n , m ax is the upper bound on the time of operation of relay at
Inverse
location n for fault in its primary zone
III. JAYA ALGORITHM
C. Bounds on TMS of Relays
Jaya algorithm is simple and powerful optimization
The relays can’t have TMS less than a particular value algorithm which is based on the principle that the solution in
and more than another particular value. This can be written in any iteration moves nearer to the best solution and at the same
the form of constraint as time moves away from the worst solution. The common
TMS n , m in d TMS n d TMS n , m ax (4) control parameters are used in this algorithm [16, 17]. It starts
where, for relay Rn with a user defined population size (number of probable
candidate solutions). To convert the problem in to an
TMS n , m in is the lower bound on relay TMS unconstrained optimization problem, the penalty method is
TMS is the upper bound on relay TMS used. Value of objective function corresponding to each
n , m ax
probable solution is found out, and the best solution and worst
TMS n , m ax
and TMS n , m in
can be chosen as 1.2 and 0.025 solution are identified. Using these best and worst solutions,
and respectively [20]. other solutions are modified. Unlike the other modern and
nature inspired algorithms which use only the best solution/s
D. Bounds on PS of Relays to obtain new solution, Jaya algorithm uses both the worst and
Like TMS, the relays can’t have PS less than a particular the best solutions to find the new solution. Thus, the algorithm
limit and more than another particular limit. This can be always tries to move towards the best solution and
written in the form of constraint as simultaneously tries to increase the distance from the worst
solution.
PS n , m in d PS n d PS n , m ax (5)
A. Algorithm
where, for relay Rn
The steps of the Jaya algorithm are as below:
PS n , m in is the lower bound on relay PS
01. Start
PS n , m ax
is the upper bound on relay PS 02. Initialize size of population, number of design
variables and specify the criteria to terminate the
PS n , m ax
and PS n , m in
can be selected as below [20] algorithm
1.25 * maximum load current ≤ PS, and 03. In the current population find the best and worst
(2/3)* minimum fault current ≥ PS solutions
04. Using the best and worst solutions, find the new
solutions
05. If the new solution is better than the previous solution

480
 Then new solution should be considered for next A. Illustration I
iteration A radial system is considered with two IDMT directional
Else keep the same (previous) solution OCRs. The same is shown in Fig. 1.
06. Is the stopping criteria satisfied
RA RB
If yes, jump to step 07
If no, jump to step 03 B
A C
07. Display the optimum solution
08. Stop Fig. 1. A simple radial system

The solution is modified (as mentioned in step 04) using the 1) Problem Formulation: Table II shows CT ratio,
following formula [4, 5]: minimum fault current, maximum fault current and maximum
load current, for the relays RA and RB.
X
mod ified
j , k ,i
X j , k ,i
 r 1 j ,i ( X j , best , i
 X j , k ,i
)  r2 j ,i
(X j , worst , i
 X j , k ,i
) (7)
TABLE II
DATA FOR RELAY RA AND RB
where, Xj,k,i is the value of the variable j of solution k in
iteration i; Xj,best,i is the value of the variable j for best solution Relay Max. fault Min. fault Max. load CT Ratio
current current current (A / A)
in iteration i; Xj,worst,i is the value of the variable j for worst (A) (A) (A)
solution in the iteration i; r1j,i and r2j,i are random numbers for RA 4000 1000 300 600 / 1
variable j in iteration i. These random numbers should be in RB 3000 1000 100 200 / 1
the range [0, 1].
B. Suggested Modification For each relay the operating time (minimum) was considered
as 0.2 s and the selective time interval (STI) was taken as 0.57
MATLAB code has been developed for application of s. Table III shows the current through the secondary of the CT
Jaya algorithm to solve relay coordination problem. While associated with the relays.
applying Jaya algorithm for relay coordination problem it was
found that in some iteration, the modified value of few TABLE III
variables (as calculated using equation 7) for some candidate CURRENT SEEN BY THE RELAYS
solutions, do not follow the lower or upper bound. In this
Fault point Relay
situation the algorithm moves far away from the optimum
RA RB
solution and does not give feasible solution (as the values of Just after bus A 6.667 A --
few variables for one or more candidate solutions are not Just after bus B 5A 15 A
within the specified range). A small and simple modification
in the Jaya algorithm is suggested in this paper to tackle this Considering x 1 and x 2 as TMS of relay RA and RB
situation. The modification is “if the value of any variable in
any iteration for any candidate solution violates the specified respectively, and x 3 and x 4 as PS of relay RA and RB, the
bound then it is set to be equal to its limit value”. This step is problem can be written as –
to be introduced between step 04 and step 05 of the algorithm 0 . 14 x 1 0 . 14 x 1 0 . 14 x 2 (8)
min z  
given in part A. The step is as below:  6 . 667 x3 
0 . 02
1 5 x3 
0 . 02
1 15 x4 
0 . 02
1

If X
mod ified
j , k ,i
< (Xj)min then X
mod ified
j , k ,i
= (Xj)min Subject to,
0 . 14 x 1
t 0 .2
(9)
If X
mod ified
j , k ,i
> (Xj)max then X
mod ified
j , k ,i
= (Xj)max  6 . 667 x3 
0 . 02
1
0 . 14 x 1 (10)
This small modification makes drastic improvement in the t 0 .2
5 x3 
0 . 02
1
performance of the Jaya algorithm.
0 . 14 x 2
t 0 .2 (11)
IV. RESULTS AND DISCUSSIONS 15 x4 
0 . 02
1

Jaya algorithm with suggested modification was used to 0 . 14 x 1 0 . 14 x 2 (12)

 t 0 . 57
find the optimum values of PS and TMS of OCRs. A program, 5 x3 
0 . 02
1 15 x4 
0 . 02
1
in MATLAB, was developed for the same. Various cases were
0 . 025 d x 1 d 1 . 2 (13)
tested using the program and it was found to give correct
result in all cases. In this paper, two typical cases are 0 . 025 d x 2 d 1 . 2 (14)
presented. 0 . 625 d x 3 d 1 . 111 (15)
Details of application of modified Jaya algorithm to find 0 . 625 d x 4 d 3 . 333 (16)
the optimum OCR coordination is presented for first case
(illustration I). Problem in case II (illustration II) has been Equations (9), (10), and (11) give the minimum operating time
solved in the similar manner. constraint, (12) gives the coordination constraint, (13), and
(14) give the bounds on TMS, and (15), and (16) give the

481
bounds on PS. This is a nonlinear programming (NLP)
problem, with four variables (x1 to x4). The optimum value of
these variables is to be found out satisfying the constraints
given by equation (9) to (16)
2) Application of Modified Jaya Algorithm: For applying
modified Jaya algorithm to this problem, the problem is first
written as an unconstrained optimization problem. For this the
penalty method is used.
The TMS bounds, given by equations (13) and (14), are
taken as the upper and lower limit of the variables x1 and x2, Fig. 3: TMS and PS of relays corresponding to best candidate solution
and the PS bounds, given by equations (15) and (16), are taken against iteration
as the upper and lower limit of the variables x3 and x4; in the
modified Jaya algorithm program. 4) Comparison with GA: Global optimum solution is
Penalty method has been applied to incorporate the relays obatined by GA in most cases, but randomness in the process
operating time constraints [equations (9) to (11)], the of GA, causes the it to converge at local mimimum. For
coordination constraint [equation (12)] and the relay comparing the results of the modified Jaya algorithm with
characteristic constraints in the objective function [15] and those obtained using GA, the same problem was solved using
thus the problem is converted in to unconstrained optimization GA. It is observed that we do get values close to the optimum
problem. A positive large number is used as penalty because values in many trials, however in some trials GA converges
the objective is to minimize the function. Modified Jaya away from the optimum solution. The shown is in Fig. 4.
algorithm was then applied to this problem. 50 candidate
solutions were considered and the candidate solutions were
modified using equation (7) with the suggested modification.

3) Results: 100 iterations of the algorithm were performed.

The optimum PS and TMS values are as under –
TMS1 = 0.1682 PS1 = 1.1110
TMS2 = 0.0939 PS2 = 0.6250
In each iteration the value of objective function for the
solution (corresponding to best candidate) obtained is stored
and plotted in Fig. 2. The optimum value of the objective
function is found to be 1.61725 (obtained in approximately 60 Fig. 4: PS and TMS of relays (best values) against iterations of GA
iterations). In this trial the values of PS and TMS obtained are as
below –
TMS1 = 0.2462 PS1 = 0.6250
TMS2 = 0.0480 PS2 = 3.0038
It gives the objective function value of 1.7282 (which is
not optimal).
After performing many trials for each problem, it is found
that the modified Jaya algorithm always converges to the same
and optimum value. Thus it can be said that, the modified Jaya
algorithm outperforms the GA technique.

Fig. 2: Value of objective function corresponding to best solution B. Illustration II

Fig. 3 shows the values (best) of PS and TMS of relays
during different iterations of the algorithm. All the constraints
are satisfied by the values of PS and TMS obtained. The
minimum operating time (for any fault location) is obtained
and also the proper coordination is ensured.
A single end fed, with six OCRs, shown in Fig. 5, was
considered. OCR 1 and 6 are taken as non-directional and
other OCRs are taken as directional. It is a multi loop system
as different configurations are formed depending on the fault
point.

482
 The optimized values of PS and TMS are obtained and
Bus 1
shown below –
1 6 TMS1 = 0.0765 PS1 = 0.5000
TMS2 = 0.0250 PS2 = 0.2000
A
TMS3 = 0.0250 PS3 = 1.7305
TMS4 = 0.0250 PS4 = 2.0110
2 Bus 2
C TMS5 = 0.0025 PS5 = 0.2000
3
Load TMS6 = 0.0665 PS6 = 0.5000
(200 A)
B The objective function value is found to be 3.2035 (1.5669 for
part I and 1.6366 for part II).
4 5 Objective function value for the best candidate solution in
Bus 3 each iteration, for part I, is shown in Fig. 6 and the same for
part II is shown in Fig. 7. The values of PS and TMS of relays
Load
(300 A) 1, 3 and 5 for the best solution, obtained during different
iterations of the algorithm are shown in Fig. 8, and the same
Fig. 5. A distribution system with six OCRs for relays 2, 4 and 6 are shown in Fig. 9.
The source is taken to be of 25 MVA, 11 kV. The source In this case also, all the constraints are satisfied by the
impedance is taken as (0+j 0.25) pu. Base kV and base MVA obtained values of PS and TMS. The relay operating time is
are taken as 11 and 25 respectively. The impedance of the two minimized for any fault location and the proper coordination is
lines (bus 1 to bus 2 , and bus 2 to bus 3) is taken as (0+j 0.3) also ensured.
pu. And the impedance of the line connected between bus 1
and 3 is taken as (0+j 0.7) pu. The line charging admittance
and the load currents during fault were neglected. Table IV
shows the relationships of relays (primary-backup). Table V
shows the maximum and minimum fault current, maximum
load current and CT ratio.
TABLE IV
PRIMARY-BACKUP RELATIONSHIP OF THE RELAYS

Fault Primary Backup

point relay relay
A 1 --
2 4
4 6 Fig. 6: Value of objective function for the best solution (Illustration II–Part I)
B 3 1
4 6
C 6 --
5 3
3 1

TABLE V
MAXIMUM FAULT CURRENT, MINIMUM FAULT CURRENT, MAXIMUM LOAD
CURRENT AND CT RATIO

Relay CT ratio IL,max If,min If,max

(A / A) (A) (A) (A)
1 600 : 1 300 604.92 3033.2
2 100 : 1 -- 342.60 395.63 Fig. 7: Value of objective function for the best solution (Illustration II–Part II)
3 200 : 1 100 604.92 1576.6
4 100 : 1 -- 342.60 834.7
5 100 : 1 -- 604.92 698.5
6 400 : 1 200 342.60 1895.8

In this problem the time of operation of relays 1, 3 and 5,

is found to be independent of the time of operation of relays 2,
4 and 6, for fault at any point. Hence it is easily possible to
decompose the problem into two parts. First part consists of
optimizing the value of PS and TMS of relays 1, 3 and 5, and
in the second part the value of PS and TMS of relays 2, 4 and
Fig. 8: PS and TMS of relays 1, 3 and 5 corresponding to best candidate
6 are optimized. These two parts were solved independently.
solution against iteration
This reduces the complexity of the problem.

483

Fig. 9: PS and TMS of relays 2, 4 and 6 corresponding to best candidate
solution against iteration
V. CONCLUSIONS
A small and simple modification in the basic Jaya
algorithm has been suggested in this paper. A program for the
modified Jaya algorithm has been developed in MATLAB.
The algorithm has been used to find out the optimum values of
PS and TMS of OCRs. Various systems, including many
numbers of OCRs, were used to test the usefulness of the
algorithm. It is shown that in some cases the problem can be
decomposed which greatly reduces the complexity of the
problem without loss of accuracy.
For the sake of comparison programs have been
developed in MATLAB for GA technique It was found that
modified Jaya algorithm outperforms the GA technique.
References
[1] Y.G. Paithankar, and S.R. Bhide, “Fundamentals of Power System
Protection,” Prentice Hall of India Private Limited, New Delhi, 2007.
[2] A.J. Urdaneta, Nadira Ramon, and Luis G.P. Jimenez, “Optimal
Coordination of Directional Relays in Interconnected Power System,”
IEEE Trans. on Power Delivery, Vol 3, No. 3, July 1988, pp. 903-911.
[3] P. P. Bedekar, S. R. Bhide, and V. S. Kale, “Optimum coordination of
overcurrent relay timing using simplex method,, Electric Power
Components and Systems, Vol. 38, Issue 10, July 2010, pp. 1175-1193.
[4] A.J. Urdaneta, Nadira Ramon, and Luis G.P. Jimenez, “Optimal
Coordination of Directional Relays in Interconnected Power System,”
IEEE Trans. on Power Delivery, Vol 3, No. 3, pp. 903-911, July 1988.
[5] A.J. Urdaneta, H. Restrepo, S. Marquez, and J. Sanchez, “Coordination
of Directional Relay Timing using Linear Programming”, IEEE Trans.
on Power Delivery, Vol 11, pp. 122-129, Jan 1996.
[6] P. P. Bedekar, S. R. Bhide, and V. S. Kale, “Optimum time
coordination of overcurrent relays in distribution systems using Big-M
(Penalty) method,” WSEAS Transactions on Power Systems, Vol. 4,
Issue 11, 2009, pp. 341-350.
484
[7] P. P. Bedekar, S. R. Bhide, and V. S. Kale, “Optimum time
coordination of overcurrent relays using two phase simplex method,”
International Journal of Electrical and Computer Engineering (WASET),
Vol. 4, Issue 12, 2009, pp. 774-778.
[8] H.A. Abhyaneh, M. Al-Dabbagh, H.K. Karegar, S.H.H. Sadeghi, and
R.A.J. Khan, “A New Optimal Approach for Coordination of Directional
Overcurrent Relays in Interconnected Power System,” IEEE Trans. on
Power Delivery, Vol 18, pp. 430-435, April 2003.
[9] P. P. Bedekar, S. R. Bhide, and V. S. Kale, “Optimum coordination of
overcurrent relays in distribution system using genetic algorithm,” Third
International Conference on Power Systems (ICPS-2009) , Indian
Institute of Technology, Kharagpur, 27-29 December 2009, Paper ID
TS5-247.
[10] C.W. So, and K.K.Li, “Overcurrent Relay Coordination by Evolutionary
Programming,” Electric Power System Research, Vol 53, pp. 83-90,
2000.
[11] P. P. Bedekar, and S. R. Bhide, “Optimum Coordination of Overcurrent
Relay Timing Using Continuous Genetic Algorithm,” Expert Systems
with Applications, Vol. 38, Issue 9, Sept 2011, pp. 11286-11292.
[12] F. Razavi, H.A. Abyaneh., M. Al-Dabbagh, R. Mohammadi, and H.
Torkaman, “A New Comprehensive Genetic Algorithm Method for
Optimal Overcurrent Relays Coordination,” Electric Power System
Research, Vol 78, pp. 713-720, 2008.
[13] D. Birla, R.P. Maheshwari, and H.O. Gupta, “An Approach to Tackle
the Threat of Sympathy Trips in Directional Overcurrent Relay
Coordination”, IEEE Trans. on Power Delivery, Vol 22, pp. 851-858,
January 2007.
[14] A. S. Noghabi, J. Sadeh, and H. R. Mashhadi, “Considering Different
Network Topologies in Optimal Overcurrent Relay Coordination Using
a Hybrid GA”, IEEE Trans. on Power Delivery, Vol 24, pp. 1857-1863,
October 2009.
[15] P. P. Bedekar, and S. R. Bhide, “Optimum Coordination of Directional
Relays Using the Hybrid GA-NLP Approach,” IEEE Trans. on Power
Delivery, Vol 26, No. 1, January 2011, pp. 109-119.
[16] D. Birla, R.P. Maheshwari, and H.O. Gupta, “Time Overcurrent Relay
Coordination: A Review”, International Journal of Emerging Electric
Power Systems, Vol. 2, Issue 2, Article 1039, 2005.
[17] M.H. Hussain, S.R.A. Rahim, and I. Musirin, “Optimal Overcurrent
Relay Coordination – A Review,” Malaysian Technical University
Conference on Engineering and Technology, MUCET-2012, doi:
10.1016/j.proeng.2013.02.043
[18] R. Venkata Rao, “Jaya: A Simple and New Optimization Algorithm for
Solving Constrained and Unconstrained Optimization Problems,”
International Journal of Industrial Engineering Computations, Vol 7, No.
1, 2016, pp. 19-34.
[19] R. Venkata Rao, and G.G. Waghmare, “A New Optimization Algorithm
for Solving Complex Constrained Design Optimization Problems,”
Engineering Optimization, DOI: 10.1080/0305215X.2016.1164855
[20] S.A. Soman, Lectures on Power System Protection (Available-
www.cdeep.iitb.ac.in/ NPTEL online), module 5, lecture 19