Sustainability 14 02761 v2
Sustainability 14 02761 v2
Sustainability 14 02761 v2
Article
Over-Current Relays Coordination Including Practical
Constraints and DGs: Damage Curves, Inrush, and Starting
Currents
Abdelmonem Draz , Mahmoud M. Elkholy * and Attia El-Fergany
Electrical Power and Machines Department, Faculty of Engineering, Zagazig University, Zagazig 44519, Egypt;
aaderaz@zu.edu.eg (A.D.); el_fergany@zu.edu.eg (A.E.-F.)
* Correspondence: melkholy@zu.edu.eg or melkholy71@yahoo.com
Abstract: In this paper, an integrated optimization model based on Gradient-Based Optimizer (GBO)
for overcurrent relays coordination along with the challenging practical constraints is proposed.
The current proposed effort aims to facilitate the coordination strategy and minimize the technical
problems facing the protection/site engineers. The objective function is adapted to minimize the
total operating time of the primary relays (TOT) concurrently with satisfying a set of constraints.
The algorithm endeavors to fine-tune the relay tripping curve to avoid the false tripping in the case
of motor starting and/or transformer inrush conditions. Bear in mind that the selected optimized
settings should guarantee that the relay would operate in less time than the thermal withstand
capability time of the protected equipment. The proposed model is examined over the distribution
portion of the Qarun petroleum isolated network (located in West desert/Egypt), which presents a
practical test case including some scenarios after validating its performance with the IEEE 15-bus
network. The proposed complicated optimization problem comprises 128 discrepant inequality
constraints for overcurrent relays coordination only having 16 relays with 14 relay pairs. Eventually,
Citation: Draz, A.; Elkholy, M.M.; GBO demonstrates that it is an efficient algorithm for solving this highly constrained optimization
El-Fergany, A. Over-Current Relays problem by comparing its performance to other robust and well-known algorithms such as particle
Coordination Including Practical swarm optimizer (PSO) and water cycle optimizer (WCA). The performance metrics confirm the
Constraints and DGs: Damage GBO’s viability over the others. For sake of quantification, (i) for scenario1 of the Qarun test case,
Curves, Inrush, and Starting the GBO achieves a TOT of 0.7381 s, which indicates 63% and 57% reductions for those obtained by
Currents. Sustainability 2022, 14, 2761.
the PSO and WCA, respectively, and (ii) for the 15-bus test case, reductions in the TOT of 14.3% and
https://doi.org/10.3390/su14052761
16.5% for scenarios 1 and 2, respectively. The proposed tool based on GBO can enhance the protection
Academic Editor: Pablo co-ordination including some practical constraints.
García Triviño
Keywords: optimal relay coordination; problem constraints; optimization approaches; gradient
Received: 5 February 2022
based optimizer
Accepted: 24 February 2022
Published: 26 February 2022
has been solved using conventional techniques such as Linear Programming (LP), Non-
Linear Programming (NLP), and Mixed-Integer LP (MILP), as presented in [8]. Moreover,
metaheuristic-based algorithms either nature-inspired, swarm-based, or evolutionary-
based have been tackled to upgrade the results and the convergence rate [9]. Afterward,
hybrid techniques have been implemented such as Cuckoo Search Algorithm and LP in [10]
for solving the optimal coordination of DOCRs in microgrids with grid-connected and
islanded modes [11]. In this sense, the optimal coordination proposed in [12] compli-
cated the problem by including energy storage systems and inverter-based Distributed
Generators (DGs) in the tested networks. The dual-setting DOCR approach was utilized
in [13–15] for automated distribution networks. The optimal sizing of fault current limiters
was investigated to preserve the coordination in the case of DG penetration, as illustrated
in [16–18].
Various methodologies and formulas of Objective Functions (OFs) have been tackled
in the literature, which can be found summarized in [19]. A new approach was discussed
in [20] taking into account the topology transient changes using a complete model of all net-
work elements. Various topologies were also discussed in [21] by optimizing the relay-type
CCs as in [22] for the microgrid’s optimal protection coordination considering N-1 contin-
gency. However, DOCR coordination was solved using the critical fault point instead of
the near-end fault point, as found in [23], which improved the results accuracy. Afterward,
active settings of digital OCRs by using the setting group concept were utilized in [24] to be
adapted with the current topology of the network. New time–current–voltage CCs in [25]
and double-inverse CCs in [26] were proposed to enhance the DOCR coordination in the
presence of DGs. Moreover, a modified depth-first search algorithm was proposed in [27],
while it was hybridized with MILP in [28] for determining the minimum breakpoint set
along with the coordination of OCRs. In this regard, a hybrid variable neighborhood search
and LP algorithm was formulated in [29] to cope with diverse DOCRs for online optimal
coordination. Furthermore, a stochastic fractal search algorithm was exploited in [30], while
the arc flash hazards were assessed along with the optimal OCRs coordination in [31].
This research aims to develop a comprehensive optimization model for OCR coordina-
tion integrated with various types of constraints [32–37]. These constraints are discrepant
in nature, which simulates the real network operating conditions. The objective of this
methodology is to minimize the operating time of the primary relays along with satisfying
as many of these constraints as possible. Minimum operating time, transient condition, and
equipment damage curve constraints represent the main contributions inserted into the
optimization model. This highly constrained optimization model is solved through a new
optimization approach called Gradient-Based Optimizer (GBO) [32]. It is selected based on
the NFL theorem that states that no particular algorithm can solve all optimization prob-
lems efficiently. GBO combines the principles of gradient and heuristic-based techniques
by enhancing both exploration and exploitation phases [32]. It is worth mentioning that the
GBO performance is validated against one of the powerful algorithms for solving power
system optimization problems: Slime Mold Algorithm (SMA). Moreover, the GBO results
are validated by a fair comparison with other robust algorithms such as Particle Swarm
Optimizer (PSO) and Water Cycle Algorithm (WCA).
The main contributions of this work may be summarized as follows: (i) a novel op-
timization model including practical constrains such as transformer inrush, and motor
starting and damage curves are considered, (ii) a novel attempt is made to test the perfor-
mance of the GBO in solving the OCR problem, and (iii) demonstrations are made on a
typical isolated distribution network.
The body of this article is organized into five sections. The formulation of the proposed
model is announced in Section 2. Section 3 gives the procedures of the GBO, and the
numerical simulations are demonstrated in Section 4 along with various validations. Finally,
the findings and concluding remarks are summarized in Section 5.
Sustainability 2022, 14, 2761 3 of 22
M M K M1 M2
OF = ∑ t pri + WFm ∑ ∆tmi + WFc ∑ ∆t j + WFt ∑ ∆tti + WFd ∑ ∆tdi (2)
i =1 i =1 j =1 i =1 i =1
Std
CCs Type a b c
IEC IEEE
SI X 5 0.1400 0.0200 0.0000
VI X 5 13.5000 1.0000 0.0000
EI X 5 80.0000 2.0000 0.0000
LI X 5 120.0000 1.0000 0.0000
MI 5 X 0.0515 0.0200 0.1140
VI 5 X 19.6100 2.0000 0.4910
EI 5 X 28.2000 2.0000 0.1217
SI: standard inverse, VI: very inverse, EI: extremely inverse, LI: long inverse, MI: moderately inverse.
2.3.1.
2.3.1. Minimum
Minimum Operating
Operating Time Time Constraint
Constraint
Sustainability 2022, 14, 2761 4 of 22
As
As the coordination optimization problem
the coordination optimization problem tends
tends toto minimize
minimize thethe relay
relay operating
operating
time,
time, the
the results
results may
may contain
contain anan infeasible
infeasible tripping
tripping time
time not
not included
included inin any
any commercial
commercial
relay.
relay. A A penalty term (Δ𝑡
penalty term (Δ𝑡 )) isis inserted
inserted in in the
the OF
OF toto guarantee
guarantee that that the
the relay
relay tripping
tripping
time (𝑡
penalty
time )) is
(𝑡 term (∆tmi ) than
is greater
greater is inserted
than or
or equalin to
equal the
to aaOF
specific
specific value (𝑡
to guarantee
value (𝑡that,, ),
the
), asrelay
as tripping time
demonstrated
demonstrated in (tri ) is
in (6).
(6).
greater than or equal to a specific value (tmin,i ), as demonstrated in (6).
𝑡𝑡 −− 𝑡𝑡 ,, ≥ ≥ Δ𝑡
Δ𝑡 ≥ ≥ 00 (6)
(6)
tri − tmin,i ≥ ∆tmi ≥ 0 (6)
2.3.2.
2.3.2. Transient Conditions
Transient Conditions
Transient Constraints
Conditions Constraints
Constraints
It is worth mentioning
mentioningthat
It is worth mentioning thatinduction
that inductionmotors
induction motorshave
motors have
have aa starting
astarting
starting current
current
current range of
of (3–8)
range
range of (3–8)
(3–8) of
of
the
of motor
thethe motor
motor full load
fullfull
loadloadcurrent
current
current depending
depending
depending on
on onthe
thethestarting method
starting
starting method
method and
andand conditions.
conditions.
conditions. In this re-
In this
In this re-
gard,
gard, aa high
regard, highinrush
ahigh inrushcurrent
inrush currentdrawn
current drawnfrom
drawn fromthe
from thesupply
the supplyduring
supply duringtransformer
during transformer energizing
transformer energizing has has aa
range
range
range of of (8–12)
of (8–12)
(8–12)for for transformer
fortransformer
transformerfull full load
fullload current.
loadcurrent.
current.These These transient
Thesetransient
transient highhigh
high currents
currents
currents may
maymay lead
lead
leadto
to a false
atofalse
a false tripping
tripping
tripping of
of of the
thethe relay
relay
relay during
during
during these
these transient
thesetransient conditions.
transientconditions.
conditions.Figure Figure 1
Figure11depictsdepicts a typical
depicts aa typical
typical
motor
motor starting
starting curvecurve andand aa standardized
standardized relay
standardized relay tripping
tripping CC
tripping CC with
with thethe methodology
methodology of
the methodology of the
the
the
practical
practical coordination
practical coordination rules illustrated
coordination rules illustrated on it. To avoidon it. To avoid the
avoid the intersection
the intersection
intersection between between
between the two
the two
two
curves,
curves, aaa current
curves, current margin
current margin
marginof of (75%. 𝐼starting
(75%.
of(75%.I 𝐼 )) and
) and and a atime
a time
time margin
margin
margin (𝑡 −,, t−
(𝑡
(trt,i − 𝑡 , )) of
t,i )𝑡 of
(2–10)
(2–10) s shall
s shall
, of (2–10) s shall
be
be considered
considered and and
may may
be be extended
extended to 1 to
s, 1
as s, as
shown. shown.
The
be considered and may be extended to 1 s, as shown. The same practical coordination The
same same practical
practical coordination
coordination rules
rules
rules mentioned
mentioned
mentioned earlierearlier
should
earlier should
also be
should also be
be considered
considered
also consideredin thein the
case
in theofcase of
of aa transformer
a transformer
case transformer overcurrent
overcurrent relay
overcurrent
relay protection
protection feeder, feeder,
as as
shown shown
in
relay protection feeder, as shown in Figure 2. in
Figure Figure
2. 2.
Figure
Figure 1.
1. Motor
Motor starting
starting curve
curve with
with the
the practical
practical coordination
coordination rules.
rules.
Figure
Figure 2.
Figure 2. Transformer
2. inrush
Transformer inrush
Transformer point
inrush point with
point with the
with the practical
the practical coordination
practical coordination rules.
coordinationrules.
rules.
Consequently,
Consequently,aaapenalty
Consequently, penalty term
termisis
penaltyterm added
isadded
added toto
to the
the
the OF
OFOF(∆t(Δ𝑡
(Δ𝑡 )) ensure
ti ) to
to
to ensure
ensure thatthat
the the
that relay
relay
the trip-
tripping
relay trip-
ping
ping curve is higher than the motor starting curve or the transformer inrush point, as ex-
curve curve
is is
higher higher
than than
the the
motor motor
startingstarting
curve curve
or the or the transformer
transformer inrush inrush
point, point,
as as
expressed
ex-
pressed
in
pressed in
(7). trt,i
inis the𝑡𝑡 relay
(7).
(7). , is
, is the
the relay
operating
relay operating
time
operatingat time
the at the
transient
time at the transient
current
transient current
and t
current t,i and
is the
and 𝑡𝑡motor
, is
, is the motor
starting
the motor
starting
time time
or the
starting time or
or the
the transformer
transformer inrush
inrush current
transformer current
current period.
inrushperiod. period.
𝑡𝑡 , − 𝑡, ≥ Δ𝑡 (7)
trt,i , −
− tt,i𝑡 ≥
, ≥
∆tΔ𝑡
ti (7)
If 𝐼
2 𝑇 + ß
× × 𝑡= , = 𝑘log
log Td + ß (9)
1973.525
1973.525 × A× 𝐴
t d,i k c 10 T𝑇++ßß (9)
o
!2
k× 𝑘× A𝐴
td,i 𝑡=, = (10)
(10)
If 𝐼
td,i𝑡 − − ∆tΔ𝑡
t pri𝑡 ≥ ≥ di (11)
, (11)
Figure 3. Cable
Figure 3. Cable damage
damage curves
curves with
with various
various constructions.
constructions.
To
To ensure
ensure aa safe
safeoperation,
operation,the the relay
relay should
should triptrip in less
in less timetime
thanthan the equipment
the equipment with-
withstand
stand timetime(𝑡 , ()td,i at the
at) the maximum
maximum fault
fault point,
point, as as shown
shown in in (11)
(11) andand Figure
Figure 4. 4. Therefore,a
Therefore,
apenalty
penaltyterm
term(Δ𝑡 (∆tdi) )isis added
added toto the
the OF
OF to
to satisfy
satisfy this
this constraint.
constraint. It It is
is worth
worth mentioning
mentioning
that
that there is a conflict of constraints in the optimization model of OCR coordination. This
there is a conflict of constraints in the optimization model of OCR coordination. This
represents
represents aa challenging
challenging task task to
to the
the algorithm
algorithm toto pick
pick the
the optimal
optimal settings
settings preserving
preserving all
all
these
these types of constraints.
types of constraints.The Theconflict
conflictappears
appears inin
thethe algorithm’s
algorithm’s attempt
attempt to minimize
to minimize the
the relay operating time besides positioning the tripping curve above the starting or the
inrush curves. Furthermore, the algorithm aims at tripping in less time than the equipment
Sustainability 2022, 14, 2761 6 of 21
relay operating time besides positioning the tripping curve above the starting or the in-
rush curves. Furthermore, the algorithm aims at tripping in less time than the equipment
withstand
withstand time
timealong
alongwith
withpreserving
preservingthe
theminimum
minimumoperating
operatingtime
timeconstraint. Hereinafter,
constraint. Hereinaf-
GBO and and
ter, GBO its behavior concept
its behavior are discussed
concept in brief
are discussed in the
in brief innext section.
the next section.
Figure 4.
Figure 4. Equipment
Equipment damage
damage curve
curve with
with aa standard
standard relay
relay CC.
CC.
3. Gradient-Based Optimizer
3. Gradient-Based Optimizer
The optimization techniques
The optimization techniquescan canbebeclassified
classifiedinto intotwo two main
main categories
categories based
based on
on the
the optimization behavior process [33,34]. Gradient-based
optimization behavior process [33,34]. Gradient-based techniques such as Newton’stechniques such as Newton’s
method
method estimate
estimate thethe derivatives
derivatives of of the
the OFOF along
along with
with the
the constraints
constraints by by identifying
identifying an an
extreme point whose gradient equals zero. The second category is
extreme point whose gradient equals zero. The second category is the non-gradient-based the non-gradient-based
approaches
approaches suchsuchasasallallmetaheuristic
metaheuristic algorithms
algorithms that randomly
that randomly generate initial
generate populations,
initial popula-
and
tions, and the optimal solution is attained by updating these search vectors. combines
the optimal solution is attained by updating these search vectors. The GBO The GBO
the principles
combines the of the two techniques
principles by enhancing
of the two techniques byboth exploration
enhancing both and exploitation
exploration phases.
and exploi-
GBO has two main operators: Gradient Search Rule (GSR) that is responsible
tation phases. GBO has two main operators: Gradient Search Rule (GSR) that is responsi- for enhancing
the
ble exploration
for enhancing phase
the for better convergence
exploration phase for in the search
better agents.in
convergence Thetheother operator
search agents.isThe
the
Local Escaping Operator (LEO) that prevents GBO from becoming
other operator is the Local Escaping Operator (LEO) that prevents GBO from becoming trapped in local minima;
more details of the mathematical model of GBO can be found in [32,35,36].
trapped in local minima; more details of the mathematical model of GBO can be found in
[32,35,36].
Xn = Xlower + rand(0, 1) × Xupper − Xlower , n ∈ N (12)
𝑋 =𝑋 + 𝑟𝑎𝑛𝑑(0,1) × 𝑋 −𝑋 ,𝑛 ∈ 𝑁 (12)
GBO starts with the population initialization by randomly generating the initial vectors
according
GBO to (12),with
starts where therand (0, 1) is ainitialization
population random number and 1. Xn the
between 0generating
by randomly represents the
initial vec-
solution at iteration
tors according n, while
to (12), where 𝑟𝑎𝑛𝑑(0,1)
Xlower and Xupper are the boundaries
is a random number betweenof the decision
0 and 1. 𝑋 repre-
variable X.
sents the solution at iteration n, while 𝑋 and 𝑋 are the boundaries of the deci-
sion variable 𝑋. MOD = rand ( 0, 1 ) × ρ b × ( X best − Xn ) (13)
𝑀𝑂𝐷
ρb ==𝑟𝑎𝑛𝑑(0,1) × α(𝑋− α − 𝑋 )
× 1𝜌) ×
2 × rand(0, (14)
(13)
GSR is deemed as the main brain of GBO as it controls the vector’s movement and
enhances the exploration phase. 𝜌The = Movement
2 × 𝑟𝑎𝑛𝑑(0,1) × 𝛼 − 𝛼 (MoD) of the decision vari-
of Direction (14)
ables can be estimated from (13), where ρb is a random parameter assessed from (14). The
GSR is deemed as the main brain of GBO as it controls the vector’s movement and
term Xbest − Xn expresses the convergence process by moving the current vector Xn into
enhances the exploration phase. The Movement of Direction (𝑀𝑜𝐷) of the decision varia-
the best vector obtained Xbest . The parameter α varies with the number of iterations and its
bles can be estimated from (13), where 𝜌 is a random parameter assessed from (14). The
value is changed at each iteration, as shown in a figure depicted in [32,36].
term 𝑋 − 𝑋 expresses the convergence process by moving the current vector 𝑋 into
the best vector obtained 𝑋 . The parameter2∆X 𝛼 varies
× ƒ( Xwith
n) the number of iterations and
its value is changed at each 1 = Xn −as shown in a figure depicted in [32,36].
Xn+iteration, (15)
ƒ(Yn + ∆X ) − ƒ(Yn − ∆X )
2∆𝑋 × ƒ(𝑋 )
𝑋 =𝑋 − 2∆X × Xn (15)
GSR = rand(0, 1)ƒ(𝑌
× ρ a+×∆𝑋) − ƒ(𝑌 − ∆𝑋) (16)
(Ypn − Yqn + e)
2∆𝑋 × 𝑋
As GBO inspires its procedures from Newton’s method, as expressed in (15), the GSR
𝐺𝑆𝑅 = 𝑟𝑎𝑛𝑑(0,1) × 𝜌 × (16)
(𝑌𝑝
performance is improved by calculating it from (16). − the
ρ a is 𝑌𝑞 parameter
+ 𝜖) that balances the
exploration and exploitation phases and varies with the parameter α.
Xrand = Xlower + rand(0, 1) × Xupper − Xlower (17)
As GBO inspires its procedures from Newton’s method, as expressed in (15), the GSR
performance is improved by calculating it from (16). 𝜌 is the parameter that balances the
exploration and exploitation phases and varies with the parameter 𝛼.
Sustainability 2022, 14, 2761 7 of 22
𝑋 =𝑋 + 𝑟𝑎𝑛𝑑(0,1) × 𝑋 −𝑋 (17)
𝑋 = 𝐿 × 𝑋 + (1 − 𝐿 ) × 𝑋 (18)
Xkm = L2 × X m
p + (1 − L2 ) × Xrand (18)
To promote the
To promote the efficacy
efficacy of
of the
the proposed
proposed algorithm,
algorithm, the the LEO
LEO is
is implemented
implemented in in the
the
subroutine represented briefly in (17) and (18). 𝑋 is a new solution, while
m 𝑋
subroutine represented briefly in (17) and (18). Xrand is a new solution, while X p is selected is se-
lected randomly over the population m
and 𝑋 is the newest randomly
randomly over the population and Xk is the newest randomly generated vector. L2 is generated vector.
𝐿 is a binary
a binary number
number that that takes
takes a value
a value of 0ofor
0 or 1 basedononthe
1 based therandom
randomassessing
assessing of
of other
parameters for obtaining the global optimal solution. The relations of the other variables
presented in (15)–(18) can be found in detail in [32,36]
[32,36] toto avoid
avoid making
making the
the paper
paper too
toolong.
long.
The general procedures of the GBO are are depicted
depicted in in Figure
Figure 55 [35,36].
[35,36].
K=1
No
Max. iterations is satisfied
Table 3. Cont.
Table 4. Operating times of P/B relay pairs and their associated CTI values of IEEE 15-bus
test network.
Table 4. Cont.
Table 4. Cont.
Figure8.8.Qarun
Figure Qaruntest
testnetwork
networksingle-line
single-linediagram.
diagram.
This network consists of 16 OCRS with 14 P/B relay pairs. The symmetrical three-
This network consists of 16 OCRS with 14 P/B relay pairs. The symmetrical three-
phase and two-phase fault currents are given in Table 5, while the initial load flow currents
phase and two-phase fault currents are given in Table 5, while the initial load flow cur-
are given in Table 6. These power system studies are performed using ETAP software
rents are given in Table 6. These power system studies are performed using ETAP soft-
considering only the worst-case faults as inputs to the optimization model, i.e., three-phase
ware considering only the worst-case faults as inputs to the optimization model, i.e., three-
fault currents. Motors’ starting and stall times are obtained through the manufacturer’s rec-
phase fault currents. Motors’ starting and stall times are obtained through the manufac-
ommendation, while the transformers’ LTE is assumed to be 1250 per unit, according to [35].
turer’s recommendation, while the transformers’ LTE is assumed to be 1250 per unit, ac-
The formulation comprises 128 discrepant inequality constraints including 48 constraints
cording
related to to [35].settings.
OCR The formulation comprises
Furthermore, 12814
there are discrepant inequality
selectivity constraints
constraints, including
16 minimum op-
48 constraints
erating related toand
time constraints, OCR24settings.
transientFurthermore, there are This
condition constraints. 14 selectivity constraints,
optimization problem16
minimum
also containsoperating time damage
26 equipment constraints,
curveand 24 transient
constraints; 14 condition constraints.
of them concern This optimi-
the power cables
zation problem also contains
that are fulfilled by default. 26 equipment damage curve constraints; 14 of them concern
the power cables that are fulfilled by default.
Sustainability 2022, 14, 2761 14 of 22
Table 5. Fault currents passing through P/B relay pairs of Qarun test network.
Scenario 1 Scenario 2
Relay ID Ifl (A) TCC TCC
Ip (A) TD (s) Ip (A) TD (s)
Curve IEC IEEE Curve IEC IEEE
1 628.3 707.0480 0.3356 VI 5 X 779.6370 0.3040 VI 5 X
2 180.8 180.8000 0.2147 VI X 5 269.4136 0.5192 EI 5 X
3 68 91.8804 0.3239 EI X 5 91.5472 0.7414 EI 5 X
4 68 88.8047 0.3466 EI X 5 91.9678 0.5890 EI 5 X
5 106 122.5999 0.4077 VI X 5 137.8547 0.4262 VI X 5
6 103.9 142.2529 0.9076 EI X 5 144.7595 0.9375 EI X 5
7 103.9 143.2030 0.8946 EI X 5 147.0365 0.8538 EI X 5
8 31.8 31.8000 0.1000 EI X 5 41.4839 0.1000 VI X 5
9 663.9 881.5404 0.2451 VI 5 X 866.5552 0.2168 MI 5 X
10 180.9 267.8911 0.5228 EI 5 X 269.8280 0.3294 EI X 5
11 106.3 120.0446 0.4168 VI X 5 146.3529 0.3806 VI X 5
12 67.8 88.9917 0.6138 EI 5 X 73.8600 0.7654 EI 5 X
13 103.9 141.1091 0.9240 EI X 5 151.3325 0.8243 EI X 5
14 135.9 165.2193 0.4009 EI X 5 166.0149 0.7253 EI X 5
15 71.5 105.8773 0.7745 EI X 5 107.2474 0.9999 EI X 5
16 31.9 31.9000 0.1000 EI X 5 46.1682 0.2648 EI 5 X
TOT (s) 0.7381 1.0387
The proposed optimization model mentioned in Section 2 is run and solved using
GBO for this test case with two scenarios. The settings of recent digital relays are optimized
with extracting the optimal tripping curve among IEC and IEEE standardized curves, as
illustrated in Table 6. Scenario 1 achieves a TOT of 0.7381 s while Scenario 2 achieves a
Sustainability 2022, 14, 2761 15 of 22
TOT of 1.0387 s with zero boundary and selectivity constraints violations in both scenarios.
Table 7 clarifies the operating times of P/B relay pairs, CTI values, and their associated
operating constraints for scenario 1. It can be noted that there are six violations in the
minimum operating time constraint found in relay pairs 2, 3, 7, 12, 13, and 14. Therefore,
the optimization problem becomes more complicated by adding an extra 14 minimum
operating time constraints in Scenario 2.
Table 7. P/B relay pairs operating times and their associated constraint values of Qarun test network
for scenario 1.
Scenario 2 achieves better results than Scenario 1 by canceling the violations in the
minimum operating time constraint in all pairs except for pair 13. Moreover, the transient
condition constraints are improved by expanding the time difference gap, as declared in
pairs 2, 4, 5, and 13 and clarified in Table 8. It can be observed that there are no equipment
damage curve violations in both scenarios, as declared in Tables 7 and 8. Pair 13 represents
a challenge to the algorithm in bounding the tripping time between tmin of 50 ms and td of
124 ms. It is violated in both scenarios by obtaining a very small primary relay tripping
time of 20.6 ms in scenario 1 and 27.2 ms in scenario 2. In this context, Figure 9 depicts a
TCC sample of a motor feeder with some current time indications, as shown using scenario
2 settings.
The OF values and statistical measures obtained using GBO, PSO, and WCA are
reported in Table 9, while the settings using PSO and WCA are not reported, to avoid
making the paper too long. It is clear that GBO achieves a notable reduction in the OF value
and better convergence compared to PSO and WCA, as declared in Figures 10 and 11. The
data tips shown in these figures are related to the minimum obtained OF value through
whole iterations using GBO. There is a slight difference between OF and TOT values due
to some violations in the operating constraints, which are multiplied by large factors, as
declared in Table 9.
Sustainability 2022, 14, 2761 16 of 22
Table 8. P/B relay pairs operating times and their associated constraint values of Qarun test network
for scenario 2.
Relay Pair ID
P/B Relay Pair
tpr (s) ∆tt (s)= ∆td (s)=
tbr (s) CTI (s) trt (s) td (s)
P B trt −tt td −tpr
Table 8. P/B relay pairs operating times and their associated constraint values of Qarun test network
for scenario 2.
to some violations in the operating constraints, which are multiplied
declared in Table 9.
declared in Table 9.
Table 9. Performance measures of GBO compared to PSO and WCA in Qarun
Table 9. Performance measures of GBO compared to PSO and WCA in Qarun
Sustainability 2022, 14, 2761 17 of 22
Scenario 1
Scenario 1
TOT Min Max9. Performance
Mean Median SD 𝑾𝑭
and WCA 𝑾𝑭
𝑾𝑭
𝒎 test 𝒄 𝑾𝑭𝒕 𝑾𝑭𝒅
TOT Min Table
Max Meanmeasures of GBO compared to PSO
Median SD in Qarun
𝒎 𝑾𝑭 network.
𝒄 𝑾𝑭𝒕 𝑾𝑭𝒅
Scenario 1
GBO 0.7381 0.7385 1.2336 1.0116 1.0396 0.1774 0 1000 1000 1000
GBO 0.7381 0.7385 Min 1.2336
TOT Max Mean1.0116
Median 1.0396
SD WFm WF0.1774
c WFt 0d
WF 1000 Time
Elapsed 1000
(s) 1000
PSO 1.1614
GBO
1.1610
0.7381
3036.6235 1126.6009 40.2700 1532.762 0 1000 1000 1000
PSO 1.1614 1.16100.73853036.6235
1.2336 1.0116 1.0396
1126.6009 0.1774
40.2700 0 1000 1000
1532.762 10000
0 185.9983
1000 1000 1000
WCA 1.0614
PSO 1.06191.1610 42.7392
1.1614 3036.6235 12.9535
1126.6009 40.2700 1.2226 0 18.3029
1532.762 1000 1000 0
10000 1000 1000
227.2286 1000
WCA 1.0614 1.0619 42.7392 12.9535 1.2226 18.3029 0 1000 1000 1000
WCA 1.0614 1.0619 42.7392 12.9535 1.2226 Scenario
18.3029 0 21000 1000 10000 400.4712
Scenario 2
GBO 1.0387 3.3137 4.3728 3.6892 Scenario3.4044
2
0.4815 100 10 10 100
GBO 1.0387
GBO 3.31373.3137
1.0387 4.3728
4.3728 3.6892
3.6892 3.4044 3.4044
0.4815 100 0.4815
10 10 100
100 10175.8350 10 100
PSO 1.3181 3.9370 35.1902 10.3495 4.2033 13.8870 100 10 10 100
PSO 1.3181
PSO 3.93703.9370 35.1902
1.3181 35.1902 10.3495
10.3495 4.2033 4.2033 100 13.8870
13.8870 10 10 100
100 10176.1993 10 100
WCA 1.1281 3.4031 4.7424 4.1908 4.2593 0.4858 100 10420.3673 10 100
WCA 1.1281
WCA 3.40313.4031 4.7424
1.1281 4.7424 4.1908
4.1908 4.2593 4.2593 100 0.4858
0.4858 10 10 100
100 10 10 100
Figure
Figure 10. 10. Scenario
Scenario 1 OF convergence
1 OF convergence of Qarun
test network.
of Qarun test network.
Figure 10. Scenario 1 OF convergence of Qarun test network.
Figure
Figure Scenario
11. 11. 2 OF convergence
Scenario of Qarun test network.
2 OF convergence of Qarun
test network.
Figure 11. Scenario 2 OF convergence of Qarun test network.
Sustainability 2022, 14, 2761 18 of 22
5. Conclusions
This work represents a forward step in the optimization model of overcurrent relay
coordination by solving the practical technical problems facing the protection engineers.
This model aims to eliminate the false tripping actions due to energizing inductive equip-
ment such as transformers and motors. Moreover, it is ensured that the OCR will trip
before the breakdown of the protected equipment with preserving the minimum operating
time condition for each commercial relay. First, the effectiveness of the proposed GBO is
interrogated by a fair comparison with SMA for solving the IEEE 15-bus network using
various scenarios. In this regard, GBO manifests its superiority by attaining a reduction in
the total operating time of 14.3% and 16.5% for scenarios 1 and 2, respectively. Afterward,
the proposed optimization model is applied on the medium voltage distribution network
of the Qarun petroleum company, which is deemed as an isolated network. GBO achieves
a notable reduction in the TOT compared to PSO and WCA with better OF convergence.
Moreover, GBO employs the tradeoff technique between the problem constraints with
a very low number of violations. Consequently, GBO exhibits only one minimum time
constraint violation and zero equipment damage curve constraint violations for Scenario 2.
Although scenario 2 complicates the optimization problem, it attains better and feasible
results than Scenario 1. Eventually, this model paves the way for researchers to develop
and augment the overcurrent relay coordination problem.
Abbreviations
Directional Over-Current
DOCRs TOT Total Operating Time
Relays
CTI Coordination Time Interval SI Standard Inverse
TCC Time Current Characteristic VI Very Inverse
International Electrotechnical
IEC EI Extremely Inverse
Commission
CCs Characteristics LI Long Inverse
LP Linear Programming MI Moderately Inverse
NLP Non-Linear Programming LTE Let Through Energy
Mixed Integer Linear
MILP AAC All Aluminum Conductor
Programming
Aluminum Conductor Alloy
CSA Cuckoo Search Algorithm ACAR
Reinforced
Aluminum Conductor Steel
DGs Distributed Generators ACSR
Reinforced
OFs Objective Functions GSR Gradient Search Rule
GBO Gradient-Based Optimizer LEO Local Escaping Operator
SMA Slime Mold Algorithm P/B Primary/Backup
Electrical Transient Analyzer
PSO Particle Swarm Optimizer ETAP
Program
WCA Water Cycle Algorithm MCCs Motor Control Centers
Ip pickup current tbri backup relay operating time
minimum tripping time of
TD time dial tmin,i
relay i
tri relay operating time Istarting starting current
relay operating time at the
a, b, and c tripping equation constants trt,i
transient current
motor starting time or the
If fault current tt,i transformer inrush current
period
i relay identifier td,i equipment withstand time
j relay pair identifier A cross-sectional area
M total number of primary relays To initial temperature
number of relays subjected to
M1 Td final temperature
transient conditions constraints
number of relays subjected to
M2 equipment damage curve k constant
constraints
K relay pairs number Xn solution at iteration n
∆t j , ∆tmi ,
boundaries of the decision
∆tti , ∆tdi penalties added to the OF Xlower ,Xupper
variable X
WFm , WFc ,
WFt , WFd adjusting weighing factors MoD movement of direction
minimum values of I p , TD ,
I pmin,i , TDmin,i ρ a , ρb random parameters
respectively
maximum values of I p , TD ,
I pmax,i , TDmax,i Xbest best vector obtained
respectively
the newest randomly
CTImin minimum value of CTI Xkm
generated vector
CTImax maximum value of CTI L2 binary number
t pri primary relay operating time
Sustainability 2022, 14, 2761 21 of 22
References
1. Albasri, F.A.; Alroomi, A.R.; Talaq, J.H. Optimal Coordination of Directional Overcurrent Relays Using Biogeography-Based
Optimization Algorithms. IEEE Trans. Power Deliv. 2015, 30, 1810–1820. [CrossRef]
2. Alkaran, D.S.; Vatani, M.R.; Sanjari, M.J.; Gharehpetian, G.B.; Naderi, M.S. Optimal overcurrent relay coordination in intercon-
nected networks by using fuzzy-based GA method. IEEE Trans. Smart Grid 2018, 9, 3091–3101. [CrossRef]
3. Kida, A.A.; Rivas, A.E.L.; Gallego, L.A. An improved simulated annealing–linear programming hybrid algorithm applied to the
optimal coordination of directional overcurrent relays. Electr. Power Syst. Res. 2020, 181, 106197. [CrossRef]
4. IEC 60255; Electrical Relays. Part 3: Single Input Energizing Quantity Measuring Relays with Dependent or Independent Time.
Advanced Test Equipment Corporation: San Diego, CA, USA, 1989.
5. IEEE C37.112-2018; IEEE Standard for Inverse-Time Characteristics Equations for Overcurrent Relays. Institute of Electrical and
Electronics Engineers: Piscataway, NJ, USA, 2019.
6. Korashy, A.; Kamel, S.; Alquthami, T.; Jurado, F. Optimal Coordination of Standard and Non-Standard Direction Overcurrent
Relays Using an Improved Moth-Flame Optimization. IEEE Access 2020, 8, 87378–87392. [CrossRef]
7. Papaspiliotopoulos, V.A.; Korres, G.N.; Maratos, N.G. A Novel Quadratically Constrained Quadratic Programming Method for
Optimal Coordination of Directional Overcurrent Relays. IEEE Trans. Power Deliv. 2015, 32, 3–10. [CrossRef]
8. Damchi, Y.; Dolatabadi, M.; Mashhadi, H.R.; Sadeh, J. MILP approach for optimal coordination of directional overcurrent relays
in interconnected power systems. Electr. Power Syst. Res. 2018, 158, 267–274. [CrossRef]
9. Shrivastava, A.; Tripathi, J.M.; Krishan, R.; Parida, S. Optimal Coordination of Overcurrent Relays using Gravitational Search
Algorithm with DG Penetration. IEEE Trans. Ind. Appl. 2018, 54, 1155–1165. [CrossRef]
10. Dehghanpour, E.; Karegar, H.K.; Kheirollahi, R.; Soleymani, T. Optimal Coordination of Directional Overcurrent Relays in
Microgrids by Using Cuckoo-Linear Optimization Algorithm and Fault Current Limiter. IEEE Trans. Smart Grid 2016, 9,
1365–1375. [CrossRef]
11. Sharaf, H.M.; Zeineldin, H.H.; El-Saadany, E.F. Protection Coordination for Microgrids With Grid-Connected and Islanded
Capabilities Using Communication Assisted Dual Setting Directional Overcurrent Relays. IEEE Trans. Smart Grid 2016, 9, 143–151.
[CrossRef]
12. Asl, S.A.F.; Gandomkar, M.; Nikoukar, J. Optimal protection coordination in the micro-grid including inverter-based distributed
generations and energy storage system with considering grid-connected and islanded modes. Electr. Power Syst. Res. 2020,
184, 106317. [CrossRef]
13. Yazdaninejadi, A.; Golshannavaz, S.; Nazarpour, D.; Teimourzadeh, S.; Aminifar, F. Dual-Setting Directional Overcurrent Relays
for Protecting Automated Distribution Networks. IEEE Trans. Ind. Informatics 2018, 15, 730–740. [CrossRef]
14. Beder, H.; Mohandes, B.; el Moursi, M.S.; Badran, E.A.; el Saadawi, M.M. A new communication-free dual setting protection
coordination of microgrid. IEEE Trans. Power Deliver. 2021, 36, 2446–2458. [CrossRef]
15. Zeineldin, H.H.; Sharaf, H.M.; Ibrahim, D.; El-Zahab, E.E.-D.A. Optimal Protection Coordination for Meshed Distribution Systems
With DG Using Dual Setting Directional Over-Current Relays. IEEE Trans. Smart Grid 2014, 6, 115–123. [CrossRef]
16. Farzinfar, M.; Jazaeri, M. A novel methodology in optimal setting of directional fault current limiter and protection of the MG. Int.
J. Electr. Power Energy Syst. 2019, 116, 105564. [CrossRef]
17. Elmitwally, A.; Kandil, M.S.; Gouda, E.; Amer, A. Mitigation of DGs Impact on Variable-Topology Meshed Network Protection
System by Optimal Fault Current Limiters Considering Overcurrent Relay Coordination. Electr. Power Syst. Res. 2020, 186, 106417.
[CrossRef]
18. Sadeghi, M.H.; Dastfan, A.; Damchi, Y. Optimal coordination of directional overcurrent relays in distribution systems with DGs
and FCLs considering voltage sag energy index. Electr. Power Syst. Res. 2020, 191, 106884. [CrossRef]
19. Draz, A.; Elkholy, M.M.; El-Fergany, A.A. Soft Computing Methods for Attaining the Protective Device Coordination Including
Renewable Energies: Review and Prospective. Arch. Comput. Methods Eng. 2021, 28, 4383–4404. [CrossRef]
20. Mahboubkhah, A.; Talavat, V.; Beiraghi, M. Considering transient state in interconnected networks during fault for coordination
of directional overcurrent relays. Electr. Power Syst. Res. 2020, 186, 106413. [CrossRef]
21. Entekhabi-Nooshabadi, A.M.; Hashemi-Dezaki, H.; Taher, S.A. Optimal microgrid’s protection coordination considering N-1
contingency and optimum relay characteristics. Appl. Soft Comput. 2020, 98, 106741. [CrossRef]
22. El-Fergany, A.A.; Hasanien, H. Water cycle algorithm for optimal overcurrent relays coordination in electric power systems. Soft
Comput. 2019, 23, 12761–12778. [CrossRef]
23. Alkaran, D.S.; Vatani, M.R.; Sanjari, M.J.; Gharehpetian, G.B.; Yatim, A.H. Overcurrent Relays Coordination in Interconnected
Networks Using Accurate Analytical Method and Based on Determination of Fault Critical Point. IEEE Trans. Power Deliv. 2015,
30, 870–877. [CrossRef]
24. Ojaghi, M.; Mohammadi, V. Use of Clustering to Reduce the Number of Different Setting Groups for Adaptive Coordination of
Overcurrent Relays. IEEE Trans. Power Deliv. 2017, 33, 1204–1212. [CrossRef]
25. Saleh, K.A.; Zeineldin, H.H.; Al-Hinai, A.; El-Saadany, E.F. Optimal Coordination of Directional Overcurrent Relays Using a New
Time–Current–Voltage Characteristic. IEEE Trans. Power Deliv. 2014, 30, 537–544. [CrossRef]
26. Aghdam, T.S.; Karegar, H.K.; Zeineldin, H.H. Optimal Coordination of Double-Inverse Overcurrent Relays for Stable Operation
of DGs. IEEE Trans. Ind. Informatics 2018, 15, 183–192. [CrossRef]
Sustainability 2022, 14, 2761 22 of 22
27. Dolatabadi, M.; Damchi, Y. Graph Theory Based Heuristic Approach for Minimum Break Point Set Determination in Large Scale
Power Systems. IEEE Trans. Power Deliv. 2019, 34, 963–970. [CrossRef]
28. Ghotbi-Maleki, M.; Chabanloo, R.M.; Ebadi, M.A.; Savaghebi, M. Determination of optimal breakpoint set of overcurrent relays
using modified depth-first search and mixed-integer linear programming. IET Gener. Transm. Distrib. 2020, 14, 5607–5616.
[CrossRef]
29. Damchi, Y.; Dolatabadi, M. Hybrid VNS–LP algorithm for online optimal coordination of directional overcurrent relays. IET
Gener. Transm. Distrib. 2020, 14, 5447–5455. [CrossRef]
30. El-Fergany, A.A.; Hasanien, H.M. Optimized settings of directional overcurrent relays in meshed power networks using stochastic
fractal search algorithm. Int. Trans. Electr. Energy Syst. 2017, 27, e2395. [CrossRef]
31. El-Fergany, A. Optimal directional digital overcurrent relays coordination and arc-flash hazard assessments in meshed networks.
Int. Trans. Electr. Energy Syst. 2015, 26, 134–154. [CrossRef]
32. Ahmadianfar, I.; Bozorg-Haddad, O.; Chu, X. Gradient-based optimizer: A new metaheuristic optimization algorithm. Inf. Sci.
2020, 540, 131–159. [CrossRef]
33. Mahdinia, S.; Rezaie, M.; Elveny, M.; Ghadimi, N.; Razmjooy, N. Optimization of PEMFC Model Parameters Using Meta-
Heuristics. Sustainability 2021, 13, 12771. [CrossRef]
34. Dehghani, M.; Ghiasi, M.; Niknam, T.; Kavousi-Fard, A.; Shasadeghi, M.; Ghadimi, N.; Taghizadeh-Hesary, F. Blockchain-
Based Securing of Data Exchange in a Power Transmission System Considering Congestion Management and Social Welfare.
Sustainability 2021, 13, 90. [CrossRef]
35. Rizk-Allah, R.M.; El-Fergany, A.A. Effective coordination settings for directional overcurrent relay using hybrid Gradient-based
optimizer. Appl. Soft Comput. 2021, 112, 107748. [CrossRef]
36. Eelsayed, S.K.; Agwa, A.; Elattar, E.E.E.; El-Fergany, A. Steady-State Modelling of Pem Fuel Cells Using Gradient-Based Optimizer.
DYNA—Ing. Ind. 2021, 96, 520–527. [CrossRef]
37. El-Kordy, M.; El-Fergany, A.; Gawad, A.F.A. Various Metaheuristic-Based Algorithms for Optimal Relay Coordination: Review
and Prospective. Arch. Comput. Methods Eng. 2021, 28, 3621–3629. [CrossRef]
38. IEEE Std 242-2001; IEEE Recommended Practice for Protection and Coordination of Industrial and Commercial Power Systems.
Institute of Electrical and Electronics Engineers: Piscataway, NJ, USA, 2001.
39. IEC 60364-4-43; Low Voltage Electrical Installations Part 4-43: Protection for safety-protection against overcurrent. International
Electrotechnical Commission: Geneva, Switzerland, 2008.
40. IEEE C57.12.01-2015; IEEE Standard for General Requirements for Dry-Type Distribution and Power Transformers. Institute of
Electrical and Electronics Engineers: Piscataway, NJ, USA, 2015.
41. Alam, M.N.; Das, B.; Pant, V. A comparative study of metaheuristic optimization approaches for directional overcurrent relays
coordination. Electr. Power Syst. Res. 2015, 128, 39–52. [CrossRef]
42. Draz, A.; Elkholy, M.M.; El-Fergany, A.A. Slime mould algorithm constrained by the relay operating time for optimal coordination
of directional overcurrent relays using multiple standardized tripping curves. Neural Comput. Appl. 2021, 33, 11875–11887.
[CrossRef]
43. Electrical Power System Analysis & Operation Software. Available online: https://etap.com/ (accessed on 23 December 2021).