Mehran University Research Journal of Engineering and Technology

Vol. 39, No. 2, 223- 236, April 2020

p-ISSN: 0254-7821, e-ISSN: 2413-7219
DOI: 10.22581/muet1982.2002.01

The Plant Propagation Algorithm for the Optimal Operation

of Directional Over-Current Relays in Electrical
Engineering
Muhammad Sulaiman1a, Muhammad Sulaman1b, Abdelwahed Hamdi2, Zubair Hussain1c
RECEIVED ON 16.01.2019, ACCEPTED ON 03.05.2019

ABSTRACT
In modern and large scale power distribution topologies, directional relays play an important role in the
operation of an electrical system. These relays must be coordinated optimally so that their overall operating
time is reduced to a minimum. They are sensor protection devices for the power systems and must be
coordinated properly. The present work uses a metaheuristic optimization technique known as the Plant
Propagation Algorithm (PPA) in order to suggest improved solutions for the optimization problem of
coordination of directional overcurrent relays (DOCRs). We have obtained comparatively better solutions for
the overall operating times taken by relays fitted on important positions in the system. Our findings are useful
in isolating the faulty lines efficiently and in keeping the continuity of power supply. The difference in response
times taken in coordination between primary relays and corresponding backup relays is minimized. The output
of our experiments is compared with various algorithms and classical optimization techniques, which are found
in the literature. Moreover, graphical analyses are presented for each problem to further clarify the results.

KEYWORDS: Nature-Inspired Algorithms, Constraint Optimization, Sensors, Engineering Optimization

Problems, Directional over-current relays, Plant Propagation Algorithm.

1. INTRODUCTION fitted on both ends of the line. The coordination of

these devices is always a challenging optimization

P
ower systems consist of different transmission problem
systems [1], which are interconnected to other for engineers and scientists. These problems are about
sub-transmission systems. Ideal protection for to determine the specific relays to be operated for a
such transmission systems can be achieved by placing fault in that location. This selection of a set of relays
sensing devices like DOCRs in appropriate positions. is based on the topology of the network, characteristic
Furthermore, these devices must be good in terms of of relays and protection procedures.
cost and technicality. The function of DOCRs is to
separate the faulty lines in the event of any fault in the The problem of DOCRs involves two types of
system. They serve as logical units and they trip the decision variables: one for Plug Setting (PS) and the
line if a fault occurs in the neighborhood of relays other for Time Dial Setting (TDS). By finding

1
Department of Mathematics, Abdul Wali Khan University Mardan, KPK, Pakistan
Email: [email protected], (Corresponding author), [email protected],
c
[email protected]
2
Department of Mathematics, Statistics & Physics, Qatar University, Qatar.
Email: [email protected]

This is an open access article published by Mehran University of Engineering and Technology, Jamshoro under CC BY 4.0
International License.
223
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

suitable values for these variables, one can guarantee were estimated along with the minimization objective
the efficient and proper coordination of the DOCRs to function bounded by several constraints. These
maintain power supply through healthy lines and constraints were further classified as selectivity
avoid disruption. constraints and bounds on each term of the objectives.

The classical approach to solve the optimal The rest of this paper is organized such that, Section
coordination of DOCRs is the hit and trails approach 2 contains the problem complexity and our suggested
[2]. The main drawback of classical approaches was optimization technique, Section 3 presents the
slow convergence and hence an increased number of problem formulation and a detailed description of
iterations to reach the best solution. In the beginning, three case studies (IEEE 3, 4 and 6 bus models) of
Urdeneta et al. [3] implemented the optimization DOCRs problem. Section 4 reviews the basic Plant
theory to solve this problem. They modeled the Propagation Algorithm. In Section 5, results and
situation as a non-linear, non-convex objective discussion are given. Subsequently, Section 6
function subject to several design constraints. They concludes this paper by summarizing the
suggested a technique to consider the dynamic achievements and future challenges of this study.
variations in the network's structure for the
coordination of DOCRs using linear programming. A 1. PROBLEM COMPLEXITY AND
linear programming interior point algorithm is SUGGESTED ALGORITHM
proposed for the solution of the problem of
coordinating directional overcurrent relays in The coordination of relays is a highly non-linear and
interconnected power systems considering definite complex optimization problem subject to various
time backup relaying [2, 3]. constraints, with the objective to minimize the overall
operating time of each primary relay. The optimal
Yazdaninejadi et al. [4] presented a non-linear relay coordination of DOCRs leads to a multimodal/
programming approach that is tackled based on non-convex constrained optimization problem with
genetic algorithm (GA) to solve the problem of complex search space. The problem gets more difficult
minimizing the overall operating time of primary and to solve, due to nonlinearity, as the number of relays
backup relays. Moreover, many researchers have increases [12, 13, 25, 26].
suggested optimization techniques to get a better
solution of DOCRs problem, like, real coded genetic PPA is chosen to solve the above-mentioned problem
algorithm [5], Teaching Learning-Based Optimization of DOCRs. PPA was earlier implemented to design
(TLBO) algorithm [6], a multiple embedded crossover engineering problems such as gearshift problem,
PSO (Particle Swarm Optimization) [7], opposition spring design problem and welded beam problem [14-
based chaotic differential evolution algorithm [8], 24]. These problems are related to design engineering
interior point method [9], PSO-TVAC (Time Variant and the results obtained by PPA were good as
Acceleration Coefficients) based on Series compared to other state-of-the-art. So efforts were
Compensation [10], modified electromagnetic field made to check further efficiency of PPA in solving the
optimization algorithm [11], Hybridised SA-SOS problem of DOCRs.
(Simulated Annealing based Symbiotic Organism
Search) algorithm [12] and improved firefly algorithm 2. PROBLEM FORMULATION
[13].
The time taken by a relay, denoted by T, is a non-linear
In this paper, we have successfully implemented PPA function of the variables PS and TDS. The
[14-24], for the solution of standard IEEE (3, 4, and 6 mathematical formulation of operating time is given in
bus) test systems. The two types of decision variables equation (1)
.
were PS and TDS and the sum of operating times
T= (1)
taken by all main relays which were needed to operate / _
for clarity of fault(s) in their respective sections. They
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

224
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

In this equation, PS and TDS are unknown decision N2 = total number of relays involved in clearing
variables. a, b and c are based on the experiments and pri_far fault,
are predefined values for the behavior of the system. T(TDS, PS) pri_close = total time taken by primary
These values are fixed as 0.14, 0.02 and 1 respectively. relays to pri_close fault,
The current transformer CT and the number of turns it T(TDS, PS) pri_close = total time taken by primary relays
has, defines the value of CTpri_rating. To bear the to pri_far fault, where αi, βi, ηi and ξi are the constants
current, CT performs the role of reducing the level of given in Tables (5-6) and [3].
the current for relays involved. Each relay is
associated with each CT and thus CTpri_rating is a known 3.2 Constraints
value in the problem. The fault current I is
continuously read by the measuring tools and it is a 1. Limits on decision variables TDSs:
system-dependent value and is pre-assigned to it. 0.05 ≤ PS ≤ 1.1, where i ranges from 1 to Ncl.
2. Limits on decision variables PSs:
The number of constraints on the system is according 1.25 ≤ PS ≤ 1.5, where i ranges from 1 to Ncl.
to the number of lines involved in the system. These 3. Limit on primary operation times:
details are given in Table 4 for the problems 0.05 ≤ T TDS , PS #$ _ %&'( ≤ 1.0
considered in this paper. Real power systems may be 0.05 ≤ T - TDS - , PS - #$ _. $ ≤ 1.0
made up of bigger sizes involving several types of
4. Pair of relays and the selection constraints:
T #$ C $D TDS , PS − T F GH# TDS , PS + CTI ≤ 0
DOCRs [2-13].
(5)
3.1 Objective Function
where
#$ C $D 0.14 × TDS H
T TDS , PS = 0.0N
μ
The objective involved in the problem of
3 H 8 −1
coordination of DOCRs, by implementing a suitable PS × υ
optimization technique, involves the minimization (6)
of total operating times subject to constraints on the F GH# 0.14 × TDS O
T TDS , PS = 0.0N
ϕ
decision variables. Those relays which are first to be
3 Q 8 −1
operated are called primary relays. The fault, which PS × ψ
is closed to a relay, is called pri_close fault while a . (7)
fault away from the relay on the other side of the line Tprimary is operating time of primary relay and
is called pri_far fault. Thus, the objective function is Tbackup is operating time of backup relay and CTI is
a sum of operating times taken by all primary relays coordinating time interval.
involved whether the time is taken to clear a
pri_close fault or pri_far fault. Mathematically, the 3.3 Problem-1: The IEEE 3 Bus Model
objective function is presented in equation (2).
*
min ∑ ,+ T TDS , PS #$ _ %&'( + For the coordination problem of the IEEE 3-bus
∑*
-,
/
T TDS , PS
- - -
#$ _. $ (2) model, the value of each of N1 and N2 is six (equal to
the number of relays or twice the lines). Accordingly,
where
0. 1×
there are 12 decision variables (two for each relay) in
T TDS , PS #$ _ %&'( = 9.9/ (3) this problem i.e. TDS1 to TDS6 and PS1 to PS6. The
∝
3 8
56 ×7 value of CTI for Problem-1 is 0.3. Figure 1 shows the
0. 1× :
T - TDS - , PS - #$ _. $ = 9.9/ (4) 3-bus model.
<:
; : = Mathematical form of the objective function for a 3-
:
56 ×ξ
bus model is as follows:
where
N1 = total number of relays involved in clearing min ∑S, T TDS , PS #$ _ %&'( +
pri_close fault, ∑S-, T - TDS - , PS - #$ _. $ (8)

Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

225
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

3.5 Problem-3: The IEEE 6 Bus Model:

In the optimal coordination of 6-bus model, values of

both type of variables N1 and N2 is taken as 14, which
is double of total lines involved or same as the number
of relays installed in the system. This model is
illustrated in Fig.3. Furthermore, this problem is of 28
dimensions and thus involves 28 design variables. As
discussed earlier, these two types of variables are
named as TDS1- TDS14 and PS1- PS14. CTI=0.2 for
Problem-3 6-bus model. For normal operation of a 6-
bus model, a total of 48 selection constraints are
imposed on the relays in case of detecting near-end/
far-end faults in the transmission lines. Moreover, ten
Fig.1: IEEE 3-BUS MODEL
constraints are relaxed based on the observations on
[3].
3.4 Problem-2: The IEEE 4 Bus Model:
1

In the optimal coordination of 4-bus model, values of min T T TDS , PS #$ _UVWXY +

both type of variables N1 and N2 is taken as 8, which ,
is double of total lines involved or same as the number ∑Z-, T - TDS - , PS - #$ _. $ (10)
of relays installed in the system. This model is
illustrated in Fig.2. Furthermore, this problem is of 16
dimensions and thus involves 16 design variables. As
discussed earlier, these two types of variables are
named as TDS1- TDS8 and PS1- PS8. CTI=0.3 for
Problem-2.
The mathematical form for a 4-bus model is as
follows.
Z

min T T TDS , PS #$ _UVWXY +

,
∑Z-, T - TDS - , PS - #$ _. $ (9)

Fig. 3: PROBLEM-3 6-BUS

MODEL.

3. THE PLANT PROPAGATION

ALGORITHM (PPA)

PPA is a Nature-inspired metaheuristic which

simulates the way strawberry plants propagate to
Fig. 2: IEEE 4-Bus Model occupy the space in which they happen to grow. It is a
population/ multi-solutions based technique. Unlike
the single solution-based techniques like Simulated
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

226
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

Annealing (SA), it is initialized from a randomly space is done by sending a few long runners within the
generated population of solutions generated from a search space.
normal distribution. Two aspects of a metaheuristic,
The main parameters involved in PPA are the size of
exploration, and exploitation [14-24], are very
population Npop, maximum allowed generations gmax
important to be balanced.
and maximum number of runners generated by a
Exploitation means to visit the neighborhood of a
current solution very well. On the other hand, single plant nmax . The last condition of maximum
exploration is to introduce diversity in the population runners by a plant is used as stopping criteria. The
with solutions generated from approximately all over objective values are defined by the positions of plants
the domain space. XG , k = t1, … , N#&# u . The original version of PPA
A mother plant Pk is in position Xk in n dimensional is denoted by a normalized function Ni. The
space i.e. XG = [x G , xNG ⋯ , x_G ]. Let Npop denotes normalization function is used as fitness criteria. The
the number of candidate plants in the initial number of plants is calculated as in equation (11). The
population. PPA is furnished in detail as in length of a runner based on the normalized function is
Algorithm1. calculated as in equation (12). After all parent plants
in the population have generated their allocated
Require: objective a b , b ∈ de runners, new child plants are evaluated and the
Generate a population population is sorted in ascending/ descending
P = {p , i = 1, … , m} according to their fitness value. In this way, the poor
g ← 1 plants with lower growth are truncated from the
for g ← 1 to gmax do population. The number of runners allocated to a given
compute N#&# = f pi , ∀ pi ∈ P parent solution is proportional to its fitness as in
sort P in descending order of N equation (11),
create new population ∅
for each p , i = 1, … , m do {best m only} niα = nmax ×Niα , α ϵ (0,1) (11)
r ← set of runners where both the size of the set and Every solution Xi generates at least one runner and the
the distance for each runner (individually) is length/perturbation added to each such runner is
proportional to the fitness N inversely proportional to its growth as in equation
∅ ← ∅ ∪ r {append to population; death occurs by (12),
omission above}
end for dxij= 2(1 – Ni) (α – 0.5), for j = 1,…., n, (12)
P ← ∅ {new population}
where n is the problem dimension. Having calculated
end for
return P, the population of solutions.
dxi, the extent to which the runner will reach, the
search equation (13) that finds the next neighborhood
to explore is
ALGORITHM 1: PSEUDOCODE OF PLANT
PROPAGATION ALGORITHM [26]. yi,j = xi,j + ( bj – aj ) dxij, for j = 1,…., n. (13)
Two main steps followed by the strawberry algorithm
In case, the values of variables are falling outside the
are:
search domain, then those values are adjusted within
the given interval [vw , xy ] where the ends of this
i) Plants in a position with enough food will
send out many short runners.
ii) Those plants, which are situated in a position interval are defining the lower and upper bounds of a
with poor conditions, will send few long jth variable in the position vector Xk.
runners.
4. RESULTS AND DISCUSSION
It is obvious, that exploitation is implemented by using
The 3-bus model has one generator 3 transmission lines
the idea of short runners while exploration of search
and six DOCRs on these lines. A diagram showing this
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

227
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

whole model of 3-bus and a complete setup of 12 Differential Evolution (DE), Modified Differential
design variables (TDS1-TDS6 and PS1-PS6) is depicted Evolution-1 (MDE-1), Modified Differential
in Fig. 1. The 4-bus model has two generators, four Evolution-2 (MDE-2), Modified Differential
lines and eight DOCRs fixed on these lines. A diagram Evolution-3 (MDE-3), Modified Differential
showing this whole model of 4-bus and complete setup Evolution-4 (MDE-4) and Modified Differential
of 16 design variables (TDS1-TDS8 and PS1-PS8) is Evolution-5 (MDE-5) [8]. It is obvious that all the
depicted in Fig. 2. The 6-bus model has three techniques have produced either similar or
generators, seven lines, and fourteen DOCRs fixed on approximately the same objective values. On the other
these lines. A diagram showing this whole model of 6- hand, PPA solved the problem feasibly and gave better
bus and a complete setup of 28 design variables minimized objective values as in Figures 4-9. It is
(TDS1-TDS14and PS1-PS14) is depicted in Fig. 3. The interesting to note that with increasing the complexity,
best solutions found in literature, as in Tables (1-3), by PPA produced better results as compared to the 3-bus
standard algorithms are presented along with the best and 4-bus cases.
values obtained by PPA, are compared with

TABLE 1: BEST DECISION VARIABLES, OBJECTIVE VALUES, AND NUMBER OF FUNCTION

EVALUATION OF PROBLEM-1 3-BUS MODEL BY PPA
Variables PPA MDE-1 MDE-2 MDE-3 MDE-4 MDE-5 DE

TDS1 00.050 00.0500 00.050 00.050 00.050 00.050 00.050

TDS2 00.2984 00.2178 00.1979 00.1988 00.1976 00.1976 00.2194

TDS3 00.050 00.0500 00.050 00.050 00.050 00.050 00.0500

TDS4 00.1679 00.2090 00.2094 00.2090 00.2090 00.2090 00.2135

TDS5 00.1525 00.1812 00.1847 00.1812 00.1812 00.1812 00.1949

TDS6 00.1549 00.1807 00.1827 00.1807 00.1806 00.1806 00.19530

PS1 01.2500 01.2500 01.250 01.250 01.250 01.2500 01.2500

PS2 01.500 01.2500 01.4999 01.4849 01.4999 01.5000 01.2500

PS3 01.2500 01.2500 01.250 01.250 01.250 01.250 01.2500

PS4 01.500 01.4999 01.4999 01.4999 01.4999 01.500 01.4605

PS5 01.500 01.500 01.4318 01.4998 01.4999 01.500 01.2500

PS6 01.2500 01.4999 01.4619 01.4999 01.4999 01.500 01.2500

O.F.V 4.7802 4.8070 4.7873 4.7822 4.7806 4.7806 4.8422

N.F.E 3250 72350 73350 97550 69270 38250 78360

5. CONCLUSIONS model, which requires efficient algorithms to obtain a

reasonably good solution (if not the global best
Optimization problems occurring in various solution). In the present paper, we have chosen three
engineering fields often have a complex mathematical
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

228
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

test problems in electrical engineering. Specifically, MDE-5 available in the literature. It is

coordination of directional over-current relays, IEEE observed with the help of numerical results
(3, 4 and 6 bus) models are solved with a metaheuristic
and graphical solutions that the Plant
known as the Plant Propagation algorithm (PPA). The
problem of DOCRs is highly non-linear with several Propagation Algorithm (PPA) is quite
constraint variables. The results obtained are efficient for solving the complex
compared with other state-of-the-art algorithms. The optimization models that arise in Electrical
quoted results are presented along with the results of Engineering problems. Moreover, PPA is
PPA. It is obvious that PPA outperformed the gaining momentum, as the problem was getting worse
other techniques and can be potentially in terms of dimensions and complexity. In the future,
applied to higher bus problems in the future. we are intending to implement PPA for higher bus
The results are compared with six algorithms models.

DE, MDE-1, MDE-2, MDE-3, MDE-4 and

TABLE 2: BEST DESIGN VARIABLES, OBJECTIVE VALUES, AND NUMBER OF FUNCTION

EVALUATION OF 4-BUS PROBLEM BY PPA.
Variables PPA MDE-1 MDE-2 MDE-3 MDE-4 MDE-5 DE
TDS1 00.050 00.05000 00.05000 00.05000 00.0500 00.05000 00.05000
TDS2 0.2142 00.21210 00.21230 00.21210 0.21210 00.21210 00.22480
TDS3 00.050 00.05000 00.05000 00.05000 00.0500 00.05000 00.05000
TDS4 0.1514 00.15150 00.15150 00.15150 00.1515 00.15150 00.15150
TDS5 0.1251 00.12640 00.12640 00.12640 00.1262 00.12620 00.12640
TDS6 00.050 00.05000 00.05000 00.05000 00.0500 00.05000 00.05000
TDS7 0.1330 00.13380 00.13710 00.13380 00.13370 00.13370 00.13370
TDS8 00.050 00.05000 00.05000 00.05000 00.05000 00.05000 00.05000
PS1 1.2801 01.27330 01.27330 01.27330 01.25000 01.25000 01.27340
PS2 1.4127 01.49980 01.49590 01.50000 01.50000 01.5000 01.25000
PS3 1.2505 01.25000 01.25000 01.25000 01.25000 01.25000 01.25000
PS4 1.4962 01.49960 01.49970 01.49950 01.50000 01.5000 01.49970
PS5 01.500 01.50000 01.50000 01.49970 01.50000 01.5000 01.49970
PS6 1.2506 01.25000 01.25000 01.25000 01.25000 01.25000 01.25000
PS7 01.500 01.49970 01.42740 01.49950 01.49980 01.49980 01.50000
PS8 01.250 01.25000 01.25000 01.25000 01.25000 01.25000 01.25000
O.F.V 3.6549 3.6694 3.6734 3.6692 3.6674 3.6696 3.6774
N.F.E 35330 43400 67200 99700 55100 35330 95400

Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

229
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

4.86
4.8422 PPA
Best objective values
4.84
MDE-1
4.82 4.807 MDE-2
4.8 4.7873 MDE-3
4.7802 4.7822 4.7806 4.7806
4.78 MDE-4
4.76 MDE-5
4.74 DE
Algorithms

FIG. 4: BEST OBJECTIVE VALUES OBTAINED BY PPA ARE COMPARED WITH DE AND ITS
VARIANTS IN SOLVING THE 3-BUS PROBLEM OF DOCRS.
TABLE 3: BEST DECISION VARIABLES, OBJECTIVES VALUES, AND NUMBER OF FUNCTION
EVALUATION OF PROBLEM 3 6-BUS PROBLEM BY PPA.

Variables PPA MDE-1 MDE-2 MDE-3 MDE-4 MDE-5 DE

TDS1 00.1164 00.11710 00.11490 00.10340 00.11440 00.10240 00.1173
TDS2 00.1691 00.18660 00.20370 00.18630 00.18640 00.18630 00.2082
TDS3 00.0581 00.09650 00.09820 00.09610 00.09470 00.09460 00.0997
4
TDS 00.1136 00.11190 00.10360 00.11250 00.10060 00.10670 00.1125
TDS5 00.0500 00.05000 00.05000 00.05000 00.05000 00.05000 00.0500
TDS6 00.0500 00.05000 00.05000 00.05000 00.05000 00.05000 00.0580
TDS7 00.0500 00.05000 00.05000 00.05000 00.05000 00.05000 00.050
8
TDS 00.0505 00.05000 00.05000 00.05000 00.05000 00.05000 00.050
TDS9 00.0500 00.05000 00.05000 00.05000 00.05000 00.05000 00.050
TDS10 00.0500 00.07060 00.05750 00.07030 00.07010 00.05630 00.0719
TDS11 00.0656 00.06490 00.06670 00.06490 00.06490 00.06500 00.0649
TDS12 00.0522 00.06170 00.05660 00.05090 00.05090 00.05530 00.0617
TDS13 00.0573 00.05000 00.06350 00.05000 00.05000 00.05000 00.0500
TDS14 00.0824 00.08600 00.08590 00.08570 00.07090 00.07090 00.0856
1
PS 01.3032 01.25150 01.26350 01.49950 01.26020 01.49910 01.2505
PS2 01.4973 01.49590 01.29930 01.49990 01.49870 01.49990 01.2500
PS3 01.2776 01.25250 01.26220 01.25750 01.27610 01.27710 01.2512
PS4 01.2617 01.26320 01.43220 01.25080 01.49920 01.36500 01.2515
5
PS 01.2500 01.25000 01.25000 01.25000 01.25000 01.25000 01.2500

Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

230
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

PS6 01.3554 01.38220 01.38850 01.38100 01.38140 01.38180 01.2500

7
PS 01.2501 01.25000 01.25080 01.25000 01.25000 01.25000 01.2500
PS8 01.2833 01.25010 01.25000 01.25000 01.25050 01.25000 01.2500
PS9 01.2517 01.25000 01.25140 01.25000 01.25000 01.25000 01.2502
PS10 01.5000 01.25010 01.49700 01.25210 01.25000 01.49960 01.2502
11
PS 01.5000 01.49990 01.47590 01.49980 01.49990 01.49980 01.4998
PS12 01.4821 01.25290 01.47000 01.49970 01.50000 01.39310 01.2575
PS13 01.2500 01.46640 01.27280 01.46470 01.46150 01.46130 01.4805
PS14 1.3036 01.25000 01.26240 01.25400 01.49790 01.49740 01.2557
O.F.E 9.9912 10.5067 10.6238 10.4370 10.3812 10.3514 10.6272
N.F.E 18180 72960 18180 101580 100860 106200 212190

120000
Number of function evaluations

97550 PPA
100000
78360 MDE1
80000 72350 73350
69270 MDE2
60000
MDE3
38250 38250
40000 MDE4

20000 MDE5
DE
0
Algorithms

FIG. 5: NUMBER OF TOTAL FUNCTION EVALUATIONS TAKEN BY PPA, DE AND ITS VARIANTS IN
SOLVING THE 3-BUS PROBLEM OF DOCRS.

3.68 3.6774
3.6734 PPA
3.675
Best objective values

3.6694 3.6692 3.6696

3.67 3.6674 MDE-1
3.665 MDE-2
3.66 MDE-3
3.6549
3.655
MDE-4
3.65
MDE-5
3.645
3.64 DE
Algorithms
FIG. 6: BEST OBJECTIVE VALUES OBTAINED BY PPA ARE COMPARED DE AND ITS VARIANTS IN
SOLVING THE 4-BUS PROBLEM OF DOCRS.
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

231
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

100000 99700 95400

Number of function
PPA
80000

evaluations
67200 MDE-1
60000 55100 MDE-2
43400
40000 35330 35330 MDE-3
MDE-4
20000
MDE-5
0 DE
Algoritms

FIG. 7: NUMBER OF TOTAL FUNCTION EVALUATIONS TAKEN BY PPA, DE AND ITS VARIANTS IN
SOLVING THE 4-BUS PROBLEM OF DOCRS.

10.6238 10.6272
10.6
10.55 10.5067 PPA
10.5 10.437
10.45
Best objective values

10.3812
10.4 10.3514 MDE-1
10.35
10.3 MDE-2
10.25
10.2
10.15 MDE-3
10.1
10.05 9.9912
10 MDE-4
9.95
9.9
9.85 MDE-5
9.8
9.75
9.7 DE
Algorithms

FIG. 8: BEST OBJECTIVE VALUES OBTAINED BY PPA ARE COMPARED WITH DE AND ITS VARIANTS
IN SOLVING THE 6-BUS PROBLEM OF DOCRS.
220000 212190
200000
180000
160000
Number of function

PPA
140000 MDE-1
120000 101580 100860 106200 MDE-2
100000
evaluations

72960 MDE-3
80000
60000 MDE-4
40000 MDE-5
18180 18180
20000 DE
0
Algirithms

FIG.9: NUMBER OF TOTAL FUNCTION EVALUATIONS TAKEN BY PPA, DE AND ITS VARIANTS IN
SOLVING THE 6-BUS PROBLEM OF DOCRS.

ACKNOWLEDGMENT
CONFLICT OF INTEREST
This research was supported by the Department of
The authors declare that none of them have any Mathematics, Abdul Wali Khan University Mardan,
competing interests in the manuscript. Pakistan.
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

232
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

NOMENCLATURE Transactions on Power Delivery, Vol. 12, No.

4, pp. 1458-1464, 1997.
a, b, c Constants according to IEEE
standard [4] Yazdaninejadi A., Nazarpour D., and
CT Current Transformer Golshannavaz S., "Dual-Setting Directional
CTpri−rating Primary rating of current
transformer Over-Current Relays: An Optimal
CTI Coordination time interval. Coordination in Multiple Source Meshed
DE Differential Evolution
DOCR Directional over-current relays Distribution Networks", International Journal
MDE Modified Differential Evolution of Electrical Power and Energy Systems, Vol.
NFE Number of function evaluations
OFV Objective function value 86, pp. 163-176, 2017.
[5] Thakur M., and Kumar A., "Optimal
PS Plug settings
Tbackup Operating time of backup relay coordination of directional over current relays
Tpri_close The relay operation time to clear using a modified real coded genetic
near end fault
Tpri_far The relay operation time in case of algorithm: A comparative study",
far end fault International Journal of Electrical Power and
Tprimary Operating time of primary relay
TDS Time dial settings Energy Systems, Vol. 82, pp. 484-495, 2016.
NFE Number of function evaluation [7] Singh, M., Panigrahi B.K., and Abhyankar
A.R., "Optimal coordination of directional
REFERENCES: over-current relays using Teaching Learning-
Based Optimization (TLBO) algorithm",
[1] Shaikh S.H., Malik T.N., “Short term International Journal of Electrical Power and
economic emission power scheduling of Energy Systems, Vol. 50, pp. 33-41, 2013.
hydrothermal energy systems using improved [8] Farzinfar M., Jazaeri M., and Razavi F., "A
water cycle algorithm”, Mehran University new approach for optimal coordination of
Research Journal of Engineering and distance and directional over-current relays
Technology. Vol. 36, No. 2, pp. 255, 2017. using multiple embedded crossover PSO",
[2] Urdaneta A.J., Perez L.G., Gomez J.F., International Journal of Electrical Power and
Feijoo, B. and Gonzalez, M., "Presolve Energy Systems, Vol. 61, pp. 620-628, 2014.
analysis and interior point solutions of the [9] Chelliah T.R., Thangaraj R., Allamsetty S.,
linear programming coordination problem of and Pant, M., "Coordination of directional
directional overcurrent relays", International overcurrent relays using opposition based
Journal of Electrical Power and Energy chaotic differential evolution algorithm",
Systems, Vol. 23, No. 8, pp. 819-825, 2001. International Journal of Electrical Power and
[3] Urdaneta A.J., Perez L.G., and Restrepo H., Energy Systems, Vol. 55, pp. 341-350, 2014.
"Optimal Coordination of Directional [10] Mancer N., Mahdad B., and Srairi K.,
Overcurrent Relays Considering Dynamic "Optimal Coordination of Directional
Changes in the Network Topology", IEEE Overcurrent Relays Using PSO-TVAC
Considering Series Compensation",
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

233
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

Advances in Electrical and Electronic [17] Merrikh-Bayat F., "The runner-root

Engineering, Vol. 13, No 2, pp. 96-106, 2015. algorithm: a metaheuristic for solving
[11] Mancer N., Mahdad B., and Srairi K., unimodal and multimodal optimization
"Optimal Coordination of Directional problems inspired by runners and roots of
Overcurrent Relays Using PSO-TVAC plants in nature", Applied Soft Computing,
Considering Series Compensation", Vol. 33, pp. 292-303, 2015.
Advances in Electrical and Electronic [18] Sulaiman M., Salhi A., and Fraga E.S., "The
Engineering, Vol. 13, No 2, pp. 96-106, 2015. plant propagation algorithm: modifications
[12] Bouchekara H., Zellagui M., and Abido and implementation", Science International
M.A., "Optimal coordination of directional (Lahore), Volume 28, No 1, pp. 201-209,
overcurrent relays using a modified 2015.
electromagnetic field optimization [19] Sulaiman M., Salhi A., Khan A., Muhammad
algorithm", Applied Soft Computing, Vol. 54, S. and Khan W., "On the Theoretical Analysis
pp. 267-283, 2017. of the Plant Propagation Algorithms",
[13] Sulaiman M., Ahmad A., Khan A. and Mathematical Problems in Engineering, Vol.
Muhammad S., "Hybridized Symbiotic 2018, pp. 8, 2018.
Organism Search Algorithm for the Optimal [20] Sulaiman M., Salhi A., Selamoglu B.I. and
Operation of Directional Overcurrent Kirikchi, O.B., "A plant propagation
Relays", Complexity, Vol. 2018, pp. 11, 2018. algorithm for constrained engineering
[14] Sulaiman M., Waseem W., Muhammad S., optimisation problems", Mathematical
and Khan A., “Improved Solutions for the Problems in Engineering, Vol. 2014, pp. 10,
Optimal Coordination of DOCRs Using 2014.
Firefly Algorithm”, Complexity, Vol. 2018, [21] Bozorg-Haddad O., Solgi M. and Loaiciga
pp. 15, 2018. H.A., Meta-heuristic and evolutionary
[15] Selamoğlu B.I., Salhi A., and Sulaiman M., algorithms for engineering optimization, John
"Strip Algorithms as an Efficient Way to Wiley & Sons, Vol. 294, pp. 223-230, 2017.
Initialise Population-Based Metaheuristics", [22] Sulaiman M. and Salhi A., "A hybridisation of
In Recent Developments in Metaheuristics, runner-based and seed-based plant
Springer, pp. 319-331, 2018. propagation algorithms", Nature-Inspired
[16] Salhi, A. and E.S. Fraga, "Nature-inspired Computation in Engineering, Springer, Vol.
optimisation approaches and the new plant 2016, pp. 195-215, 2016.
propagation algorithm", In: Proceedings of [23] Sulaiman M. and Salhi A., "A seed-based
the The International Conference on plant propagation algorithm: the feeding
Numerical Analysis and Optimization station model", The Scientific World Journal,
(ICeMATH’11), Yogyakarta, Indonesia, Vol. 2015, pp. 19, 2015.
2011. [24] Selamoğlu B.İ., Salhi A. “The Plant
Propagation Algorithm for Discrete
Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

234
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

ptimization: The Case of the Travelling [26] Hamdi A. and Mahey P., "Separable
Salesman Problem”, In: Yang XS. (eds) diagonalized multiplier method for
Nature-Inspired Computation in Engineering. decomposing nonlinear programs",
Studies in Computational Intelligence, Computational and Applied Mathematics,
Springer, Cham, Vol. 637, pp 43-61, 2016. Vol. 19, No 1, pp. 1-29, 2000.
[25] Ramson S.J., Raju K.L., Vishnu, S. and [27] Hamdi, A., "Two-level primal–dual proximal
Anagnostopoulos T.,. “Nature Inspired decomposition technique to solve large scale
Optimization Techniques for Image optimization problems", Applied
Processing—A Short Review”, Nature Mathematics and Computation, Vol. 160, No
Inspired Optimization Techniques for Image 3, pp. 921-938, 2005.
Processing Applications, Springer, Cham,
Vol. 2019, pp. 113-145, 2019.

APPENDICES

TABLE 4: PARAMETER SETTINGS OF THREE CASE STUDIES IN DOCRs PROBLEMS.

Items IEEE 3-bus IEEE 4-bus IEEE 6-bus
No. of Lines 3 4 7
No. of DOCRs 6 8 14
No. of Decision Variables 12 16 28
No. of Selectivity Constraints 8 9 38
No. of Restricted Constraints 24 32 104

Table 5: VALUES FOR CURRENT TRANSFORMER AND CURRENT.

z{|w_}~•€• z{|w_‚ƒ|
w

z„… w †‡w ˆz{|w_|ƒ‰weŠ

w
z„…y y
†‡
y
ˆz{|w_|ƒ‰weŠ

z„… 9.46 2.06 z„… N 100.63 2.06

z„… N 26.91 2.06 z„… 14.08 2.06
z„… ‹ 8.81 2.23 z„… 1 136.23 2.23
z„… 1 37.68 2.23 z„… ‹ 12.07 2.23
z„… Œ 17.93 0.8 z„… S 19.2 0.8
z„… S 14.35 0.8 z„… • 25.9 0.8

Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

235
 The Plant Propagation Algorithm for the Optimal Operation of Directional Over-Current Relays in Electrical Engineering

TABLE 6: CURRENT TRANSFORMER RATING AND DIFFERENT TIME SETTINGS OF BACKUP

AND PRIMARY RELAYS.
zŽƒ}‡•{
w
z{|w•ƒ|‘
w

’ †‡w ˆz{|w_|ƒ‰weŠ
w “ y
†‡
y
ˆz{|w_|ƒ‰weŠ
5 14.08 0.8 1 14.08 2.06
6 12.07 0.8 3 12.07 2.23
4 25.9 2.23 5 25.9 0.8
2 14.35 0.8 6 14.35 2.06
5 9.46 0.8 1 9.46 2.06
6 8.81 0.8 3 8.81 2.23
2 19.2 2.06 6 19.2 0.8
4 17.93 2.23 5 17.93 0.8

Mehran University Research Journal of Engineering and Technology, Vol. 39, No. 2, April 2020 [p-ISSN: 0254-7821, e-ISSN: 2413-7219]

236