Professional Documents
Culture Documents
Optimal Microgrid's Protection Coordination Considering N-1 Contingency and Optimum Relay Characteristics - 2021
Optimal Microgrid's Protection Coordination Considering N-1 Contingency and Optimum Relay Characteristics - 2021
graphical abstract
article info a b s t r a c t
Article history: There is a knowledge gap about the development of optimal coordination of microgrids, which consid-
Received 16 September 2019 ers all N-1 contingencies by using the smart selection of standard relay characteristics. This paper tries
Received in revised form 7 August 2020 to fill such a knowledge gap by contributing to introduce a novel method to optimize the coordination
Accepted 14 September 2020
of microgrids’ directional overcurrent relays (DOCRs), which smartly selects the time-current charac-
Available online xxxx
teristic of relays and considers all system topologies. Achieving an optimal protection scheme of micro-
Keywords: grids without any selectivity constraint under various topologies is the main purpose of this research.
Microgrid The proposed objective function of total operating time of DOCRs under various system topologies is
Optimal coordination of directional linearized as the TDSs. The hybrid heuristic-linear programming algorithms (HHLPAs) are used to solve
overcurrent relays (DOCRs) the mixed-integer non-linear programming (MINLP) problem. The decrease in the number of heuristic
Smart selection of relay characteristics
algorithm’s decision variables improves the performance of the proposed HHLPAs. The soft computing-
N-1 contingencies
based comparison of the hybrid genetic algorithm-linear programming (GA-LP) and the hybrid particle
Hybrid genetic algorithm-linear
programming (GA-LP) swarm optimization-linear programming (PSO-LP) is another contribution of this paper. About 80%
Hybrid particle swarm optimization-linear decrease in the DOCRs’ operating time has been achieved by applying the proposed smart selection of
programming (PSO-LP) standard relay characteristics (normally inverse, very inverse, and extremely inverse) in comparison
to use of just normally inverse curve based on existing methods. The satisfaction of coordination
constraints of optimum relay settings is validated based on the DIgSILENT protection simulations.
© 2020 Elsevier B.V. All rights reserved.
∗ Corresponding author at: Regional Innovational Center for Electrical Engi- E-mail addresses: amirmohammad.entekhabi@grad.kashanu.ac.ir
neering (RICE), Faculty of Electrical Engineering, University of West Bohemia (A.M. Entekhabi-Nooshabadi), hamed.hashemi@kashanu.ac.ir,
(UWB), postal code: 30614, Pilsen, Czech Republic. hhashemi@rice.zcu.cz (H. Hashemi-Dezaki), sataher@kashanu.ac.ir (S.A. Taher).
https://doi.org/10.1016/j.asoc.2020.106741
1568-4946/© 2020 Elsevier B.V. All rights reserved.
Please cite this article as: A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher, Optimal microgrid’s protection coordination considering N-1 contingency and
optimum relay characteristics, Applied Soft Computing Journal (2020) 106741, https://doi.org/10.1016/j.asoc.2020.106741.
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
2
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
(5) R1 R4
R2 R6
Several time-current characteristics have been introduced in A
R3 R2
IEEE [41] and IEC [42] standards for overcurrent relays [43,44]. R4 R5
R5 R1
According to Annex A of IEC 60255-151 standard [42], the con-
R6 R3
stants of time-dependent operating time of overcurrent relays 3 24
R1 R4
curves are as Table 2 [45].
R2 R6
According to the nature of actual relays of the power system, R3 R2
E
the optimal coordination of protection relays should be formu- R4 R5
lated as an MINLP problem [46]. The PCSs and the TDSs are R5 R1
considered to be discrete and continuous variables, respectively. R6 R3
Also, by assigning an integer variable to each relay, its time- R1 R4
current characteristic constants (A and B) could be determined R2 R6
R3 R2
as (6). a, e, f, and g
R4 R5
0.14 0.02
⎧[ ]
R5 R1
if kj = 1
R6 R3
⎪
⎨
4 60
13.5 1 ∀j ∈ {1, 2, . . . , N }
[ ] [ ]
Aj Bj = if kj = 2 (6) R4 R5
B
R6 R3
⎪
⎩[ ]
80 2 if kj = 3
R2 R6
C
In this paper, the coordination of DOCRs are optimized under R5 R1
four scenarios as follows: R1 R4
D
R3 R2
• Scenario 1: The characteristics of all the relays are identical
and assumed to be NI.
Table 2
• Scenario 2: The characteristics of all the relays are identical Constants of overcurrent relays’ time-current characteristics.
and assumed to be VI.
No. Curve type A B
• Scenario 3: The characteristics of all the relays are identical
1 Normally inverse (NI) 0.14 0.02
and assumed to be EI.
2 Very inverse (VI) 13.5 1
• Scenario 4: The characteristics of relays are smartly selected. 3 Extremely inverse (EI) 80 2
The smart selection of curve types for DOCRs is one of the most the simplest scenario, which does not exist the decision variables
important contributions of this article in comparison to other of curve types) could be defined as (13).
existing methods like [4]. 0.14
Scenarios 1, 2, and 3 have been introduced to highlight the t = f (Ip, TDS ) = TDS ( )0.02
impacts of the relays’ characteristics on the OF (total operating Isc
CTR×Ip
−1
times of DOCRs). Scenario 1 has been introduced based on the
∂ 2f ∂ 2f
⎡ ⎤
method of [4]. But the use of VI and NI for all DOCRs considering (13)
⎢ ∂ TDS 2 ∂ TDS .∂ Ip ⎥
[ ]
all system topologies has not been studied in other available H H12
⇒ H(f ) = 11 =⎢
⎣ ∂ 2f
⎥
research works. Although it is possible to reduce the operating H21 H22 ∂ 2f ⎦
time of DOCRs by selecting the VI or EI for all relays, the best ∂ Ip.∂ TDS ∂ Ip2
results are achievable by applying the proposed method under
Also, the arrays of the Hessian matrix defined in (13) are
scenario 4. The advantages of scenario 4 with a smart selection of
calculated as (14)–(16).
standard relays characteristics are highlighted by the comparison
of the obtained results under various scenarios. H11 = 0 (14)
The constraints of DOCR settings can be given as (8)–(9) [47]:
(11) (16)
The CTI constraints are taken into account when the NEFs and
The CTR and Isc are constants parameters, and they are consid-
the FEFs occur. Usually, when the curve type of all DOCRs are
ered as OP’s inputs. In addition, Ip and TDS are positive variables
identical, and the CTI is set to 200 ms for the fault on the near-end
according to the introduced lower bounds. Hence, it is concluded
of the protected line (the maximum magnitude of SCC passing
that all Hessian matrix’ arrays shown in (14)–(16) are positive. As
through the primary relay), the CTI constraint for other faults will
shown in (17), the trace and determinant of the Hessian matrix
be satisfied. Under scenario 4 that the curve types of DOCRs are
are positive and negative, respectively. Based on the mathemati-
not identical, the consideration of (11) is much more emphasized. cal expression of eigenvalues and their relations to the trace and
determinant values in (18), it is distinguished that one of the
2.2. Analysis of the proposed OP’s convexity eigenvalues is negative. Therefore, it is not possible to note that
the proposed OF is convex.
An OP will be convex if both OF and constraint are convex.
H11 > 0
⎧
Otherwise, the OP is a non-convex problem. The Hessian matrix, ⎪
⎪
⎪
as presented in (12), is one of the approaches to judge about ⎨H12 > 0
⎪
⎪
Trace (H ) = H11 + H22 > 0
{
convexity of a function [54]. If the Hessian matrix is a positive ⇒
definite matrix (eigenvalues are positive), the function would be ⎪
⎪
⎪H21 > 0 |H | = H11 × H22 − H12 × H21 = 0 − H12 × H21 < 0
convex.
⎪
⎪
H22 > 0
⎩
∂ 2f ∂ 2f ∂ 2f
⎡ ⎤
··· (17)
⎢ ∂ x2
⎢ 1
∂ x1 ∂ x2 ∂ x1 ∂ xn ⎥
⎥
⎢ ∂ 2f ∂ 2f ∂ 2f ⎥
··· λ1 + λ2 = Trace (H ) > 0
⎢ ⎥ {
∂x ∂x ∂ x22 ∂ x2 ∂ xn ⎥
⎢ ⎥
H(f ) = ⎢
⎢ 2 1 (12) (18)
⎢ . .. .. ⎥ λ1 × λ2 = |H | < 0
⎥
⎢ .. ..
⎢ . . . ⎥ ⎥
⎣ ∂ 2f ∂ f
2
∂ 2f ⎦ Although using the metaheuristic-based algorithms increase
··· the chance to find global optima for non-convex functions, such
∂ xn ∂ x1 ∂ xn ∂ x2 ∂ x2n
methods do not guarantee to get the global optima. The com-
The objective function of the proposed OP includes different puting time might be so long, particularly for big dimensional
operating times of DOCRs. Hence, it is possible to analyse one problems like the proposed method under scenario 4, including
term of the proposed OF. If the parts of the proposed OF are all topologies and smart selection of time-current characteristics.
convex, it is concluded that the considered OF is convex. The Hence, the advantages of solving the proposed OP using hybrid
Hessian matrix of the tripping time of DOCRs under scenario 1 (as metaheuristic-LP algorithms are highlighted.
6
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
2.3. Hybrid algorithms The PCSs and the relays operating curves could be solved as
an MINLP problem and the TDS would be optimized as LP. Hence,
As described in (7), the relay operating curve is pre-defined the hybrid optimization algorithms are useful to solve the MINLP-
under scenarios 1, 2, and 3, while under scenario 4, the relay LP problem of optimal DOCRs coordination. The feasible region
characteristics are smartly selected. The integer variables are (search space) is reduced because of the decrement in the number
considered to optimize the type of DOCRs tripping curve. Under of decision variables. The decrease in the search space helps to
scenario 4, the integer variables corresponding to the smart se- rise the convergence speed and to avoid the local minima.
lection of relays characteristics also result in the non-linearity of In this article, the OP is solved by the hybrid GA-LP algo-
the OP. rithm [55,56] and the hybrid PSO-LP algorithm [57]. The mixed-
The other parameters of the OF, e.g. current transformer ratios integer non-linear and linear parts are solved by heuristic algo-
and SCCs passing through the DOCRs are the OP inputs. In this rithms such as GA/PSO and LP, respectively.
paper, the short circuit analysis is performed in DIgSIELNT, and The PCSs might be discrete and discrete for electromechanical
the obtained results are exported to MATLAB as the OP inputs. and numeric relays, respectively. It is necessary to note that the
The introduced OF and the operating time of primary DOCRs PCSs are the main cause of the optimal DOCRs’ coordination
under each system topology could be shown as (12). The operat- problems non-linearity.
ing time of the ith primary relay under the sth system topology In addition to other analyses, the comparison of the proposed
is divided into two terms. The first term of the operating time is OP using the PSO-LP and GA-LP algorithms helps guarantee to
defined as shown in (13). get the global optima. Moreover, by solving the proposed op-
As described in (13), by determining the PCSs and the relays timization problem, it is possible to show the flexibility of the
p,i
operating curves, αs,F would be constant, and a linear function proposed method for solving with different approaches. Further-
1
more, the performance of different optimization algorithms is
of TDSs is concluded. Hence, the introduced OF would be a linear
studied, according to comparative analyses, to select a better
first-order polynomial of TDSs, as shown in (14)–(15).
alternative for implementing the proposed method in practical
ns ns (
p,i
) cases. Furthermore, studies of GA-LP and PSO-LP highlight the
αsp,,Fi1 × TDSps ,i
∑∑ ∑∑
T = ts,F = (19) advantages of implementing modified hybrid metaheuristic-LP
1
s∈S i=1 s∈S i=1 algorithms in comparison to other non-hybrid conventional ones
like GA and PSO.
⎧ p,i Ap,i
αs,F1 = ( )Bp,i
p,i
2.3.1. Hybrid GA-LP algorithm
⎪
Isc ,s,F
⎪
Aj
⎨ 1
p,i − 1 ⇒ α p,i = = αsj ,F1 The GA is one of the most popular metaheuristic optimization
CTRp,i ×IP s,F1 )Bj
p,i
(
Isc ,s,F
algorithms [58], which is used in this paper to solve the proposed
⎪
1
⎪
⎩
∃!j ∈ {1, . . . , N } : Rps ,i = Rj p,i −1
CTRs ×IPj OP incorporating LP. In Fig. 2, the flowchart of solving the OP by
(20) the hybrid GA-LP has been shown.
As shown in Fig. 2, firstly, the network data and configuration
ns ( ) ∑N
[( ) ] should be defined in DIgSILENT software. The power flow studies
αsp,,Fi1 × TDSps ,i = under all possible topologies are conducted to determine the
∑∑ ∑ j
T = α s,F1 × TDSj
minimum allowed PCSs and current transformer ratios for relays.
s∈S i=1 j=1 s∈S
The short circuit analyses are performed to distinguish the SCCs
N
∑ passing through each relay during the faults on the near-end and
αj × TDSj
( )
= (21) far-end of the protected lines under various topologies.
j=1
The DIgSILENT Programming Language (DPL) has been used
to implement the power flow and short circuit analyses under
T = α1 × TDS1 + α2 × TDS2 + · · · + αj × TDSj + · · · various system topologies. Since the number of system topolo-
+ αN × TDSN (22) gies is increased due to consideration of N-1 contingencies, the
implementation of a general program to evaluate the power flow
The constraints are similarly linearized, as presented in (16)– and short circuit results is necessary. The DIgSILENT and MATLAB
(17). have been linked to export the power flow and short circuit
⎧ bx ,i
⎪
⎪ αs,F1 = cte. results as the OP inputs. All the required inputs of the OPs are
b ,i p,i
⎪
⎨α p,i = cte. The ‘‘αs,xF × TDSw − αs,F × TDSz ≥ CTI’’ exported from DIgSILENT to the MATLAB through an Excel file.
⎪
⎪
s,F1 1 1
⇒ The GA process starts, and an initial population is generated.
⎪
⎪
⎪ ∃!w ∈ {1, . . . , N } : Rsbx ,i = Rw is a linear inequality constraint.
The GA initial population consists of a certain number of chromo-
⎪
∃!z ∈ {1, . . . , N } : Rps ,i = Rz
⎪
somes, which each chromosome represents a solution for the OP.
⎩
The structure of each chromosome is made of a set of different
(23)
random PCSs and integer variables corresponding to the relays
p,i
⎧ bx ,i curve type, as shown in Fig. 3. The coefficients αs,F , which are
⎪
⎪αs,F2 = cte. 1
the function of PCSs and the selected type of relay curves, are
b ,i p,i
⎪
⎨α p,i = cte. The‘‘αs,xF × TDSw − αs,F × TDSz ≥ CTI’’ calculated for each chromosome. The LP OP is defined, and the
⎪
⎪
s,F2 2 2
⇒ TDSs are determined by solving an LP problem.
⎪
⎪
⎪∃!w ∈ {1, . . . , N } : Rsbx ,i = Rw is a linear inequality constraint.
In the viewpoint of soft computing, the chromosome structure
⎪
∃!z ∈ {1, . . . , N } : Rps ,i = Rz
⎪
in GA includes the kj as the decision variables, which should
⎩
selection of the inappropriate chromosomes in the next genera- penalty’s variable term depends on the number of constraints
tions, a penalty factor is considered as (14). The penalty factor violations. In (18), the C denotes a Boolean variable whichit’s zero
consists of significant constant value and a variable term. The value determines the LP has converged, and no penalty factor is
8
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
inertia weight and damping coefficient for a suitable exploration 3. Test results
and exploitation process. Furthermore, the velocity ranges are
selected according to the impacts of changes in different kinds The proposed method is applied to the meshed distribution
of decision variables, such as PCSs and types of time-current portion of the IEEE 14-bus test system [4,65], as shown in Fig. 6.
characteristics. The system under study data is extracted from [4,65]. This system
has 16 relays with the same range of existing TDSs and PCSs.
10
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Table 3
Number of topologies, primary and back-up DOCR pairs, and selectivity constraints under various cases.
Parameter Case 1 Case 2 Case 3 Case 4
Number of system topologies 1 9 2 15
Topologies a a, h, i, j, k, l, m, n, o a, d All topologies
Number of primary and back-up DOCR pairs 22 150 44 282
Number of selectivity constraints 44 300 88 564
Table 4 Table 5
CTR of the test system DOCRs. The SCCs of primary and back-up relays under the main topology.
Relay No. CTR Relay No. CTR Fault Short-circuit currents (kA)
1 1200:5 8 1200:5 location
2 1200:5 9 1200:5 Primary relay 1st back-up relay 2nd back-up relay
3 500:5 10 600:5 F1 R1 9.55963 R4 1.96884 R6 3.13256
4 500:5 12 600:5 R2 2.55331 R11 0.46916
5 1200:5 13 200:5 F2 R2 5.66743 R11 2.37091
6 1200:5 14 200:5 R1 3.77252 R4 0.99394 R6 1.31409
7 1000:5 15 900:5 F3 R3 10.1539 R2 2.55331 R6 3.13256
8 1000:5 16 900:5 R4 1.96884 R14 0.34926
F4 R4 5.80988 R14 2.76319
R3 3.07245 R2 1.21615 R6 0.80788
F5 R5 8.97961 R2 2.55331 R4 1.96884
R6 3.13256 R13 0.34926 R16 0.32357
F6 R6 6.63419 R13 2.15719 R16 1.19560
R5 4.14033 R2 1.41645 R4 0.52672
F7 R7 6.52925 R10 1.43480
R8 2.59527 R12 2.61653
F8 R8 3.41820 R12 3.41820
R7 4.59257 R10 0.96651
F9 R9 7.69469 R8 2.59527
R10 1.43480 R15 1.48599
F10 R10 2.79607 R15 2.79607
R9 3.04051 R8 0.97567
F11 R11 4.59257 R7 4.59257
R12 3.41820 R1 1.46013
F12 R12 7.02881 R1 3.77252
R11 2.37091 R7 2.41735
F13 R13 6.27753 R3 3.07245
R14 2.76319 R5 0.80788 R16 0.44241
F14 R14 8.65524 R5 4.14033 R16 1.19560
R13 2.15719 R3 0.52672
F15 R15 9.57805 R5 4.14033 R13 2.15719
Fig. 6. The meshed distribution portion of the IEEE 14-bus test system [4,65]. R16 1.19560 R9 1.25216
F16 R16 3.04051 R9 3.04051
R15 2.79607 R5 0.8930 R13 0.67730
11
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Fig. 7. Topologies of the meshed distribution portion of the IEEE 14-bus test system due to various contingencies and operation modes.
Therefore, it is reasonable to select the higher population size for analyses. According to the behaviour of the understudy OP and
the PSO algorithm than the GA one. its exploration and exploitation importance, the PSO algorithm
In the GA, the values for crossover and mutation operators parameters might be changed.
have been evaluated and selected based on the try and error ap- In Table 8, test results under various cases and scenarios
proach and the sensitivity analyses. Moreover, the values of PSO have been reported. The first result that claims attention is the
algorithm parameters such as ω, Damp, c1 , and c2 , which control significant value of the optimum OF of cases 4 under scenario
the interactions between the exploration and exploitation, are 1 (based on the method of [4] with a minor difference about
determined based on the try and error approach and sensitivity the OF). Although the satisfaction of all coordination constraints
12
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Table 6 implies that the speed of the protection scheme can be improved
Parameter setting used in the GA. by using the proposed method more than 6 times the scenario 1
Parameters Value (based on the method of [4]).
Scenarios 1, 2, and 3 16 In Fig. 8, the convergence diagrams of the OP under scenario 4
Number of decision variables
Scenario 4 32
for cases 1, 2, 3, and 4 are shown. The obtained results by GA-LP
Population size 150 and PSO-LP algorithms have been compared together. For Cases 1,
Maximum iterations 150
2, and 3, the desired convergence has occurred in both of GA-LP
Crossover rate 0.7
Mutation rate 0.3 and PSO-LP algorithms.
Pcte 3000 As revealed by results shown in Fig. 8, although the con-
Pv ar 100 vergence has been achieved under various cases, the required
interaction number of algorithms under case 4 is significantly
Table 7 higher than others. This is mainly because of the increment in
Parameter setting used in the PSO. the number of coordination constraints of case 4 (564 selectivity
Parameters Value and coordination constraints).
Scenarios 1, 2, and 3 16 As demonstrated in Table 8, the optimum values of the OF
Number of decision variables of case 4 (considering all system topologies due to N-1 con-
Scenario 4 32
Population size 180 tingencies) under scenario 1 (based on the method of [4]) and
Maximum iterations 150 scenario 4 (the proposed method) are 585.548 s and 94.2059 s,
Initial value of ω 1 respectively. The obtained test results illustrate that 491.3421 s
Damp 0.9996 (83.91%) improvement is achievable by applying the proposed
Maximum velocity 0.15
Minimum velocity −0.15 method in comparison to other available methods like [4].
c1 1.496 According to the statistical analysis of the hybrid optimization
c2 1.496 algorithms, it has been concluded that sometimes the PSO-LP
Pcte 3000 algorithm cannot find the initial feasible solutions. In contrast,
Pv ar 100
the GA-LP algorithm is always able to find a feasible solution.
The comparison of the statistical analysis of the GA-LP and PSO
algorithms implies that the GA-LP is more robust than PSO-
under various topologies has been guaranteed under scenario 1 LP algorithm for finding the feasible search space. This advan-
and case 4, the optimum OF would be considerable. The increase tage of the GA-LP is highlighted by increasing the number of
in the operating time of relays occurs because the increment optimization constraints.
of CTI selectivity constraints under cases 4 restricts the feasible Importing the initial feasible solution is one of the solutions
area. This may result in challenges in the speed of the protection that could be deployed to help the PSO-LP algorithm for improv-
scheme. ing its capability of searching in the feasible region. The obtained
The results of scenarios 2 by using the VI time-current char- results infer that if the PSO-LP can find the feasible search space,
acteristics infers that it is possible to improve the speed of the its performance and convergence to find the optimum values
protection scheme while all constraints have been satisfied. Since would be better than GA-LP algorithm.
the VI characteristic is a standard relay type curve, applying The statistical analysis results of solving the proposed OP using
scenario 2 based on the proposed method would be practical. GA-LP and PSO-LP algorithms under case 4 and scenario 4 are
The test results of scenario 3 show that there is no feasible presented in Table 9. The comparison of statistical results implies
solution under case 4. This implies that because of the behaviour that the deviation of GA-LP results is higher than the PSO-LP ones.
of EI characteristic, all the CTI constraints for NEFs and FEFs of These results confirm the better performance and robustness of
the lines under various topologies cannot be satisfied according the PSO-LP in finding the global optimum.
to the defined maximum allowed TDSs. When all topologies and In Fig. 9, the statistical test results of using PSO-LP and GA-
their corresponding CTI constraints have not been considered in LP for solving the proposed OP under case 4 and scenario 4 are
the optimal coordination of DOCRs similar to cases 1, 2, or 3, there shown. As can be seen, the OP has been solved 15 times with the
are some miscoordinations under some contingencies. GA-LP algorithm and 15 times with the PSO-LP algorithm. The
It can be observed that the best results have been obtained comparison of the obtained results implies the better optimality
under scenario 4, which incorporates the smart selection of relay robustness of the PSO-LP algorithm than GA-LP.
time-current characteristics. It is inferred that the results of cases By analyses of the convergence diagrams and statistical anal-
1 and 2 under scenarios 3 and 4 are the same. It means under ysis, it is possible to ensure that the results of the test are global
scenario 4, the suggested optimum curve types for all DOCRs are optimums.
EI and identic. The test results of case 4 under scenario 4 illus- Under case 4 and scenario 3, due to the limits corresponding
trates the advantages of the proposed method. As can be seen, the to the maximum allowable TDS, there is no feasible solution. The
desired speed of the protection scheme has been obtained while test results infer although the use of VI and EI curves might lead
all the constraints have also been satisfied by applying the smart to an increase in the speed of the protection scheme; in some
selection of relay type curves. The comparison of results of case 4 cases, the feasible solutions do not exist. This result highlights
Table 8
Optimum values of the OF of curve type-based scenarios under various cases.
Scenario No. Curve types The optimum value of the OF (s)
Case 1 Case 2 Case 3 Case 4
1 NI [4] 7.38729 75.2854 26.8345 585.548
2 VI 2.25295 21.6216 10.3237 148.734
3 EI 0.87858 9.0644 7.85284 –
4 The smart selection of NI, VI, and 0.87858 9.06913 4.81558 94.2059
EI (the proposed method)
13
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Fig. 8. The convergence diagram of the OP under Scenario 4 for (a) Case 1, (b) Case 2, (c) Case 3, and (d) Case 4.
Fig. 9. Statistical test results of PSO-LP and GA-LP for solving the proposed OP under case 4 and scenario 4.
14
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Table 11
Optimum values of the time dial and discrete PCSs of all cases under scenario 4.
Relay No. Case 1 Case 2 Case 3 Case 4
TDS Ip (pu) Ip (A) TDS Ip (pu) Ip (A) TDS Ip (pu) Ip (A) TDS Ip (pu) Ip (A)
R1 0.134 2.5 600 0.181 2.5 600 0.158 2.5 600 0.430 0.8 192
R2 0.052 2.5 600 0.068 2.5 600 0.085 2.5 600 1.061 1 240
R3 0.114 2 480 0.138 2 480 0.116 2 480 1.823 1 240
R4 0.188 2.5 250 0.454 2.5 250 0.297 2.5 250 0.711 2 200
R5 0.130 2.5 600 4.868 0.5 120 0.216 2 480 1.798 0.5 120
R6 0.079 2.5 600 0.144 2.5 600 0.199 2 480 0.582 1.5 360
R7 0.276 2.5 500 0.324 2.5 500 0.235 0.5 100 1.523 0.5 100
R8 0.076 2.5 500 0.089 2.5 500 0.191 2.5 500 0.427 2 400
R9 0.073 2.5 600 0.091 2.5 600 1.351 0.6 144 3.339 2 480
R10 0.061 1.5 360 0.078 1.5 360 0.059 2.5 600 0.271 2 480
R11 0.190 2.5 300 0.210 2.5 300 0.092 2 240 0.964 2 240
R12 0.537 2.5 300 0.599 2.5 300 0.880 2.5 300 0.766 1.5 180
R13 1.465 2.5 100 4.558 2 80 1.648 2.5 100 1.759 2.5 100
R14 2.172 2.5 100 3.996 2 80 2.327 2.5 100 1.875 2.5 100
R15 0.132 2.5 450 0.149 2.5 450 0.202 2.5 450 0.638 2.5 450
R16 0.058 1.5 270 0.279 1 180 0.153 1 180 2.861 0.5 90
Table 12
Optimum values of the continuous PCSs and TDSs of all cases under scenario 4.
Relay No. Case 1 Case 2 Case 3 Case 4
TDS Ip (pu) Ip (A) TDS Ip (pu) Ip (A) TDS Ip (pu) Ip (A) TDS Ip (pu) Ip (A)
R1 0.134 2.5 600 0.181 2.5 600 0.158 2.5 600 4.975 0.718 172.3
R2 0.052 2.5 600 0.068 2.5 600 0.085 2.5 600 1.454 0.4942 118.6
R3 0.098 2.159 518.1 0.132 2.042 490.1 0.107 2.081 499.4 1.711 0.423 42.3
R4 0.207 2.384 238.4 0.454 2.5 250 0.298 2.5 250 2.123 0.622 62.2
R5 0.130 2.5 600 4.864 0.5 120 0.157 2.345 562.8 0.5 1.642 394
R6 0.079 2.5 600 0.144 2.5 600 0.173 2.138 513.1 1.748 0.401 96.24
R7 0.276 2.5 500 0.324 2.5 500 0.129 1.873 374.6 0.5 2.923 584.6
R8 0.076 2.5 500 0.089 2.5 500 0.190 2.5 500 2.3938 0.312 62.4
R9 0.073 2.5 600 0.091 2.5 600 1.940 0.5 120 2.499 0.126 30.24
R10 0.050 1.644 394.5 0.051 1.827 438.5 0.062 2.5 600 2.473 0.253 60.72
R11 0.190 2.5 300 0.210 2.5 300 0.792 0.5 60 2.069 0.857 102.8
R12 0.537 2.5 300 0.599 2.5 300 0.879 2.5 300 1.356 4.208 504.9
R13 1.465 2.5 100 3.393 2.316 92.64 2.153 2.186 87.44 2.5 1.499 59.96
R14 2.172 2.5 100 2.556 2.5 80 2.328 2.5 100 2.5 1.777 71.08
R15 0.132 2.5 450 0.148 2.5 450 0.207 2.5 450 2.499 0.578 103.6
R16 0.05 1.617 291 0.217 1.130 203.4 0.077 1.39 250.2 0.5 2.753 495.5
15
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Table 13 Table 15
The total operating times of primary and back-up relays and number of The operating times of primary and back-up relays of case 4 and scenario 4
coordination violations of different cases under scenario 4. under various faults.
Index Case 1 Case 2 Case 3 Case 4 Fault location Relays operating times (s)
ns
Primary relay 1st back-up relay
p ,i
∑∑
ts,F 19.9556 26.0829 28.2336 94.2059
1 F1 R1 0.125 R4 1.0203
SCase4 i=1
ns R1 0.125 R6 0.8731
b ,i
∑∑
ts,xF 105.4169 161.5547 138.6495 356.7405 R2 1.0924 R11 14.769
1
SCase4 i=1
F2 R2 0.5645 R11 4.2892
ns R1 0.7092 R4 2.6789
p ,i
∑∑
ts,F 77.3694 110.1226 101.0661 272.7371 R1 0.7092 R6 3.9458
2
SCase4 i=1 F3 R3 0.2547 R2 1.0924
ns R3 0.2547 R6 0.8731
b ,i
∑∑
ts,xF 1480.246 4224.546 1336.422 2104.226 R4 1.0203 R14 9.1821
2
SCase4 i=1 F4 R4 0.3241 R14 0.9197
Number of coordination 133 37 78 0 R3 0.8946 R2 2.7361
constraint violations R3 0.8946 R6 3.175
F5 R5 0.2972 R2 1.0924
R5 0.2972 R4 1.0203
R6 0.8731 R13 7.8679
topologies due to N-1 contingencies, including the islanding and R6 0.8731 R16 39.074
F6 R6 0.3978 R13 1.0024
grid-connected modes (case 4) have been considered to calculate
R6 0.3978 R16 3.0262
the primary and back-up relays. The test results show that the R5 0.6469 R2 2.6928
operating times of primary relays under scenario 1 is more than R5 0.6469 R4 4.6419
6 times the value of scenario 4. F7 R7 1.1792 R10 2.5792
The comparison of the operating times of back-up relays also R8 0.564 R12 0.8463
F8 R8 0.3736 R12 0.5736
shows the advantages of the proposed method of intelligent R7 1.3899 R10 3.4772
time-characteristic selection of protection relays. The 65.19% and F9 R9 0.364 R8 0.5640
18.83% decrement in operating times of back-up relays under R10 1.5792 R15 2.8903
the faults on the near-end have been achieved by applying the F10 R10 0.8854 R15 1.0854
R9 1.1985 R8 1.4796
scenario 4 in comparison to scenarios 1 (based on the proposed
F11 R11 1.2076 R7 2.8399
method of [4]) and 2, respectively. R12 0.5736 R1 3.1394
The comparison of operating times of back-up relays when a F12 R12 0.1544 R1 0.7092
fault occurs on the far-end infers that the 2.79% and 25.89% im- R11 1.4892 R7 4.7420
provement in the operating times have been obtained by applying F13 R13 0.3361 R3 0.8946
R14 0.9197 R5 20.161
the proposed method (scenario 4) in comparison with those of R14 0.9197 R16 2.6965
scenario 1 (based on the proposed method of [4]) and scenario 2. F14 R14 0.2889 R5 3.0262
Although the better operating times of protection relays can R14 0.2889 R16 0.6469
be achieved by the use of VI or EI curves under scenarios 2 and R13 1.0024 R3 7.2694
F15 R15 0.0961 R5 1.0024
3, it is possible to find no feasible solution. For instance, there is
R15 0.961 R13 0.6469
no feasible area for the OP under scenario 3 and case 4. R16 3.0262 R9 8.4974
The test results of Table 14 guarantee the optimum conditions F16 R16 0.5415 R9 1.1985
of the protection scheme by applying the proposed method under R15 1.0854 R5 3.7071
scenario 4 and case 4. R15 1.0854 R13 2.6710
In Table 15, the operating times of primary and back-up relays
under various faults have been reported. The first result that
claims attention is the operating time of primary relays. The 1 or 3 s. Hence, by applying the proposed method, it is desired
operating times of primary relays (except R16 when a fault occurs to satisfy the devices’ thermal withstand constraints under faults
on F15) are less than 1.5 s while those of [4] was greater than 3 s. and contingencies. However, the operating times of back-up re-
The comparison of the test results and those of [4] emphasizes lays according to the proposed method are considerable, and it
the advantages of the proposed method. The microgrid devices can be concerned in future works.
have a certain specification of the time of short-time withstand In Table 16, some typical conditions under cases 1 and 4 and
current. The discussed time of medium voltage devices is usually scenarios 1 and 4 are presented. As can be seen in Table 16,
Table 14
The total operating times of primary and back-up relays of case 4 under various scenarios.
Index Scenario 1 (NI) [4] Scenario 2 (VI) Scenario 3 (EI) Scenario 4 (smart
selection of NI, VI,
and EI curves)
ns
p,i
∑∑
ts,F 585.5488 148.7346 – 94.2059
1
SCase4 i=1
ns
b ,i
∑∑
ts,xF 1024.9595 439.5270 – 356.7405
1
SCase4 i=1
ns
p,i
∑∑
ts,F 773.1441 338.7461 – 272.7371
2
SCase4 i=1
ns
b ,i
∑∑
ts,xF 2164.695 2839.642 – 2104.226
2
SCase4 i=1
16
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Table 16
Analyses of the operating times and coordination constraints corresponding to R14 (the main relay) and R5 and R16 (the back-up
relays) when a fault occurs at F14 under different cases and scenarios values of the continuous PCSs and TDSs of all cases under
scenario 4.
Case & Scenario No. Topology Relays operating times (s) Coordination constraint
Primary relay Back-up relay
R14 0.47351 R5 0.67351 OK
Main
R14 0.47351 R16 0.67351 OK
R14 0.50952 R5 0.94888 OK
Islanded mode
Case 1 & Scenario 1 R14 0.50952 R16 1.14458 OK
R14 0.53175 R5 0.66814 Not OK
Bus 6 DG outage
R14 0.53175 R16 0.66798 Not OK
R14 0.47999 R5 0.73842 OK
Line 1–4 outage
R14 0.47999 R16 0.68069 OK
R14 2.47911 R5 3.34834 OK
Main
R14 2.47911 R16 3.37827 OK
R14 2.65844 R5 3.99016 OK
Islanded mode
Case 4 & Scenario 1 R14 2.65844 R16 4.44135 OK
R14 2.76853 R5 3.33350 OK
Bus 6 DG outage
R14 2.76853 R16 3.36211 OK
R14 2.51150 R5 3.51984 OK
Line 1–4 outage
R14 2.51150 R16 3.22881 OK
R14 0.29591 R5 0.72454 OK
Main
R14 0.29591 R16 1.30432 OK
R14 0.40211 R5 1.28787 OK
Islanded mode
Case 4 & Scenario 4 R14 0.40211 R16 4.45211 OK
R14 0.47661 R5 0.71327 OK
Bus 6 DG outage
R14 0.47661 R16 1.27292 OK
R14 0.31370 R5 0.86075 OK
Line 1–4 outage
R14 0.31370 R16 1.03188 OK
under case 1 without consideration of all system topologies, the analyses of R14, R5, and R16 when a fault occurs at F14 have
constraint violations occur under the islanding operating mode been presented in Fig. 10. The DIgSILENT test results validate the
and due to the outage of DG connected to Bus 6. These problems satisfaction of all selectivity constraints.
corresponding to the coordination constraints violations have The statistical analysis of hybrid optimization algorithms, the
been solved under case 4 by considering all system topologies and comparison of different optimization algorithms’ test results, and
operating modes. the cross-checking of coordination constraints satisfaction guar-
Moreover, in Table 19, the operating time of typical relays antee the validity of the proposed method.
under scenario 1 and scenario 4 for case 4 have been compared. To illustrate the advantages of solving the proposed OP using
The comparison test results illustrate that by applying the pro- GA-LP and PSO-LP in comparison to non-hybrid GA and PSO algo-
posed method (case 4 and scenario 4), there is no coordination rithms, the test system under Case 1 and Scenario 1 (as the most
constraint violation while the relays operating time has been simple condition in the viewpoint of soft computing aspects) is
reduced in comparison to scenario 1. studied, as depicted in Fig. 11. Firstly, the setting parameters of
Finally, the obtained optimization results, such as the opti- GA and PSO were selected similar to those of GA-LP and PSO-LP,
mum values of the PCSs, TDSs, and relay type curves, are exported but experimental analyses inferred that it is not possible to obtain
to the DIgSILENT. The settings of all DOCRs of the test system the global optima with these settings. Accordingly, experimental
are assigned according to the obtained values. To validate the and sensitivity analyses have been performed to determine the
optimum test results and coordination constraints violations, the suitable settings for GA and PSO algorithms. Experimental and
relays coordination under various system topologies is evalu- sensitivity analyses showed that by selecting 1000 as the pop-
ated in DIgSILENT. The deployment of the actual types of well- ulation size and similar values for other setting parameters, as
known commercial DOCRs in DIgSILENT and the study of different described in Tables 6 and 7, the global optima is achievable. The
behaviours of the distribution system based on its nature and first result that claims the attention is the required population
characteristics through the validation process is useful. size of GA and PSO in comparison to GA-LP and PSO-LP. The
Finally, the obtained optimization results, such as the opti- comparative results illustrate the effectiveness of the proposed
mum values of the PCSs, TDSs, and relay type curves, are exported hybrid GA-LP and PSO algorithms to solve the OP. Moreover, as
to the DIgSILENT. The settings of all DOCRs of the test system revealed by Fig. 11, the convergence occurs earlier for the PSO-LP
are assigned according to the obtained values. To validate the and GA-LP in comparison to the GA and PSO.
optimum test results and coordination constraints violations, the The consideration of different topologies and corresponding
relays coordination under various system topologies is evalu- selectivity constraints leads to complicate the searching in the
ated in DIgSILENT. The deployment of the actual types of well- feasible area. On the other hand, an increase in the number
known commercial DOCRs in DIgSILENT and the study of different of decision variables (considering the type of operating curves
behaviours of the distribution system based on its nature and in the proposed method based on the smart selection of re-
characteristics through the validation process is useful. lays’ characteristics) increases the complexity of the OP. There-
The coordination of all primary and back-up relays under fore, the advantages of solving the proposed OP using the GA-
various system topologies due to N-1 contingencies and operating LP and PSO-LP would be more highlighted in other cases and
modes have been checked in DIgSILENT. The typical coordination scenarios.
17
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Fig. 10. The operating curves of R14 (the main relay) and R5 and R16 (the back-up relays) obtained by DIgSILENT simulations according to optimum setting results
of Scenario 4 and Case 4 under (a) the main topology, (b) the islanded operation mode, (c) the outage of DG unit connected to Bus 6, and (d) the outage of line
connected to Buses 1 and 4.
have been presented in Table 17. Test results infer than the
performance of the tuned GA is significantly better than other
pre-defined conventional GA without any special modifications.
In addition, the OP under scenario 4 and case 3 has been solved
15 times using the PSO in various modifications, and the sensi-
tivity analysis results of different inertia weight damping rates
and velocity ranges for PSO have been presented in Tables 18
and 19, respectively. Test results illustrate the advantages of the
tuned PSO in comparison to other pre-defined conventional PSO
without any special modifications.
4. Conclusion
Fig. 11. Convergence diagram of the OP under Scenario 1 and Case 1. In this paper, a new method has been developed to optimize
the microgrids’ protection schemes by incorporating the smart
selection of standard relays time-current characteristics consid-
As explained in the proposed methodology, the tuned GA and ering all system topologies due to under N-1 contingencies. The
PSO algorithms have been used in this paper to improve the introduced scenarios, which use NI, VI, EI characteristics for all
performance of solving the OP. The OP under scenario 4 and case relays, and the smart selection of relays operating curves have
3 has been solved 15 times using the GA in various modifications, been studied under various cases based on the system topologies.
and the sensitivity analysis results of different tunings for GA By applying the proposed optimal protection coordination of mi-
crogrids considering all system topologies and smart selection of
18
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
Table 17
Analyses of the GA’s performance for different tunings under scenario 4 and case 3.
Item No. Description of tunings and Number of required iterations Computing time to
modifications to converge the solutions converge the solutions (s)
1 Single-point crossover and ordinary 118 338.6057
mutation operators
2 Double-point crossover and ordinary 149 419.8944
mutation operators
3 Uniform crossover and ordinary 126 351.7586
mutation operators
4 Combination of various crossovers and 95 260.9367
ordinary mutation operators
5 Combination of various crossovers and 45 129.3429
modified mutation operators
19
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
[12] R. Jalilzadeh Hamidi, A. Ahmadian, R. Patil, A. Asadinejad, Optimal time- [32] A.A. Kida, A.E. Labrador Rivas, L.A. Gallego, An improved simulated
current graded coordination of multistage inverse-time overcurrent relays annealing–linear programming hybrid algorithm applied to the optimal
in distribution networks, Int. Trans. Electr. Energy Syst. 29 (5) (2019) coordination of directional overcurrent relays, Electr. Power Syst. Res. 181
e2841, http://dx.doi.org/10.1002/2050-7038.2841, 2019/05/01. (2020) 106197, http://dx.doi.org/10.1016/j.epsr.2020.106197, 2020/04/01/.
[13] A.J. Urdaneta, L.G. Pérez, J.F. Gómez, B. Feijoo, M. González, Presolve anal- [33] A. Darabi, M. Bagheri, G.B. Gharehpetian, Dual feasible direction-finding
ysis and interior point solutions of the linear programming coordination nonlinear programming combined with metaheuristic approaches for exact
problem of directional overcurrent relays, Int. J. Electr. Power Energy Syst. overcurrent relay coordination, Int. J. Electr. Power Energy Syst. 114 (2020)
23 (8) (2001) 819–825, http://dx.doi.org/10.1016/S0142-0615(00)00097-1, 105420, http://dx.doi.org/10.1016/j.ijepes.2019.105420, 2020/01/01/.
2001/11/01/. [34] Y. Damchi, M. Dolatabadi, H.R. Mashhadi, J. Sadeh, MILP approach for
[14] A.S. Noghabi, H.R. Mashhadi, J. Sadeh, Optimal coordination of directional optimal coordination of directional overcurrent relays in interconnected
overcurrent relays considering different network topologies using interval power systems, Electr. Power Syst. Res. 158 (2018) 267–274, http://dx.doi.
linear programming, IEEE Trans. Power Deliv. 25 (3) (2010) 1348–1354, org/10.1016/j.epsr.2018.01.015, 2018/05/01/.
http://dx.doi.org/10.1109/TPWRD.2010.2041560. [35] S.T.P. S, P.P. Verma, K.S. Swarup, A novel convexified linear program for
[15] D. Birla, R.P. Maheshwari, H.O. Gupta, A new nonlinear directional over- coordination of directional overcurrent relays, IEEE Trans. Power Deliv. 34
current relay coordination technique, and banes and boons of near-end (2) (2019) 769–772, http://dx.doi.org/10.1109/TPWRD.2019.2892606.
faults based approach, IEEE Trans. Power Deliv. 21 (3) (2006) 1176–1182, [36] M. Lwin, J. Guo, N.B. Dimitrov, S. Santoso, Stochastic optimization for
http://dx.doi.org/10.1109/TPWRD.2005.861325. discrete overcurrent relay tripping characteristics and coordination, IEEE
[16] P.P. Bedekar, S.R. Bhide, Optimum coordination of directional overcurrent Trans. Smart Grid 10 (1) (2019) 732–740, http://dx.doi.org/10.1109/TSG.
relays using the hybrid GA-NLP approach, IEEE Trans. Power Deliv. 26 (1) 2017.2751596.
(2011) 109–119, http://dx.doi.org/10.1109/TPWRD.2010.2080289. [37] A. Korashy, S. Kamel, A.-R. Youssef, F. Jurado, Modified water cycle
[17] H.H. Zeineldin, E.F. El-Saadany, M.M.A. Salama, Optimal coordination of algorithm for optimal direction overcurrent relays coordination, Appl.
overcurrent relays using a modified particle swarm optimization, Electr. Soft Comput. 74 (2019) 10–25, http://dx.doi.org/10.1016/j.asoc.2018.10.
Power Syst. Res. 76 (11) (2006) 988–995, http://dx.doi.org/10.1016/j.epsr. 020, 2019/01/01/.
2005.12.001, 2006/07/01/. [38] H.R.E.H. Bouchekara, M. Zellagui, M.A. Abido, Optimal coordination of
[18] A.S. Noghabi, J. Sadeh, H.R. Mashhadi, Considering different network directional overcurrent relays using a modified electromagnetic field opti-
topologies in optimal overcurrent relay coordination using a hybrid GA, mization algorithm, Appl. Soft Comput. 54 (2017) 267–283, http://dx.doi.
IEEE Trans. Power Deliv. 24 (4) (2009) 1857–1863, http://dx.doi.org/10. org/10.1016/j.asoc.2017.01.037, 2017/05/01/.
1109/TPWRD.2009.2029057. [39] M.N. Alam, B. Das, V. Pant, An interior point method based protection co-
[19] M.Y. Shih, A. Conde Enríquez, T.-Y. Hsiao, L.M. Torres Treviño, Enhanced ordination scheme for directional overcurrent relays in meshed networks,
differential evolution algorithm for coordination of directional overcurrent Int. J. Electr. Power Energy Syst. 81 (2016) 153–164, http://dx.doi.org/10.
relays, Electr. Power Syst. Res. 143 (2017) 365–375, http://dx.doi.org/10. 1016/j.ijepes.2016.02.012, 2016/10/01/.
1016/j.epsr.2016.09.011, 2017/02/01/. [40] R. Mohammadi Chabanloo, M. Ghotbi Maleki, S.M. Mousavi Agah, E.
[20] V.N. Rajput, K.S. Pandya, Coordination of directional overcurrent relays Mokhtarpour Habashi, Comprehensive coordination of radial distribution
in the interconnected power systems using effective tuning of harmony network protection in the presence of synchronous distributed generation
search algorithm, Sustain. Comput.: Inform. Syst. 15 (2017) 1–15, http: using fault current limiter, Int. J. Electr. Power Energy Syst. 99 (2018)
//dx.doi.org/10.1016/j.suscom.2017.05.002, 2017/09/01/. 214–224, http://dx.doi.org/10.1016/j.ijepes.2018.01.012, 2018/07/01/.
[21] H. Ghodsi, M.J. Khanjani, A.A. Beheshti, Evaluation of harmony search [41] IEEE Std C37.112-2018, Inverse-Time Characteristic Equations for Overcur-
optimization to predict local scour depth around complex bridge piers, rent Relays, 2018.
Civ. Eng. J. 4 (2) 402–412, http://dx.doi.org/10.28991/cej-0309100. [42] IEC 60255-151-2009, Measuring relays and protection equipment - Part
[22] M.-T. Yang, A. Liu, Applying hybrid PSO to optimize directional overcurrent 151: Functional requirements for over/under current protection, 2009.
relay coordination in variable network topologies, J. Appl. Math. 2013 [43] M.F. Kotb, M. El-Saadawi, E.H. El-Desouky, Overcurrent protection relay-
(2013) 879078, http://dx.doi.org/10.1155/2013/879078, 2013/03/10. based Arduino Uno for FREEDM system, Int. Trans. Electr. Energy
[23] M. Ojaghi, Z. Sudi, M. Azari, Local online adaptive technique for optimal Syst. 29 (6) (2019) e12017, http://dx.doi.org/10.1002/2050-7038.12017,
coordination of overcurrent relays within high voltage substations, Int. 2019/06/01.
Trans. Electr. Energy Syst. 26 (8) (2016) 1810–1828, http://dx.doi.org/10. [44] A. Yazdaninejadi, D. Nazarpour, V. Talavat, Coordination of mixed distance
1002/etep.2183, 2016/08/01. and directional overcurrent relays: Miscoordination elimination by utiliz-
[24] U.F.E.R. Commission et al., Mandatory reliability standards for the ing dual characteristics for DOCRs, Int. Trans. Electr. Energy Syst. 29 (3)
bulk-power system, Order (693) (2007) 72. (2019) e2762, http://dx.doi.org/10.1002/etep.2762, 2019/03/01.
[25] A. Hussain, M. Aslam, S.M. Arif, N-version programming-based protection [45] M. Shabani, A. Karimi, A robust approach for coordination of directional
scheme for microgrids: A multi-agent system based approach, Sustain. overcurrent relays in active radial and meshed distribution networks
Energy Grids Netw. 6 (2016) 35–45, http://dx.doi.org/10.1016/j.segan.2016. considering uncertainties, Int. Trans. Electr. Energy Syst. 28 (5) (2018)
02.001, 2016/06/01/. e2532, http://dx.doi.org/10.1002/etep.2532, 2018/05/01.
[26] B.K. Chaitanya, A. Yadav, M. Pazoki, An improved differential protection [46] A.S. Noghabi, J. Sadeh, H.R. Mashhadi, Parameter uncertainty in the optimal
scheme for micro-grid using time-frequency transform, Int. J. Electr. Power coordination of overcurrent relays, Int. Trans. Electr. Energy Syst. 28 (7)
Energy Syst. 111 (2019) 132–143, http://dx.doi.org/10.1016/j.ijepes.2019. (2018) e2563, http://dx.doi.org/10.1002/etep.2563, 2018/07/01.
04.015, 2019/10/01/. [47] Z. Moravej, H. Mohaghegh Ardebili, A new objective function for adaptive
[27] S. Khanbabapour, M.E.H. Golshan, Synchronous DG planning for simulta- distance and directional over-current relays coordination, Int. Trans. Electr.
neous improvement of technical, overcurrent, and timely anti-islanding Energy Syst. 28 (9) (2018) e2592, http://dx.doi.org/10.1002/etep.2592,
protection indices of the network to preserve protection coordination, 2018/09/01.
IEEE Trans. Power Deliv. 32 (1) (2017) 474–483, http://dx.doi.org/10.1109/ [48] Y. Damchi, J. Sadeh, H. Rajabi Mashhadi, Preprocessing of distance and
TPWRD.2016.2538799. directional overcurrent relays coordination problem considering changes
[28] B. Fani, H. Bisheh, I. Sadeghkhani, Protection coordination scheme for in network topology, Int. Trans. Electr. Energy Syst. 26 (1) (2016) 32–48,
distribution networks with high penetration of photovoltaic generators, http://dx.doi.org/10.1002/etep.2065, 2016/01/01.
IET Gener. Transm. Distrib. 12 (8) (2018) 1802–1814, http://dx.doi.org/10. [49] J.D. Pico, D. Celeita, G. Ramos, Protection coordination analysis under a
1049/iet-gtd.2017.1229. real-time architecture for industrial distribution systems based on the
[29] M. Ghotbi Maleki, R. Mohammadi Chabanloo, M.R. Taheri, Mixed-integer Std IEEE 242-2001, in: 2015 IEEE Industry Applications Society Annual
linear programming method for coordination of overcurrent and distance Meeting, 2015, pp. 1–6, http://dx.doi.org/10.1109/IAS.2015.7356956.
relays incorporating overcurrent relays characteristic selection, Int. J. Electr. [50] J.D. Pico, D. Celeita, G. Ramos, Protection coordination analysis under a
Power Energy Syst. 110 (2019) 246–257, http://dx.doi.org/10.1016/j.ijepes. real-time architecture for industrial distribution systems based on the
2019.03.007, 2019/09/01/. Std IEEE 242-2001, IEEE Trans. Ind. Appl. 52 (4) (2016) 2826–2833, http:
[30] A. Yazdaninejadi, M.S. Naderi, G.B. Gharehpetian, V. Talavat, Protection //dx.doi.org/10.1109/TIA.2016.2538739.
coordination of directional overcurrent relays: new time current charac- [51] S.-A. Ahmadi, H. Karami, B. Gharehpetian, Comprehensive coordination of
teristic and objective function, IET Gener. Transm. Distrib. 12 (1) (2018) combined directional overcurrent and distance relays considering misco-
190–199, http://dx.doi.org/10.1049/iet-gtd.2017.0574. ordination reduction, Int. J. Electr. Power Energy Syst. 92 (2017) 42–52,
[31] S. S.T.P and S. S. K, Application of improved invasive weed optimization http://dx.doi.org/10.1016/j.ijepes.2017.04.008, 2017/11/01/.
technique for optimally setting directional overcurrent relays in power [52] IEEE recommended practice for protection and coordination of industrial
systems, Appl. Soft Comput. 79 (2019) 1–13, http://dx.doi.org/10.1016/j. and commercial power systems (ieee buff book), in: IEEE Std 242-2001
asoc.2019.03.045, 2019/06/01/. (Revision of IEEE Std 242-1986) [IEEE Buff Book], 2001, pp. 1–710.
20
A.M. Entekhabi-Nooshabadi, H. Hashemi-Dezaki and S.A. Taher Applied Soft Computing Journal xxx (xxxx) xxx
[53] E.C. Piesciorovsky, M.F. Ferrari Maglia, Comparison of high-speed adaptive [60] E. Naderi, M. Pourakbari-Kasmaei, H. Abdi, An efficient particle swarm
and nonadaptive backup overcurrent protection on fuse feeders with optimization algorithm to solve optimal power flow problem integrated
sensors, Int. Trans. Electr. Energy Syst. 29 (4) (2019) e2812, http://dx.doi. with FACTS devices, Appl. Soft Comput. 80 (2019) 243–262, http://dx.doi.
org/10.1002/etep.2812, 2019/04/01. org/10.1016/j.asoc.2019.04.012, 2019/07/01/.
[54] M. Kalhor, M. Rahmani, A. Kalhor, Locally convex-regions approxima- [61] A. Saljoughi, M. Mehrvarz, H. Mirvaziri, Attacks and intrusion detection in
tion using an incremental quadratic-based fuzzy clustering, Appl. Soft cloud computing using neural networks and Particle Swarm Optimization
Comput. 76 (2019) 369–379, http://dx.doi.org/10.1016/j.asoc.2018.12.027, Algorithms, Emerg. Sci. J. 1 (4) (2018) 179–192, http://dx.doi.org/10.28991/
2019/03/01/. ijse-01120.
[55] F.B. Bottura, W.M.S. Bernardes, M. Oleskovicz, E.N. Asada, Setting direc- [62] E. Naderi, H. Narimani, M. Fathi, M.R. Narimani, A novel fuzzy adaptive
tional overcurrent protection parameters using hybrid GA optimizer, Electr. configuration of particle swarm optimization to solve large-scale optimal
Power Syst. Res. 143 (2017) 400–408, http://dx.doi.org/10.1016/j.epsr.2016. reactive power dispatch, Appl. Soft Comput. 53 (2017) 441–456, http:
09.017, 2017/02/01/. //dx.doi.org/10.1016/j.asoc.2017.01.012, 2017/04/01/.
[56] M. Reisi-Nafchi, G. Moslehi, A hybrid genetic and linear programming [63] T. Khalaf, H. Çağlar, A. Çağlar, A. Hanoon, Particle Swarm Optimization
algorithm for two-agent order acceptance and scheduling problem, Appl. based approach for estimation of costs and duration of construction
Soft Comput. 33 (2015) 37–47, http://dx.doi.org/10.1016/j.asoc.2015.04. projects, Civ. Eng. J. 6 (2) (2020) 384–401, http://dx.doi.org/10.28991/cej-
027, 2015/08/01/. 2020-03091478.
[57] V.A. Papaspiliotopoulos, T.A. Kurashvili, G.N. Korres, Optimal coordination [64] F. Valdez, J.C. Vazquez, P. Melin, O. Castillo, Comparative study of the
of directional overcurrent relays in distribution systems with distributed use of fuzzy logic in improving particle swarm optimization variants for
generation based on a hybrid PSO-LP algorithm, in: MedPower 2014, 2014, mathematical functions using co-evolution, Appl. Soft Comput. 52 (2017)
pp. 1–6, http://dx.doi.org/10.1049/cp.2014.1697. 1070–1083, http://dx.doi.org/10.1016/j.asoc.2016.09.024, 2017/03/01/.
[58] S. Hashemi, I. Rahmani, Numerical comparison of the performance of [65] Power Systems Test Case Archive, University of Washington, Seattle, 2016,
genetic algorithm and particle swarm optimization in excavations, Civ. Eng. [Online]. Available: http://www2.ee.washington.edu/research/pstca/.
J. 4 (9) (2018) 2186–2196, http://dx.doi.org/10.28991/cej-03091149. [66] D. Espejel-Garcia, L. Ortíz Anchondo, C. Alvarez Herrera, A. Hernan-
[59] E. Shojaedini, M. Majd, R. Safabakhsh, Novel adaptive genetic algorithm dez Lopez, V. Espejel-García, A. Villalobos, An alternative vehicle counting
sample consensus, Appl. Soft Comput. 77 (2019) 635–642, http://dx.doi. tool using the Kalman Filter within MATLAB, Civ. Eng. J. 3 (2017) 1029,
org/10.1016/j.asoc.2019.01.052, 2019/04/01/. http://dx.doi.org/10.28991/cej-030935.
21