See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/324601115

Optimal Coordination of Directional Overcurrent Relays using New Rooted

Tree Optimization Algorithm. International Conference on Information,
System and Convergence Applications

Conference Paper · April 2018

CITATION READS

1 232

6 authors, including:

Abdul Wadood Changhwan Kim

Yeungnam University Yeungnam University
24 PUBLICATIONS   60 CITATIONS    30 PUBLICATIONS   77 CITATIONS   

SEE PROFILE SEE PROFILE

Tahir khurshaid Lone Kumail Hassan

Yeungnam University Yeungnam University
27 PUBLICATIONS   41 CITATIONS    10 PUBLICATIONS   2 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

power system protection View project

power system deregulation View project

All content following this page was uploaded by Abdul Wadood on 19 April 2018.

The user has requested enhancement of the downloaded file.

 International Conference on Information, System and Convergence Applications
31 Jan – 2 Feb 2018, Bangkok, Thailand

Optimal Coordination of Directional Overcurrent Relays using

New Rooted Tree Optimization Algorithm

Abdul Wadood*’1, Chang-Hwan Kim*, Tahir Khurshaid*, Kumail Hassan Kharal*, Saeid Gholami
Farkoush*, Sang-Bong Rhee*’2
*Department of Electrical Engineering, Yeungnam University, Gyeongsan, South Korea
1
wadood@ynu.ac.kr
2
rrsd@yu.ac.kr

Abstract—In this paper the coordination of directional overlays in multiloop power systems is analyzed using new
rooted tree optimization algorithm, a recently designed technique inspired by the random movement of root
searching for water underground for global optimum .The coordination of directional overcurrent relays problem
are formulated as an optimization problem in power systems. The objective is to find out an optimal solution of
relays to minimize the total operating time of all the main relay for fault at the primary zone, while maintain the
coordination properly. The coordination is performed using new rooted tree optimization algorithm (RTO).The
algorithm has been developed in Matlab and tested on IEEE-8 bus system. The result obtained by the new rooted
tree algorithm are compared with other evolutionary technique. The novel aspect of this paper is the application
of the new rooted tree algorithm to the directional overcurrent relay coordination problem
Keywords- New Rooted Tree optimization; overcurrent relay coordination; Time dial setting; Pickup current
mixed integer nonlinear programming (MINLP)
I. INTRODUCTION problem [6-7]. To avert the specified complexity of
The overcurrent relay in electrical distribution MINLP method, the coordination problem is formulated
system provide primary as well as backup protection to as a linear Programming Problem in [8]. In [9-10]
keep the system healthy and reliable. These relays are a genetic algorithm were resolved to find the coordination
useful choice from technical as well as economical point problem. In [11] particle swarm optimization was
of view for industries sector in term of primary resolved for the coordination problem. The proposed
protection in sub transmission systems and back up mathematical and evolutionary method have drawback
protection in transmission system [1]. The faulty section of convergence to the value which may not be global
in power system immediately isolated with the help of optimum. This paper proposes a new algorithm that is
circuit breaker by these relays once fulfil the known as rooted tree optimization (RTO).some feature
requirements of selectivity, sensitivity and reliability of RTO could be found in [12] while the idea of these
which make coordination important for these relays [2] algorithm come into existence with movement of plant’s
The main goal of coordination issue is to assure that root searching for water at the nearest place. These
relays do not operate out of circle, avoid the irrelevant algorithm resembles with the behavior of desert plants
disconnecting of the healthy section and prevent mal where there is lacks of water resources. This work based
operation of the relays so that the system has the lowest on the instinctive behavior towards water places by
possible fault clearing time. The objective of optimal finding the best optimal solution with adapted
coordination problem is to sort out an optimum relay movement. This RTO algorithm starts searching
setting, subject to relays characteristic graphs, constrains randomly with in a set of group (group of roots).The
and limits of relays setting. In ring or multiple source evaluation of population member is based on a given
networks the overcurrent relay coordination is highly objective function which is assigned with its fitness
constrained optimization problem. [3]. generally this value. The candidate with best solutions is forwarded to
coordination problem is nonlinear programming next generation while others are neglected and
problem which can be solved by using evolutionary or reimbursed by new group of random solutions in each
metaheuristic method. Different evolutionary technique iteration/generation. However the completion of a
have been interrogated to deal the power system maximum number of cycles or generation is the stopping
problem in the technical survey [4].various approach criterion at the end of generations, the solution with best
have been published by researcher in this area for fitness value will be the desired solution. In this work
finding the optimal coordination of overcurrent relays the RTO algorithm is used for finding the optimal
and been the hot topic for several years. In addition the solution for relay coordination problem with in power
changes in network topology and configuration should system. The main aim of this paper to find the optimal
be taken into account for optimal relay setting values of time dial setting (TDS) and pickup current
[5]. The relay coordination problem is formulated as (Ipickup) in order to minimize the operating time of
 International Conference on Information, System and Convergence Applications
31 Jan – 2 Feb 2018, Bangkok, Thailand

overcurrent relays under several constraints like relay
setting and backup constraints.
II. FORMULATION OF OVERCURRENT RELAY
COORDINATION PROBLEM
In a multisource system the coordination of directional
overcurrent relay is formulated as an optimization
problem. However the coordination problem has an
objective function and constraints should satisfy the
distinct constraints.
A. Objective function
The aim of the coordination problem is to minimize the
total weighted sum of operating of primary relays while
keeping the coordination of the backup relays
accordingly. The objective function can be explained as
given.
n a new starting point for the majority of root groups to get
min z   wT
i i (1)
i 1
Where the parameter wi and Ti are the weight and
operating of the relay. For all the relays the value
wi =1 Therefore the characteristic curve for operating
relay can be selected from some of the selectable choice
of IEC standards and could be define as follow.
   are some important parameter need to be defined that
Ti  TDSi   (2)
 ( Ifi / Ipi )  1 
k
Where ∝ and k constant parameter which defined the
relay characteristic and are assumed as ∝=0.14 and
k=0.02 for normal inverse type relay. The variables TDSi
and Ipi are time dial setting and pickup current of the ith
relay while Ifi is the fault current flowing through relay
Ri.
B. Constraints
The total operating time could be minimized under two
types of constraints, including the constraints of relay
parameter and constraints coordination. The first
constraints contain the boundaries of time dial setting
(TDS) and Pick up current (Ipi), while the other
constraints is appurtenant to the coordination of primary
and secondary relays. The boundary on relay setting
parameters necessitate constraints based on the choice of
relay parameter and configuration and the limits can be
expressed as follow.
TDSimin  TDSi  TDSimax (3)
Ipimin  Ipi  Ipimax (4)
However for a reasonable security margin the pickup
current should be lower than the short circuit current and
at the same time should be greater than the highest load
current. While the other constraints is convenient for
acclimation of operating time of primary and secondary
relays. The coordination should be kept in proper way
that secondary operating time of relay should be greater
than the primary relay if the primary relay fails to clear
the fault the secondary relay should initiates its
operation by opening the circuit breaker within a certain
interval of time known as coordination time interval
(CTI) [13]. Hence the coordination constraints could
then be defined as.
Tj  Ti  CTI (5)
III. ROOTED TREE OPTIMIZATION ALGORITHM
The rooted tree optimization technique is a natural and
biological algorithm inspired by the random oriented
movement of roots which works in group for finding the
best place to get water instead of individually. To design
the algorithm, an imaginary nature of root should be
taken into consideration for their combine decision
related to wetness degree where the head of root are
located. To find one or more wetness location by the
random movement these root call other roots to
strengthen their presence around this location to become
the original place of water so this will be the optimal
solution. The roots which are far or have less wetness
degree are replaced by new roots oriented randomly.
However those roots which have a greater amount of
wetness ratio will preserve their orientation where as far
roots (solution) from water place can be replaced by
roots near the best roots of the previous generation. The
proposed algorithm starts its work by creating an initial
population randomly. However for RTO algorithm there
how roots start random movement from initial
population to new population those parameters are root
and wetness degree (wd). This two parameters can give
the suggested solution and fitness value to the rest of
population. The behavior of roots of a plant is shown in
figure 3.
Figure.3. Searching mechanism of RTO algorithm for
searching water location.
A) Root nearest to water (Rn). This root will be next in
line to those root where wetness degree is low from
previous generation. The fresh population of the
nearest root can be defined as.
((c1 * wd i * randn * l ))
x n (i, it  1)  xit b  (6)
n * it
B) Continuous Root (Rc). It is the root which have
greater wetness ratio and move forward from the
 International Conference on Information, System and Convergence Applications
31 Jan – 2 Feb 2018, Bangkok, Thailand

previous generation. The new population of the IEEE 8-bus system

random root is expressed as follow
(c2 * wd i * randn)
x n (i, it  1)  x(i, it ) 
n * it
C) Random Root (Rr). This roots spread randomly for
finding the best location of water in order to search
for maximum rate of getting the global solution. In
this step new population calculated for random root
could be expressed as
((c3 * wdi * randn * l ))
x n (i, it  1)  xr it 
it
Where it is the step of iteration, xn (I, it+1) is the fresh
member for next iteration. The best solution obtained
from the previous generation can be represented by xitb.
While the parameters c1, c2, c3 are the adjustable
parameters and n, I, l, are the population scale, member
number, and upper limit, randn is a normal random that
has range [-1, 1].and Xr are the candidate that are
randomly selected from the previous generation
IV. IMPLEMENTATION OF THE RTO ALGORITHM FOR
DOCR COORDINATION PROBLEM.
The proposed RTO algorithm is implemented in the
following step for DOCR coordination problem as
shown in flow chart
*( xb (it )  x(i, it ))
The effectiveness and the performance of the proposed
algorithm is successfully tested on IEEE- 8 bus system.
(7)
The system detail could be found [11]. This test system
consists of seven lines and 14 relays as shown in Fig. 3,
and has 28 design variables and 20 constraints. The
proposed setting for current transformer ratio of relays
(1,2,4,5,6,8,10,11,12,13 are assumed as 1200:5 and for
relays (3,7,9,14) are assumed as 800:5 The TDSs and
pickup current range continuously from 0.05 to 1.1 and
60 to 600A. The RTO parameters consider for the
(8)
mentioned case is tabulated in table I. A coordination
interval of 0.3 is considered. The short-circuit current
calculated for near-end short-circuit faults could be
found in [11]. The optimal operating time relays
achieved by the proposed algorithm is given in table II
with respect to optimal pickup current. While table III
provides the comparative result of the proposed
algorithm with previously evolutionary algorithm
explained in the literature. According to Table III, the
proposed algorithm has achieved a better solution for
the mentioned case study

Start

Real coded initialization for random population member

Set t = 1

Run the case for the first generation, form second generation
untill for the best fit

Increment the generation count

Calculate the evaluation value Wdi (fitness) of each individual
in the population using the evaluation function

Calculate the personal best candidate

Figure.3. Single line diagram of 8 bus system.

Calculate the new candidates using equation (6-8) Table 1. RTO parameters used during simulation
Parameter Values
Population size 50
No
Meet stopping criterion
No. of iteration 200
Rn 0
Rc 1
Yes
Rr 0
Display the optimal fitness value and optimal solution

Table II. Optimal TDS, For 8 Bus System.

Relay No Proposed Algorithm
Figure 2. Flow chart of RTO TDS IP
V. RESULTS AND DISCUSSION 1 0.0500 350
2 0.1857 600
The Proposed algorithm used to coordinate the DOCR
3 0.1220 400
has been verified IEEE 8-bus system and the program
4 0.0539 600
has been developed in Matlab.
5 0.0513 400
6 0.1237 300
 International Conference on Information, System and Convergence Applications
31 Jan – 2 Feb 2018, Bangkok, Thailand

7 0.1535 300 VII. REFERENCES.

8 0.1299 600 [1] Dinesh Birla, Mudra Prakash Mahesh Wari, H.O.
9 0.0553 260 Gupta, An approach to tackle the threat of sympathy
10 0.1209 400 trips in directional overcurrent relay coordination,
11 0.1279 600 IEEE Trans. Power Deliv. 22 (2) (2007) 851–858.
12 0.2422 600 [2] Blackburn J. Protective relaying, principles and
13 0.1754 250 applications. New York: Marcel Dekker Inc; 1987
14 0.1360 600 [3] N. Sahoo, S. Ganguly, D. Das, Multi-objective
Total Operating Time 5.130 planning of electrical distribution systems
incorporating sectionalizing switches and tie-lines
Table III. Comparison of the proposed method with the using particle swarm optimization, Swarm
Literature Evolutionary Comput. 3 (2012) 15–32.
Method Objective Function [4] M. Kowsalya, Optimal size and siting of multiple
Linear method [6] 11.0645 distributed generators in distribution system using
bacterial foraging optimization, Swarm Evolutionary
Nonlinear method[6] 6.41169 Comput. 15 (2014) 58–65
Genetic algorithm [10] 11.001 [5] S.K. Bhattacharya, S.K. Goswami, Distribution
Hybrid GA-LP [9] 10.9499 network reconfiguration considering protection
coordination constraints, Electric Power Compon
Seeker algorithm [7] 8.4270
Syst. 36 (11) (2008) 1150–1165
Proposed algorithm 5.130 [6] Arash Mahari, Heresh Seyedi, An analytic approach
for optimal coordination of overcurrent relays,
As it can be seen in table II and III that the proposed Gener. Transm. Distrib. IET 7 (7) (2013) 1–7.
algorithm works and perform better as compared to other [7] Turaj Amraee, Coordination of directional
evolutionary algorithm .The proposed algorithm give an overcurrent relays using seeker algorithm, IEEE
optimal solution and lower total operating time and is Trans. Power Deliv. 27 (3) (2012) 1415–1422
capable of solving directional overcurrent relay problem [8] Alberto J. Urdaneta, Harold Restrepo, Saul Marquez,
in a fast and better way. The figure 4 shows best values Jorge Sanchez, Coordination of directional
of objective function found during the course of overcurrent relay timing using linear programming,
simulation as clearly seen the RTO convergence yields a IEEE Trans. Power Deliv. 11 (1) (1996) 122–129.
fast and better solution for the objective function in less [9] Prashant Prabhakar Bedekar, Sudhir Ramkrishna
number of iteration Bhide, Optimum coordination of directional
overcurrent relays using the hybrid GA-NLP
30
approach, IEEE Trans. Power Deliv. 26 (1) (2011)
109–119
[10] Abbas Saberi Noghabi, Javad Sadeh, Habib Rajabi
20
Mashhadi, Considering different network
topologies in optimal overcurrent relay
Fitness

coordination using a hybrid GA, IEEE Trans.

15
Power Deliv. 24 (4) (2009) 1857–1863.
[11] H.H. Zeineldin, E.F. El-Saadany, M.M.A. Salama,
Optimal coordination of overcurrent relays using a
10
modified particle swarm optimization, Electric
Power Syst. Res. 76 (11) (2006) 988–995.
[12] Yacine Labbi, Djilani Ben Attous, Hossam A.
5
0 20 40 60 80 100 120 140 160 180 200
Gabbar, Belkacem Mahdad, Aboelsood Zidan, A
Generation new rooted tree optimization algorithm for
Convergence graph of RTO economic dispatch with valve-point effect, In
International Journal of Electrical Power & Energy
VI. CONCLUSION Systems, Volume 79, 2016, Pages 298-311, ISSN
This paper proposed a new rooted tree algorithm which 0142-0615
mime on the act of random movement of root’s plant [13] Abdul Wadood, Chang-Hwan Kim, Saeid Gholami
searching for the global optimum.one case study are Farkoush, Sang-Bong Rhee , An Adaptive
tested to verified the efficiency of the proposed scheme Protective Coordination Scheme for Distribution
by minimizing considerable amount of total operating System using Digital Overcurrent Relays, The
of primary relays. This scheme successfully find the Korean Institute of Illuminating and Electrical
best optimal solution for different linear and nonlinear Installation Engineers,, 2017, 53-53
model. The simulation result showed the supremacy of
the proposed algorithm over the published technique in
the literature

View publication stats