Optimal Overcurrent Relays Coordination using

Genetic Algorithm
A.Koochaki*, M.R.Asadi**, M.Mahmoodan**, R.A.Naghizadeh**
*Islamic Azad University, Aliabad-Katool, Iran
**Amirkabir University of Technology, Tehran, Iran
Abstract For optimal co-ordination of Overcurrent (OC)
relays, linear programming techniques such as simplex, twophase simplex and dual simplex are used. Another way of
optimal coordination program is using artificial intelligent
system such as genetic algorithm (GA). In this paper a new
approach will be used for optimal coordination of OC relays
based on genetic algorithm. In this work we take into
account both time setting multiplier (TSM) and plug setting
multiplier (PSM) of OC relays in optimization procedure.
Most OC relays accept only discrete values as TSM and
PSM, and you should change your final answers to discrete
form and this may corrupt the optimization. In this paper
the act of quantizing the answers is taken into account as a
part of optimization procedure, so the outputs are optimized
discrete TSMs and PSMs. In other words the novelty of
the paper is taking into account the PSM in addition to TSM
to handle miscoordination problems both for continues and
discrete TSM and PSM. The results obtained are quite
encouraging and will be useful as an effective tool for
coordination OC relays.
Index Terms Overcurrent relays (OC), Time setting
multiplier (TSM), Plug setting multiplier (PSM), Optimal
Coordination

I. INTRODUCTION
During the operation of a modern interconnected
Power system, abnormal conditions (faults, overload,
over-voltage, under-frequency, etc.) can frequently occur.
Such conditions cause interruption of the supply, and
may damage the equipments connected to the system,
arising the importance of designing a reliable protective
system. In order to achieve such reliability, a back-up
protective scheme is provided to act as the second line of
defense in case of any failure in the primary protection
(the first line of defense). To insure reliability of the
protective system, the back-up scheme shouldnt come in
to action unless the primary (main) fails to take the
appropriate action. In other words, it should operate after
a certain time delay known as coordination time interval
(CTI), giving the chance for the primary protection to
operate. The fore mentioned situation leads to the
formulation of the well-known protective relay setting
coordination, that consists of the selection of a suitable
setting of each relay such that their fundamental
protective function is met under the desirable qualities of
protective relaying, namely sensitivity, selectivity,
reliability, and speed[1].
Intelligent optimization techniques such as GA have
come up which can adjust the settings of relays. In these
methods the constraints are included as part of Objective
Function (OF). Some developed a method based on GA
for optimal coordination. This method has two problems.

One of them is miscoordination and another is discrete

TSM and PSM.
In [2] a new problem formulation is proposed to calculate the
optimal relay settings of directional overcurrent relays in power
systems. The proposed coordination problem is formulated as a
mixed integer nonlinear problem to take into account the
discrete values for the pickup current settings. A modified
particle swarm optimization (PSO) algorithm is proposed to
calculate the optimal relay settings.
A novel optimization technique based on evolutionary
programming for overcurrent relay coordination in ring fed
distribution networks is presented in [3]. Evolutionary
programming is a stochastic multi-point searching optimization
algorithm and is capable of escape from local optimum
problems. The pre-processing reduction constraints method
introduced in [4] reduce the number of constraints and detect
those that make the optimization of overcurrent relay settings to
be infeasible.
The problem of setting directional OC relays has been stated
and solved as a linear programming (LP) problem in [5]. To
deal with such constraints a modification to the standard PSO
algorithm is introduced. [6] describes the grading coordination
of OC relays with normal IDMTL (inverse definite minimum
time lag) characteristic complying with the IEC 255-4
standards.

A new approach for optimal coordination of directional

OC relays is proposed in [7]. In this approach, optimal
operation characteristic and also optimal current setting
and time setting of OC relays will be determined
simultaneously.
In this paper, the existing GA is improved by using a
new expression to the OF which already exists in the
mentioned literature, such that the miscoordination
problems are solved, more detail about OF is available in
[9].
For continuous TSM and PSM method, the solution
finds the relays optimal settings based on continuous
consideration of TSMs [3,6,11]. However, if TSMs and
PSMs of the relays are discrete; the final computer
output of the coordination program for each relay is
rounded to the next upper allowable discrete value of the
relevant relay [12,13]. This method is not accurate,
because this process may disturb coordination. This is
because if both TSMs of a pair of P/B relays (Main
relay- Backup relay) are rounded and the calculated result
of the computer program for a primary relay is far from
the next allowable discrete value of TSM and the TSM of
the backup is very close to the existing value on the relay,
then it is more probable that miscoordination occurs.
Such problem may occur by rounding the PSM.
For discrete TSM and PSM method, the results of the

computer program are discrete directly. In these methods

TSMs and PSMs are considered to be discrete
inherently. In other words, each TSM and PSM is shown
by a binary code [6]. Using binary code for continuous
TSMs and PSMs make many binary numbers which is
obviously difficult to carry out the mathematical
calculation even with the new advanced computers.
Therefore, almost there is no solution for the relays
inherently their TSM and PSM are continuous.
Also the new algorithm can handle both continues and
discrete TSMs and PSMs.
II. OC RELAYS COORDINATION CONSTRAINTS
As what has expressed in [8] in order to coordinate two
over current relay, one as main relay (m) and the other as
back up relay (b), as shown in figure 1, the difference
between the operation time of back up relay and the
operation time of main relay for faults F1 and F2 should
be more than CTI. F1 and F2 are short circuits at near bus
and far bus of main relay respectively. CTI is the time
interval for coordination of main and backup relay.

Fig. 2. Flow diagram of GA application to relay coordination.

Fig. 1. Coordination constraint of OC relays.

So the constraint for coordination of OC relays b and m

will be in the form of inequalities 1 and 2:

t mb = tb ( F1 ) t m ( F1 ) CTI > 0

(1)

t mb = tb ( F2 ) t m ( F2 ) CTI > 0

(2)

where the following notations have been used:

CTI is the coordination time interval and is taken to be
0.4 s;
tb (F1) and tm (F1) are respectively the operation time of
backup and main relay for a short circuit in F1;

tb(F2) and tm(F2) are respectively the operation time of

backup and main relay for a short circuit in F2 .

For optimal coordination of power system relays, at
first, it is essential to form the coordination constraints of
all main and backup relays. Then the parameters of relays
should be set such that for the least operation time of OC
relays, all the constraints be satisfied.
Review of GA to Relay Coordination Application
A.
To give a better understanding, this section is
devoted to the review of the notation and concept of GA
application to overcurrent relays coordination as
presented in [3]. The flow diagram of the GA as applied
to relay coordination is shown in Fig. 2. The description
of the flow diagram is given below.

B.
Initialization. The first Parents chromosome
pool should be generated by creating several sets of relay
settings randomly such that all sets of the relay settings
totally satisfy all the constraints. Each set of relays setting
is packed into a chromosome. The key variable in the GA
is the chromosome and it consists of all relay TSMs and
PSMs. The number of TSMs and PSMs sets is referred
as the population size. After each iteration, the new
TSMs and PSMs belong to relays R1 to Rn are given to
the algorithm. G is the counter of generation and initially
is set to 1. Then the procedure of part BE of this section
is done. After that, the value of G is increased by one and
the procedure is repeated. When the value of G becomes
equal to the generation size the process is terminated.
C.
Evaluation. To evaluate the goodness of each
chromosome regarding the user preferences on the relay
grading method, the OF value and the other variables
related to it are evaluated.
D.
Selection. According to the calculated OF values
of Parents at each generation, some parents are more
distinct than others. Based on a concept called elitism,
those parents who have more optimal OF values in the
Parents chromosome pool, should be granted more
opportunities to survive, so that they can generate more
offsprings. The roulette wheel selection could then be
used with this enhanced selection list. In this part of the
flowchart, the minimum value of OF in each stage is
chosen.
E.
Reproduction and mutation. The reproduction is

responsible for producing offsprings by the genetic operation crossover and mutation. Checking and evaluating of
each new offspring satisfaction is required in order to
form the Children chromosome pool. The offspring
may be improved by making some favorable change in
crossovers and mutations. Mutation sometime introduces
new genetic material into a heterogeneous population, but
may introduce bad chromosomes. The probability of
permutation should not be overemphasized. Moreover, all
the mutated offsprings must be tested for constraint
satisfaction and those that failed are eliminated. The new
offsprings indicate the TSMs and PSMs of relays. I is
the counter of population and similar to G is counted until
the population size.
F.
Selection from Children and Parents for
the next generation. It is common in optimization
methods to find that the OF value is extremely sensitive
to one parameter, whilst large changes are still needed in
another parameter to cause significant changes. GA also
suffers from the same problem. To deal with such
inequities, the pre-scaling technique is employed. The OF
value of each chromosome, i.e. a set of relays TSMs and
PSMs of the Parents will be converted to a raw fitness,
and then to a scaled fitness and finally to the expected
frequency of selection as a parent.
G.
Finishing. The process will be finished after a
fixed number of generations. Due to the fact that
improvement may not come out quickly, more
generations are preferable. This will improve the
chromosome pool and will prepare better genetic material
for future generations. The required number of
generations varies from system to system depending on
the system complexity and the size of population.
III. PROPOSED APPROACH
Three parameters have to be determined in order to set
and coordinate overcurrent relays:
A. Discrete and continuous TSM and PSM
As described in Section I, the existing method has
solution for either discrete or continuous. In the
newmethod, a procedure is made to take into account
both discrete and continuous TSMs and PSMs. Both the
traditional and optimal GA coordination methods find the
optimal results by arranging many iterations.
However, the idea of the new method for discrete
values of TSMs and PSMs is to solve the problem by
considering that TSMs and PSMs are continuous,
initially. But, after the completion of each iteration and
before starting the evaluation part of the flowchart, the
obtained TSMs and PSMs are rounded to the next
allowable discrete value marked on the relays. In other
word, at each stage of OF computation, the values of
TSMs and PSMs which vary continuously inverted to
next allowable discrete values. That means the optimal
OF for rounded TSMs and PSMs which solves
inherently miscoordination is automatically selected.
Of course for relays with continuous TSMs and
PSMs, the inversion of TSM and PSM to discrete values
is not made. This is because the output results already

exist on the relays.

B. Plug setting multiplier
PSM is the parameter that should be set on OC relays.
This parameter that is determined according to Ipickup ,
should be set such that the relay do not operate for the
maximum load current but operate for the minimum short
circuit current.
C. Time setting multiplier
TSM is the other parameter for OC relays coordination. This parameter should be set such that for the
minimum TSM value, sufficient time interval between
main and backup relay is provided.
In this paper, both TSMs and PSMs have been
determined using genetic algorithm. Genetic algorithm as
mentioned in Section III uses random number (gen) for
each of variables.
A chromosome is a set of random numbers produced
for all of variables. Therefore each chromosome is a
solution of problem. In genetic algorithm, a set of
chromosomes is provided and then they will be graded
using an objective function. Then a number of them will
be selected, which are called the first generation.
After producing the first generation, we can use
operators such as transposition and mutation to produce
the next generation and finally finding an optimal
solution.
In this paper, each chromosome contains TSMs and
PSMs of overcurrent relays. The objective function used
for grading of chromosomes is defined as Eq.(3) [9]:

]2

OF = 1(ti )2 + 2 tmb 2 (tmb tmb )

(3)

where the following notations have been used:

t mb is the operation time difference for each relays
pair, ti the i-th relay operating time for a fault close to
the circuit breaker (CB) of the i-th relay;
tm and tb are the operating times of the main and
backup relays for a fault exactly close to the CB of the
i-th relay.
CTI is the coordination time interval and is taken to be
0.4 s.
2 is the new parameter to consider the
miscoordination.
1 is used to control the weighting of
used to control the weighting of

(t )

(t

and 2 is

mb

) .

This is shown in Fig. 3.

To describe the role of the new expression, we
consider t mb to be positive, then the relative expression

[tmb 2 (tmb tmb )] will

be equal to t mb , i.e.

exactly the previous equation, however if t mb is

negative the mentioned expression will be:

[tmb 2 (tmb tmb )] = (1+ 2 2 )(tmb )

(4)

3
2
t
= 1 +
+
+
1
TSM
(M 1) (M 1)2
5
4
+
+
3
(M 1) (M 1)4

(5)

where the following notations have been used:

Fig. 3. Flowchart of the proposed approach

Clearly for positive values of 2, the value of Eq. (4) is

greater than in the previous case. The evaluation part of
GA computes the relevant OF. Then based on a concept
of the evaluation and selection parts of GA, those values
who have more optimal OF values (less values) in the
chromosome, are granted more opportunities to survive.
So that the values with less optimal OF values (high
values), i.e. the values of Eq. (4) are not selected.
Therefore, the TSM or TDS set belongs to miscoordination which produces large OF is not chosen. Finally,
the output results contain no miscoordination or only the
inherently miscoordination which network configuration
has imposed to the protection system and hence there is
no way to get rid of it.
The suitable value of 2 is determined by applying the
trial and error procedure. In other words, although by
increasing 2 miscoordinations are decreased, but the
relays operating times are increased. Therefore, the
suitable 2 is fit to a value by which the miscoordinations
are omitted. It should be noted that for finding the relays
operating times, a more common formula for approximating the relay characteristics is used [4]:

M is the ratio of relay current to the pickup current,

I
M = sc , where Ib is relay setting and Isc is short
Ib
circuit current;
1, , 5 are the scalar quantities which characterize
the particular device being simulated;
t is the relay operating time.
As described in Section IV.A, the existing method has
solution for either discrete or continuous. In the new
method, a procedure is made to take into account both
discrete and continuous TSM and PSM. Both the
traditional and optimal GA coordination methods find the
optimal results by arranging much iteration. However, the
idea of the new method for discrete values of TSMs and
PSMs is to solve the problem by considering that TSMs
and PSMs are continuous, initially.
But, after the completion of each iteration and before
starting the evaluation part of the flowchart, the obtained
TSMs and PSMs are rounded to the next allowable
discrete value marked on the relays. In other words, at
each stage of OF computation, the values of TSMs and
PSMs which vary continuously inverted to next
allowable discrete values. That means the optimal OF for
rounded TSMs and PSMs which solves inherently
miscoordination is automatically selected. Of course for
relays with continuous TSM and PSM, the inversion of
TSM and PSM to discrete values is not made. This is
because the output results already exist on the relays.

IV. RESULTS OF PROPOSED APPROACH ON A CASE STUDY

The proposed approach has been tested on a network
shown in figure 4. This network contains 8 busbars, 1
generator, 8 lines, 1 transformer and 8 overcurrent relays.
The information data of the network are shown in
appendix A. Table III illustrates optimal PSM and TSM
of each relay of the case study system.
By applying the GA with selected values, the output
results for TSMs and PSMs are obtained. Four different
cases have been considered [9].
TABLE I
PRIMARY/BACKUP INFORMATION
Main relay

Backup
relay

Primary relay
shortcircuit
current

Backup relay
current

524.2

524.2

507.7

507.7

567.0

567.0

608.3

277.7

339.9

339.9

608.3

330.8

TABLE II
GENETIC ALGORITHM PARAMETERS
Number of generations

300

Size of population

100

Initial population
Mutation

Random
10

Case 1 and 2 belong to the new GA method and Case 3 is

for the traditional GA method. In Case 4 OF of the new
method is applied, but the way of using TSM and PSM is
traditional. To make the comparison of the different cases
easily, the operating times of the relays as well as TSMs
and PSMs are included in Table III.

new OF and inversion of TSMs to the next allowable

discrete values on the relays after each stage with suitable
parameters of 1, 2 and 2 have been considered as the
successful method. Consideration of PSMs in
optimization process has lead to better TSMs in compare
to those obtained in [9].
IV. CONCLUSION
Optimal coordination of OC is presented in this work
using Genetic Algorithm (GA), this method can
determine optimal operation current setting multiplier
(PSM) and time setting multiplier (TSM) of OC relays
simultaneously. Moreover In the proposed method, the
special OF is used. The picked OF is capable to solve the
problems as discrete and continuous TSMS and PSMS
as well as being able to handle the miscoordination
problem. The computer program has been tested on
sample network .Increase of coordination and the
operation speed of relays, finding the absolute optimal
point, not being trapped in a local optimal point, the
ability to be applied on large networks.
REFERENCES
[1]

Fig. 4. Case study system.

In third column of Table III (Case 2), 1 is considered

to be greater than in Case 1 and 2 and 2 less than in the
previous case. In other words, more weight is given to the
summation of the relays operating times and less weight
for t . In this case, decrement of the summation of the
relay operating times is expected. Comparison between
the information of columns 2 and 3 shows that, the
TSMs of both cases are approximately the same.
However, although the operating times of the relays are
either lower or equal to the previous case, three
miscoordinations are noticed.
In the forth column of the output (Case 3) because 2
is taken into account to be zero, the traditional GA is
considered. This time, 6 miscoordinations were found.
In the fifth column, i.e. (Case 4) of Table 3, the new
GA method is applied with continuous consideration of
TSMs. In this case although the new OF is used but
during the whole process, the TSMs are kept continuous
and after all results have been obtained, they are rounded
to the next upper discrete values of TSMs. Here, also 2
miscoordinations were found. Therefore, it can be stated
that to prevent miscoordination for networks with discrete
relays, both new OF and new discrete TSMs
consideration, the solution must be taken into account.
From, the whole computer output, it can be concluded
that Case 1 in which the full new procedure including

P. M. Anderson, Power System Protection. New York: McGrawHill, 1999.

[2] H. H. B. Zeineldin. E. F.El-Saadany, M.M.A.Salama ,Optimal
coordination of overcurrent relays using a modified particle swarm
optimization, Electr. Power Res. 76 (January (24)) (2006)
(Elsevier).
[3] C.W. So, K.K. Li ,Overcurrent relay coordination evolutionary
programming,, Electr. Power Res . 53 ((2000) (Elsevier).
[4] H.K. Kargar, H.A. Abyaneh, V. Ohis, M. Meshkin, Preprocessing of the optimal coordination of overcurrent relays,
Electr. Power Res. 75 (June(23)) (2005) (Elsevier). Mohamed M.
Mansour, Member, IEEE, Said F. Mekhamer, and Nehad El-Sherif
El-Kharbawe, Student Member, IEEE., A Modified Particle
Swarm Optimizer for the Coordination of Directional Overcurrent
Relays , IEEE Trans. Power Deliv. VOL. 22, NO. 3, JULY 2007.
[5] C.W. So, K.K. Li, K.T. Lai, K.Y. Fung, Application of genetic
algorithm for overcurrent relay coordination, in: Proc. 1997 IEE
Conf. Developments in Power System Protection , 1997, pp. 66
69.
[6] F. Kavehnia , H. Seifi , H. Keivani , M.R. Askari, Optimal
Coordination of Directional Over Current Relays in Power System
Using Genetic Algorithm , in: Proc. UPEC Conf., 2006, pp. 824827.
[7] H.A.Abyaneh, M.Al-Dabbagh, H.Karegar, "A New Optimal
Approach for Coordination of Overcurrent system. Relays in
Interconnected Power Systems", IEEE Transaction on Power
Delivery, Vol. 18, No. 2, April 2003, PP. 430-435
[8] Farzad Razavi, Hossein Askarian Abyaneha, Majid Al-Dabbagh,
Reza Mohammadia, Hossein Torkaman, A new comprehensive
genetic algorithm method for optimal overcurrent relays
coordination, Electr. Power Res. 76 (January (24)) (2006)
(Elsevier). In Press, Corrected Proof, Available online 29 June
2007
[9] C.W. So, K.K. Li, Time coordination method for power system
protection by evolutionary algorithm, IEEE Trans. Ind. Appl. 36
(SeptemberOctober (5)) (2000) 12351240.
[10] C.W. So, K.K. Li, Intelligent method for protection coordination,
in: IEEE International Conference Of Electric Utility Deregulation
Restructuring and Power Technology, Hong Kong, April, 2004.
[11] B. Chattopadhyay, M.S. Sachdev, T.S. Sidhu, An on-line relay
coordination algorithm for adaptive protection using linear
programming technique, IEEE Trans. Power Deliv. 11 (January)
(1996) 165173.
[12] H.A. Abyaneh, R. Keyhani, Optimal co-ordination of overcurrent
relays in power system by dual simplex method, in: Proc. 1995
AUPEC Conf., vol. 3, Perth, Australia, 1995, pp. 440445

TABLE III
GENETIC ALGORITHM OUTPUT
Cases
Case 3: 1 = 1;
2 = 2; 2 = 0

Case 1: 1 = 1;
2 = 2; 2 = 100

Case 2: 1 = 20;
2 = 1; 2 = 10

Generation

400

400

1000

1000

TSM1

0.25
0.3
0.3
0.15

0.2
0.25
0.25
0.1

0.25
0.2
0.25
0.2

0.25
0.3
0.3
0.15

TSM2
TSM3
TSM4
TSM5

Case 4: 1 = 1;
2 = 2; 2 = 100

0.05

0.05

0.1

0.05

TSM6
TSM7
TSM8

0.15
0.15
0.05

0.15
0.15
0.05

0.1
0.15
0.05

0.15
0.15
0.05

PSM1
PSM2
PSM3
PSM4
PSM5
PSM6
PSM7
PSM8

%125
%125
%100
%100
%100
%125
%100
%100

%125
%125
%100
%125
%100
%100
%100
%100

%125
%100
%100
%100
%100
%125
%100
%125

%125
%125
%100
%100
%100
%125
%100
%100

t 41

0.0811

-0.0400

-0.2556

-0.0400

t 62

0.0379

+0.0211

-0.4000

+0.0211

t 73

0.0812

+0.0612

-0.2593

-0.1112

t 86

0.1462

-0.0119

-0.3935

+0.1211

t 54

0.0412

+0.0411

-0.2273

+0.1988

t 87

0.1518

-0.0111

-0.2092

+0.1438

OF value

2.6876

44.6186

2.4676

2.6876

APPENDIX
TEST SYSTEM DATA.

GENERATOR INFORMATION

LINE INFORMATION
Line

R (pu)

X (pu)

V (kV)

0.40

0.20

10

0.28

0.19

10

0.24

0.13

10

0.38

0.19

10

0.40

0.23

10

.030

0.17

10

0.26

0.15

10

0.50

0.22

10

Generator

R (pu)

X (pu)

V (kV)

0.10

0.30

10

TRANSFORMER INFORMATION
Transformer

R (pu)

X (pu)

0.01

0.03

CT PRIMARY CURRENTS
Relay

CT primary
current [A]

Relay

CT primary
current [A]

75

75

50

50

75

75

75

125