Next Article in Journal
Embedding Uncertain Temporal Knowledge Graphs
Previous Article in Journal
Modeling Spatial Development of the Economy Based on the Concept of Economic Complexity (on the Example of Aerospace Industry)
Previous Article in Special Issue
Application of the Conditional Optimization Method for the Synthesis of the Law of Emergency Control of a Synchronous Generator Steam Turbine Operating in a Complex-Closed Configuration Power System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Automated Settings of Overcurrent Relays Considering Transformer Phase Shift and Distributed Generators Using Gorilla Troops Optimizer

by
Abdelmonem Draz
,
Mahmoud M. Elkholy
and
Attia A. El-Fergany
*
Electrical Power and Machines Department, Zagazig University, Zagazig 44519, Egypt
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(3), 774; https://doi.org/10.3390/math11030774
Submission received: 9 January 2023 / Revised: 22 January 2023 / Accepted: 1 February 2023 / Published: 3 February 2023
(This article belongs to the Special Issue Mathematical Analysis on Automated Electric Systems)

Abstract

:
The relative protective devices are cascaded in a proper sequence with a proper min/max coordination time margin (CTM) to minimize the outage area of the network in case of fault condition. This manuscript addresses a new methodology based on the gorilla troops optimizer (GTO) to produce the best automated settings for overcurrent relays. In the GTO, the exploration and exploitation phases are realized using five methodologies. Three of them are used in the exploration phase and the other two in the exploitation phase. In the exploration phase, all gorillas are considered as candidate solutions and the best one is considered as the silverback gorilla. Then again, the exploitation phase comprises two steps: (i) the first one is the follow of silverback gorilla, and (ii) the second one is the competition for adult females. The latter mentioned offers an added advantage to the GTO framework to move forward steadily to global minima and to avoid trapping into local minima. Two test cases under numerous scenarios are demonstrated comprising an isolated real distribution network with distributed generations for the Agiba Petroleum company which is in the Western Desert of Egypt. The relay coordination problem is adapted as an optimization problem subject to a set of predefined constraints which is solved using the GTO including fixed and varied inverse IEC curves, in which the practical constraints including transformer phase shift and other scenarios for min/max fault conditions are dealt with. In due course, this current effort aims at proving the best strategy for achieving the smoothest coordination of overcurrent relays (OCRs), with the least obtained value of CTMs for the studied cases being established via the automated relay settings. At last, it can be pointed out that the GTO successfully dealt with this problem and was able to produce competitive answers compared to other competitors.

1. Introduction

Overcurrent (OC) and earth fault (EF) protections along the power system network play a vital role among other types of protection units for various voltage levels [1,2]. Cascading the operating sequence of these relative units is needed to minimize the outage of the power system to secure its operations. In regard to the EF, it is a simple process to achieve the coordination, especially since there are few units to be cascaded and, in general, the definite time (DT) characteristic is enough for this study. The latter is alternatively called the coordination of discrimination to ensure the arrangements of the operations of the main and backup OC protection units and to allow specific time margins, which are known as a coordination time margin (CTM). This time margin is normally varying from 0.2 ms to 0.4 s, and it actually depends on the technology and generation of the OC relays (OCRs). More specifically, between digital relays, the CTM of 0.2 s may be used and for electromechanical relays, the CTM is something around 0.5 s [2,3,4].
Manual achievement of the coordination is tedious and requires a lot of time. Thus, the computerized alternative to this is essential. Even for the available tools, it is still difficult to tackle these drawbacks as the interfering of the engineers is still required. In the last decade, many efforts have been performed to automate such studies with minimal interferences from the engineers. Among these methods are: expert systems [3], linear programming [5,6,7], the simplex method [8,9], random search [10], and mixed-integer non-linear programing [11]. The deficiencies of these aforementioned methods have been proven when they are applied to larger systems. On the other hand, many researchers have proposed various optimization methodologies to deal with the same problem, aiming to generate automated relay settings such as the slime mold algorithm (SMA) [12], water cycle algorithm [13,14], whale optimization algorithm [15,16], firefly algorithm [17], adaptive fuzzy directional bat algorithm [18], genetic optimizer [19], moth-flame optimization [20], JAYA [21,22], Harris Hawks’ optimization [21,23], nature-inspired root tree algorithm [24], electromagnetic field optimization algorithm [25], and particle swarm optimization [26,27,28].
Further considerable efforts to accommodate microgrids and the involvement of distributed generators (DGs) in the coordination study have been reported, such as the methods for DGs-integrated distribution networks considering system dynamics [29,30], adaptive OC relay (OCR) coordination in grid-connected wind farms [31], adaptive OCR coordination scheme for windfarm-integrated power systems [32], optimum coordination of OCRs to enhance microgrid EF protection scheme [33], and optimal coordination of overcurrent relays in microgrids [34,35,36,37,38].
Further to the above, a comprehensive survey has been presented in [2,39], in which the readers are invited to go through such efforts. Extra heuristic-based optimizers are still being used by the esteemed researchers in order to improve the quality of the relay coordination outcome with the ultimate objective of generating an automated setting. Until this moment, many trials have been performed in the same manner. More recently, the gradient-based optimizer [40], various versions of differential evolution [41,42,43], stochastic fractal search algorithm [44], flower pollination for combination between arc-flash and coordination [45], harmony search algorithm [46], grey wolf optimizer [47], and so on [48,49,50,51,52,53,54,55,56], have been presented. Moreover, the practical coordination model is investigated in distribution networks penetrated with motors and transformers as declared in [57]. Adaptive protection coordination in distribution networks with DGs is deployed in [58], while the implementation of unsupervised learning techniques is exploited in [59] for the coordination of OCRs in microgrids.
Taking a closer look at the above-mentioned survey, numerous methods have been undertaken to attain the optimal settings for OC relays in traditional and smart grids as well, yet there is still room for improvement to include more constraints to attain industrial trust and meet the requirements. In the same context, and in line with the no-free-lunch theorem, the authors are motived to employ the gorilla troops-based optimization (GTO) method [60] to tackle this problem with the hope of having a competitive outcome compared to the existing results available in the literature. In GTO, the exploration and exploitation processes are realized using five methodologies. It can be confirmed that the GTO has been applied successfully to estimate the ungiven parameters of the single and double-diode models [61]. In this context, the deployment of GTO is exploited in [62] to solve the optimization problem of the integration of renewable-based DGs in power systems.
In this current effort, the GTO is used to produce the optimal settings in an automated manner of OCRs for two test cases under different intentional scenarios with the minimal interference of users, and in which new concepts for understanding the point at which to start the relay coordination for min/max fault scenarios are proposed. The first case is a 15-bus network with DGs which is widely used in the literature, and the second case is a real power network based in West Desert in Egypt for the Agiba petroleum company.

2. Optimization Problem Formulation

It is obviously known that the relation between the fault current passing through the relay ( I f ) and the relay operating time ( t r i ) is an inverse one as shown in (1).
t r i = a ( I f I p u ) ß 1 .   T D
where: I p u is the relay current pickup, T D is the relay time dial setting, and a , and ß are constants varying with the relay type characteristics (CCs) as presented in Table 1. Figure 1 presents four standardized TCCs extracted from the IEC 60255-3 standard [1] plotted using a log-to-log scale.
The optimization process of OCRs in this paper threads through dedicated and ordered steps as follows:
  • Preparing the model which includes the relay pairs definition, the level of fault currents, and the lower and upper boundaries of the decision variables.
  • Constructing the fitness optimized function (FOF) that tends to minimize the total operating time (TOT) of the primary relays as disclosed in (2).
    F O F = i = 1 N P t r i
    where: N P is the total number of the primary relays in the study case.
  • Defining the lower and upper boundaries of independent and dependent constraints. The decision variables needed to be optimized represent the independent ones as demonstrated in (3)–(7).
    I p u i , m i n   I p u i     I p u i , m a x
    I p u i , m i n O L C × I f u l l   l o a d
    I p u i , m a x S F × I f , m i n
    T D i , m i n     T D i     T D i , m a x
    T C C i , m i n     T C C i     T C C i , m a x
    where: I p u i , m i n , and I p u i , m a x are the minimum and maximum values of the relay current pickup, respectively. In practice, I p u i , m i n shall be greater than the equipment full load current ( I f u l l   l o a d ) by a certain value nominated as the over loading capacity ( O L C ) . On the other hand, I p u i , m a x shall be lower than the minimum fault current ( I f , m i n ) by a certain value called the sensitivity factor ( S F ) . Moreover, the relay time dial shall be bounded between minimum ( T D i , m i n ) and maximum ( T D i , m a x ) value besides the T C C , as is also the case in digital relays. T C C i , m i n ,   and   T C C i , m a x are the lower and upper limits of the CCs’ type that have discrete values rather than other settings that have continuous values.
    The dependent constraints examined in this research lie in two types; the selectivity constraint and the minimum operating time constraint as dedicated in (8) and (9), respectively.
    C T M m i n , j   t b r i t p r i     C T M m a x , j
    t p r i     t m i n , i
    where: t b r i , and t p r i are the operating time of the backup and primary relay, respectively, at the same fault point. C T M m i n , j , and   C T M m a x , j are the minimum and maximum values of CTM, respectively, while t m i n , i is the minimum possible operating time of the protection relay by activating its instantaneous CCs.
  • Extracting the optimal values of the decision variables in addition to plotting the convergence trend of F O F .

3. Procedures of the GTO

The metaheuristic algorithms are more significant in solving many sophisticated engineering problems due to their simple implementation and are more superior than other heuristic techniques to crop global optimal solution. The metaheuristic techniques can be classified as: natural, swarm, physical, and human based. One of the new, nature-inspired algorithms which is inspired by the gorilla group trait is developed by [60] and is called GTO. In the GTO, the exploration and exploitation processes are implemented using five methodologies: three in the exploration phase and two in the exploitation phase. In the exploration phase, all gorillas are considered as nominee solutions and the best one is considered as the silverback gorilla. The three methodologies of the exploration phase can be summarized as: the resettlement to an unknown position when r a n d < controlled the variable ( p ); then the transition to other different gorilla is decided if rand r a n d 0.5 ; and lastly, the transition to a known position is selected when r a n d < 0.5 . These exploration processes can be depicted as:
G X ( k + 1 ) = { ( H L L L ) × r 1 + L L                                                                                                                                                       r a n d < p ( r 2 C 1 ) × X r ( k ) + S × C 2                                                                                                                                           r a n d 0.5 X ( k ) S × [ S × ( X ( k ) G X r ( k ) ) + r 3 × ( X ( k ) G X r ( k ) ) ]       r a n d < 0.5
where: G X ( k + 1 ) is the nominee location vector in the iteration of (k + 1) rank, X ( k ) is the existing vector of the gorilla location, r 1 ,   r 2   a n d   r 3 and r a n d are the updated random values between 0 and 1 in each iteration, H L , and L L are the higher and lower values of desired understudying problem variables, respectively, X r is a randomly selected member of the gorilla group, G X r is the one vector of the random gorilla candidate’s updated location in each phase. The parameters C 1 ,   C 2   a n d   S are calculated using:
C 1 = 1 + cos ( 2 r 4 ) [ 1 i t i t m a x ]
S = C 1 × r 5
C 2 = r 6 × X ( k )
where: r 4 are updated random variables between 0 and 1, i t ,     i t m a x are the current and maximum iteration, respectively, and r 5 is the random parameters between −1 and 1. The behavior of the gorilla silverback is emulated by (12) and r 6 is a random variable between C 1 and C 1 in the problem dimension.
The exploitation phase consists of two methodologies, the first one is the following of the silverback gorilla when the variable C 1   W and can be emulated by (14). However, the second one is the competition for adult females when C 1 < W and can be simulated by (15).
where: W is a set point before the optimization process.
G X ( k + 1 ) = S × ( | 1 N G | m = 1 N G G X m ( k ) ) 1 2 S × ( X ( k ) X s ) + X ( k )
where: X s is the silverback gorilla location, which is the best solution, G X m ( k ) describes each nominee gorilla’s vector location in iteration k, and N G is the gross number of gorillas.
G X ( m ) = X s ( 2 r 6 1 )   ( B e t a × E )   ( X s X ( k )  
where: r 6 is a random value between 0 and 1, B e t a is a set parameter before optimization start and E is the variable that simulates the violence on the solution dimension based on the value of the r a n d variable.
The X ( k ) is replaced by G X ( k ) when the FOF value of G X ( k ) is lower than one of X ( k ) .
The procedures of minimizing the FOF (i.e., the TOT of the primary relays) based on the GTO algorithm are depicted in Figure 2.

4. Study Cases and Results with Debates

The performance of the proposed GTO is evaluated in two various study cases with different topologies. The first one is the IEEE 15-bus system, which is deemed as a pure transmission network tackled many times before in the literature. The obtained results are compared to the latest powerful optimizers and manifest the superiority of the GTO over them for solving this highly constrained optimization problem. The second one is an isolated practical distribution network belonging to the Agiba petroleum company located in Egypt. Both networks are investigated using two scenarios; scenario one considers the fixed NI curve while scenario two optimizes the curve between the four standard IEC TCCs. Furthermore, the GTO control parameters are set as follows for better results: p = 0.000001 , B e t a = 4 , W = 0.9 , N G = 100 , and i t m a x = 500 .

4.1. Study Case 1: The IEEE 15-Bus Network

Figure 3 depicts the single-line diagram (SLD) of the IEEE 15-bus network and its system data obtained can be found in [12,14,40,45].
To validate the GTO results, the following assumptions are considered for a fair comparison with other algorithms: (i) an OLC between 100% to 150% of the full load current with no considerations on the minimum fault current conditions, the (ii) T D i , m i n = 0.05   s for scenario one and 0.01 s for scenario two while T D i , m a x = 1   s for both scenarios, (iii) C T M m i n , j = 0.2   s and C T M m a x , j = 0.4   s , and (iv) T C C i , m i n = 1 and T C C i , m a x = 4 .
Table 2 lists the optimized settings of DOCRs in the IEEE 15-bus network using the GTO for both scenarios. It is revealed that the GTO has been managed for selecting the EI curve for all relays in scenario two in the hope of achieving the best obtained FOF ever. The operating times of the primary/backup relays are recorded in Table 3 with no violations in the independent or dependent constraints. The entrenched fair comparison results in the obvious superiority of the GTO over other algorithms with various natures as announced in Table 4. The GTO achieves a TOT of 9.0775 s and 1.3962 s, attaining a 24.2% and a 43% reduction compared to SMA for scenarios one and two, respectively. Moreover, the FOF smooth convergence trend using the GTO for this highly penetrated DG network is shown in Figure 4.

4.2. Study Case Ⅱ: The Agiba Power Network

This network is an isolated practical one consisting of three DGs, five distribution transformers, five medium voltage motors, four MCCs, fourteen cables, and seventeen OCRs. The network SLD is designed using the Microsoft Visio platform as shown in Figure 5, while the system data regarding the equipment ratings and fault currents are announced in Appendix A (see Table A1, Table A2, Table A3, Table A4, Table A5, Table A6, Table A7 and Table A8). The upcoming conditions are assumed during the optimization process which are summarized as follows:
  • Transformer OCRs are fitted with the inrush inhibitor feature (2nd harmonic blocking) to transcend the inrush current during the energizing.
  • Motors are started using Variable Frequency Drives (VFDs) which limit the starting current to one per unit.
  • Equipment damage curves are not included in the study and considered as future works.
  • Only phase OC protection coordination considering the transformers connection is performed.
  • Bus coupler one and two are assumed to be closed.
  • The maximum fault current condition is examined when the three DGs are in service.
  • The minimum fault current condition is examined when only DG1 and DG2 are in service.
Since most of the distribution transformers are rated as the Dy11 vector group, a two-phase fault shall be theorized in addition to the three-phase fault. Figure 6 shows the two-phase fault currents distribution due to a two-phase fault (between b and c) at the star side, as it is clarified that the fault current at line C of the delta side is multiplied by two. Therefore, this network should be investigated using various test models of combinations between the three-phase and two-phase faults in addition to the maximum and minimum fault conditions. The following four test models are listed and a further analysis is performed to characterize each one.
  • Test Model One: Maximum three-phase fault current condition;
  • Test Model Two: Maximum general fault current condition;
  • Test Model Three: Minimum two-phase fault current condition; and
  • Test Model Four: Minimum general fault current condition.
The OCRs’ optimum settings tabulated in Table 5 and Table 6 are generated using the first two test models, respectively. The GTO accomplishes TOT of 1.2509 s and 0.8368 s for test model one while 1.2614 s and 0.7607 s for test model two using scenarios one and two, respectively. In addition, the M/B operating times and their associated CTM values are listed in Table 7 and Table 8 for the first two test models also. It can be observed that scenario two in test model two achieves the least possible TOT. In this context, the optimal settings for OCRs are also generated using the minimum fault current condition as announced in Table 9 and Table 10, whereas the operating times are collected in Table 11 and Table 12, respectively, respectively. The output TOTs of test model three are 1.3385 s for scenario one and 0.7875 s for scenario two, while in test model four they are 1.325 s for scenario one and 0.7589 s for scenario two.
Figure 7 and Figure 8 depict the FOF convergence of the Agiba power network using scenarios one and two, respectively. Moreover, statistical measures are analyzed in Table 13 to evaluate the GTO performance using parametric and non-parametric tests. The p-value is produced from the t-test using thirty independent runs and by being rounded to four decimals. It is worth to mention that the smaller the p-value, the stronger the evidence to reject the null hypothesis. Consequently, the output conclusions from the studied case with DGs considering the transformer phase shift are as follows:
  • The GTO succeeds in obtaining the optimal solutions without any violations in practical isolated networks with DGs using various test models.
  • The OCRs’ coordination using the minimum two-phase fault current guarantees the fast convergence rate. Therefore, it is the suitable choice in online applications.
  • The output p-value is minimum in test models one and two, which assures that the attained results at each run are more correlated. Accordingly, the maximum fault current coordination using the fixed NI curve is the best suitable framework in the case of a radial DG network with distribution transformers.
  • The distribution of the EF currents with their optimal coordination in the case of Dy11 transformers will be a future study.
Finally, these results demonstrate the efficacy of selecting the best suitable optimization test model in distribution networks. However, the validity of GTO results is examined over a well-known algorithm (WCA) that proves its superiority in all test models, as shown in Table 14.
Moreover, further analysis is performed in each test model to manifest which of them will achieve the best smooth coordination between M/B relay pairs. This has been concluded by checking the coordination in the minimum fault condition when the opposite maximum fault condition is optimized and vice versa. The checked operating times and CTM values for the four test models are arranged in Table 15, Table 16, Table 17, Table 18 and Table 19. It can be notified that the best strategy for fulfilling the smoothest coordination is using test model four. That is because it achieves the minimum possible value of the summation of CTMs, average of CTMs, and standard deviation.
Eventually, this paper aims at proving the best strategy for achieving the smoothest coordination of OCRs in practical, isolated distribution networks. The conclusion is that using the general minimum fault condition is the best trend in this practical network., not only due to its achieving of the minimum TOT, but also because it preserves the smoothest coordination at the maximum fault points with the least obtained value of the CTM summation.

5. Conclusions

A new methodology based on GTO procedures have been proposed to produce the best settings of OCRs across two test cases under numerous scenarios in an automated manner, tests in which the practical constraints including the transformer phase shift and other scenarios for min/max fault conditions are considered with minimal interferences from protection engineers. The first case is a 15-bus network with DGs which is widely used in the literature to validate and signify the cropped results of GTOs when they are compared to others. The second test case is for an isolated real distribution network with DGs for the Agiba Petroleum company which is located in the West Desert of Egypt. The relay coordination problem is adapted as an optimization problem subject to a set of predefined constraints and is solved using the GTO including the fixed and varied inverse IEC curves. For this test case, the best strategy for achieving the smoothest coordination of OCRs in practical isolated distribution networks has been indicated considering the transformer phase shifting. The conclusion is that using the general minimum fault condition is the best trend in this practical network, not only due to achieving the minimum total operating time, but also since it preserves the smoothest coordination at the maximum fault points with the least obtained value of CTMs for the studied cases.

Author Contributions

Methodology, M.M.E.; Software, A.A.E.-F.; Validation, M.M.E.; Formal analysis, A.D.; Investigation, A.A.E.-F.; Resources, M.M.E.; Data curation, A.D.; Writing—original draft, A.D. and M.M.E.; Writing—review & editing, A.A.E.-F.; Project administration, A.A.E.-F. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

The study did not involve humans or animals.

Informed Consent Statement

The study did not involve humans.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. AGIBA Test Network Data

The following tables announces the typical date of AGIBA test network.
Table A1. Distributed Generator Data.
Table A1. Distributed Generator Data.
ID S r a t e d   ( kVA ) V r a t e d   ( kV ) X d   ( % ) X d   ( % ) X d   ( % ) P F r a t e d   ( % )
DG132501120.425.318980
DG232501120.425.318980
DG332501120.425.318980
Table A2. Distribution Transformer Data.
Table A2. Distribution Transformer Data.
IDVoltage Ratio (kV) S r a t e d   ( kVA ) Impedance (%)X/RVector Group
TR111/3.316006.135.76Dy11
TR211/3.316005.125.76Dy11
TR311/3.316006.135.76Dy11
TR411/3.316006.135.76Dy11
TR511/3.316006.375.76Dy11
Table A3. Motor Data.
Table A3. Motor Data.
IDDesignation V r a t e d   ( kV ) P r a t e d   ( kW ) I r a t e d   ( A ) P F r a t e d   ( % )
MOPAOil Line Pump3.3490101.490.5
MOPBOil Line Pump3.3490101.490.5
MOPCOil Line Pump3.3490101.490.5
MOPDOil Line Pump3.3610123.492.29
WIPWater Injection Pump3.3607125.690.5
Table A4. Feeder Data.
Table A4. Feeder Data.
IDLength (m)Area (mm2)Conductor/Insulation
F_TR11025CU/XPLE
F_MCC-12525CU/XPLE
F_TR21025CU/XPLE
F_MCC-22525CU/XPLE
F_TR31025CU/XPLE
F_MCC-32525CU/XPLE
F_TR41025CU/XPLE
F_MCC-42525CU/XPLE
F_TR51025CU/XPLE
F_MOPA1535CU/XPLE
F_MOPB1535CU/XPLE
F_MOPC1535CU/XPLE
F_MOPD1535CU/XPLE
F_WIP1535CU/XPLE
Table A5. MCC Data.
Table A5. MCC Data.
ID V r a t e d   ( kV ) P   ( kW ) Q   ( kVAr ) P F r a t e d   ( % )
MCC-111177.877.291.73
MCC-21190.839.291.81
MCC-311355.7154.691.71
MCC-411177.877.291.73
Table A6. Full Load Current and Current Transformer Ratio.
Table A6. Full Load Current and Current Transformer Ratio.
Relay ID I f l   ( A ) CTR
R1170.6250/5
R2170.6250/5
R3170.6250/5
R483.98100/5
R5101.4150/5
R610.1725/5
R783.98100/5
R8125.6150/5
R95.1925/5
R1083.98100/5
R11101.4150/5
R1220.3650/5
R1383.98100/5
R14101.4150/5
R1510.1725/5
R1683.98100/5
R17123.4150/5
Table A7. Max-Fault Conditions (3 DGs are in service with Bus Coupler 1 and Bus Coupler 2 closed).
Table A7. Max-Fault Conditions (3 DGs are in service with Bus Coupler 1 and Bus Coupler 2 closed).
Relay Pair IDPrimaryBackup3-Phase2-Phase
I f p   ( A ) I f b   ( A ) I f p   ( A ) I f b   ( A )
1R5R432449732864992
2R4R128109372580860
3R4R228109372580860
4R4R328109372580860
5R6R128109372580860
6R6R228109372580860
7R6R328109372580860
8R8R73786113633501160
9R7R128109372580860
10R7R228109372580860
11R7R328109372580860
12R9R128109372580860
13R9R228109372580860
14R9R328109372580860
15R11R1032449732864992
16R10R128109372580860
17R10R228109372580860
18R10R328109372580860
19R12R128109372580860
20R12R228109372580860
21R12R328109372580860
22R14R1332449732864992
23R13R128109372580860
24R13R228109372580860
25R13R328109372580860
26R15R128109372580860
27R15R228109372580860
28R15R328109372580860
29R17R1631679502794968
30R16R128109372580860
31R16R228109372580860
32R16R328109372580860
Table A8. Min-Fault Conditions (2 DGs are in service with Bus Coupler 1 and Bus Coupler 2 closed).
Table A8. Min-Fault Conditions (2 DGs are in service with Bus Coupler 1 and Bus Coupler 2 closed).
Relay PairPrimaryBackup3-Phase2-Phase
I f p   ( A ) I f b   ( A ) I f p   ( A ) I f b   ( A )
1R5R425057512225771
2R4R116698351533767
3R4R216698351533767
4R6R116698351533767
5R6R216698351533767
6R8R728798642563888
7R7R116698351533767
8R7R216698351533767
9R9R116698351533767
10R9R216698351533767
11R11R1025057512225771
12R10R116698351533767
13R10R216698351533767
14R12R116698351533767
15R12R216698351533767
16R14R1325057512225771
17R13R116698351533767
18R13R216698351533767
19R15R116698351533767
20R15R216698351533767
21R17R1624527362177754
22R16R116698351533767
23R16R216698351533767

References

  1. Gers, J.M.; Holmes, E.J. Protection of Electricity Distribution Networks, 3rd ed.; IET Power and Energy Series 65; IET: Edison, NJ, USA, 2011; ISBN 978-1-84919-224-8. [Google Scholar]
  2. 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. [Google Scholar] [CrossRef]
  3. El-Fergany, A. Protective Devices Coordination Toolbox Enhanced by an Embedded Expert System–Medium and Low Voltage Levels. In Proceedings of the 17th International Conference on Electricity Distribution, CIRED 2003, Barcelona, Spain, 12–15 May 2003; Session 3; Paper No 73. Available online: http://www.cired.net/publications/cired2003/reports/R%203-73.pdf (accessed on 23 December 2022).
  4. Moravej, Z.; Jazaeri, M.; Gholamzadeh, M. Optimal coordination of distance and over-current relays in series compensated systems based on MAPSO. Energy Convers. Manag. 2011, 56, 140–151. [Google Scholar] [CrossRef]
  5. Noghabi, A.S.; Mashhadi, H.R.; Sadeh, J. Optimal coordination of directional overcurrent relays considering different network topologies using interval linear programming. IEEE Trans. Power Deliv. 2010, 25, 1348–1354. [Google Scholar] [CrossRef]
  6. Srinivas, S.T.P.; Swarup, K.S. A new iterative linear programming approach to find optimal protective relay settings. Int. Trans. Electr. Energy Syst. 2020, 31, e12639. [Google Scholar] [CrossRef]
  7. Chabanloo, R.M.; Mohammadzadeh, N. A fast numerical method for optimal coordination of overcurrent relays in the presence of transient fault current. IET Gener. Transm. Distrib. 2018, 12, 472–481. [Google Scholar] [CrossRef]
  8. Bedekar, P.P.; Bhide, S.R.; Kale, V.S. Optimum time coordination of overcurrent relays using two phase simplex method. Int. J. Electr. Comput. Eng. 2009, 3, 903–907. [Google Scholar]
  9. Banerjee, N.; Narayanasamy, R.D.; Swathika, O.G. Optimal coordination of overcurrent relays using two phase simplex method and particle swarm optimization algorithm. In Proceedings of the International Conference on Power and Embedded Drive Control (ICPEDC), Chennai, India, 16–18 March 2017. [Google Scholar] [CrossRef]
  10. Birla, D.; Maheshwari, R.P.; Gupta, H.O.; Deep, K.; Thakur, M. Application of random search technique in directional overcurrent relay coordination. Int. J. Emerg. Electr. Power Syst. 2006, 7, 1–14. [Google Scholar] [CrossRef]
  11. Srinivas, S.T.P.; Swarup, K.S. A new mixed integer linear programming formulation for protection relay coordination using disjunctive inequalities. IEEE Power Energy Technol. Syst. J. 2020, 6, 104–112. [Google Scholar] [CrossRef]
  12. 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 operating curves. Neural Comput. Appl. 2021, 33, 11875–11887. [Google Scholar] [CrossRef]
  13. Korashy, A.; Kamel, S.; Youssef, A.-R.; Jurado, F. Modified water cycle algorithm for optimal direction overcurrent relays coordination. Appl. Soft Comput. 2019, 74, 10–25. [Google Scholar] [CrossRef]
  14. El-Fergany, A.A.; Hasanien, H.M. Water cycle algorithm for optimal overcurrent relays coordination in electric power systems. Soft Comput. 2019, 23, 12761–12778. [Google Scholar] [CrossRef]
  15. Khurshaid, T.; Wadood, A.; Farkoush, S.G.; Yu, J.; Kim, C.-H.; Rhee, S.-B. An improved optimal solution for the directional overcurrent relays coordination using hybridized whale optimization algorithm in complex power systems. IEEE Access 2019, 7, 90418–90435. [Google Scholar] [CrossRef]
  16. Wadood, A.; Khurshaid, T.; Farkoush, S.G.; Yu, J.; Kim, C.-H.; Rhee, S.-B. Nature-inspired whale optimization algorithm for optimal coordination of directional overcurrent relays in power systems. Energies 2019, 12, 2297. [Google Scholar] [CrossRef]
  17. Khurshaid, T.; Wadood, A.; Farkoush, S.G.; Kim, C.-H.; Yu, J.; Rhee, S.-B. Improved Firefly Algorithm for the Optimal Coordination of Directional Overcurrent Relays. IEEE Access 2019, 7, 78503–78514. [Google Scholar] [CrossRef]
  18. Sampaio, F.C.; Tofoli, F.L.; Melo, L.S.; Barroso, G.C.; Sampaio, R.F.; Leão, R.P.S. Adaptive fuzzy directional bat algorithm for the optimal coordination of protection systems based on directional overcurrent relays. Electr. Power Syst. Res. 2022, 211, 108619. [Google Scholar] [CrossRef]
  19. Ferraz, R.S.F.; Ferraz, R.S.F.; Rueda-Medina, A.C.; Batista, O.E. Genetic optimisation-based distributed energy resource allocation and recloser fuse coordination. IET Gener. Transm. Distrib. 2020, 14, 4501–4508. [Google Scholar] [CrossRef]
  20. 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. [Google Scholar] [CrossRef]
  21. Yu, J.; Kim, C.-H.; Rhee, S.-B. The comparison of lately proposed Harris hawks optimization and JAYA optimization in solving directional overcurrent relays coordination problem. Complexity 2020, 2020, 3807653. [Google Scholar] [CrossRef]
  22. Yu, J.; Kim, C.-H.; Rhee, S.-B. Oppositional Jaya algorithm with distance-adaptive coefficient in solving directional over current relays coordination problem. IEEE Access 2019, 7, 150729–150742. [Google Scholar] [CrossRef]
  23. Irfan, M.; Wadood, A.; Khurshaid, T.; Khan, B.M.; Kim, K.-C.; Oh, S.-R.; Rhee, S.-B. An optimized adaptive protection scheme for numerical and directional overcurrent relay coordination using Harris hawk optimization. Energies 2021, 14, 5603. [Google Scholar] [CrossRef]
  24. Wadood, A.; Gholami Farkoush, S.; Khurshaid, T.; Kim, C.-H.; Yu, J.; Geem, Z.W.; Rhee, S.-B. An optimized protection coordination scheme for the optimal coordination of overcurrent relays using a nature-inspired root tree algorithm. Appl. Sci. 2018, 8, 1664. [Google Scholar] [CrossRef]
  25. Bouchekara, H.R.E.H.; Zellagui, M.; Abido, M. Optimal coordination of directional overcurrent relays using a modified electromagnetic field optimization algorithm. Appl. Soft Comput. 2017, 54, 267–283. [Google Scholar] [CrossRef]
  26. Vyas, D.; Bhatt, P.; Shukla, V. Coordination of directional overcurrent relays for distribution system using particle swarm optimization. Int. J. Smart Grid Clean Energy 2020, 9, 290–297. [Google Scholar] [CrossRef]
  27. Ramli, S.P.; Mokhlis, H.; Wong, W.R.; Muhammad, M.A.; Mansor, N.N.; Hussain, M.H. Optimal coordination of directional overcurrent relay based on combination of improved particle swarm optimization and linear programming considering multiple characteristics curve. Turk. J. Electr. Eng. Comput. Sci. 2021, 29, 1765–1780. [Google Scholar] [CrossRef]
  28. Khurshaid, T.; Wadood, A.; Farkoush, S.G.; Kim, C.-H.; Cho, N.; Rhee, S.-B. Modified particle swarm optimizer as optimization of time dial settings for coordination of directional overcurrent relay. J. Electr. Eng. Technol. 2019, 14, 55–68. [Google Scholar] [CrossRef]
  29. Gouda, E.A.; Amer, A.; Elmitwally, A. Sustained coordination of devices in a two-layer protection scheme for DGs-integrated distribution network considering system dynamics. IEEE Access 2021, 9, 111865–111878. [Google Scholar] [CrossRef]
  30. 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. [Google Scholar] [CrossRef]
  31. George, S.P.; Sankar, A. Optimal settings for adaptive overcurrent relay coordination in grid-connected wind farms. Electr. Power Components Syst. 2020, 48, 1308–1326. [Google Scholar] [CrossRef]
  32. Rizwan, M.; Hong, L.; Waseem, M.; Ahmad, S.; Sharaf, M.; Shafiq, M. A robust adaptive overcurrent relay coordination scheme for windfarm-Integrated power systems based on forecasting the wind dynamics for smart energy systems. Appl. Sci. 2020, 10, 6318. [Google Scholar] [CrossRef]
  33. El-Naily, N.; Saad, S.M.; Mohamed, F.A. Novel approach for optimum coordination of overcurrent relays to enhance microgrid earth fault protection scheme. Sustain. Cities Soc. 2020, 54, 102006. [Google Scholar] [CrossRef]
  34. Wong, J.Y.R.; Tan, C.; Abu Bakar, A.H.; Che, H.S. Selectivity problem in adaptive overcurrent protection for microgrid with inverter-based distributed generators (IBDG): Theoretical investigation and HIL verification. IEEE Trans. Power Deliv. 2022, 37, 3313–3324. [Google Scholar] [CrossRef]
  35. Saldarriaga-Zuluaga, S.D.; López-Lezama, J.M.; Muñoz-Galeano, N. Optimal coordination of over-current relays in microgrids considering multiple characteristic curves. Alex. Eng. J. 2021, 60, 2093–2113. [Google Scholar] [CrossRef]
  36. 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 2018, 9, 1365–1375. [Google Scholar] [CrossRef]
  37. Hatata, A.; Ebeid, A.; El-Saadawi, M. Optimal restoration of directional overcurrent protection coordination for meshed distribution system integrated with DGs based on FCLs and adaptive relays. Electr. Power Syst. Res. 2022, 205, 107738. [Google Scholar] [CrossRef]
  38. Fayoud, A.B.; Sharaf, H.; Ibrahim, D.K. Optimal coordination of DOCRs in interconnected networks using shifted user-defined two-level characteristics. Int. J. Electr. Power Energy Syst. 2022, 142, 108298. [Google Scholar] [CrossRef]
  39. 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. [Google Scholar] [CrossRef]
  40. 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. [Google Scholar] [CrossRef]
  41. Shih, M.Y.; Conde, A.; Ángeles-Camacho, C. Enhanced self-adaptive differential evolution multi-objective algorithm for coordination of directional overcurrent relays contemplating maximum and minimum fault points. IET Gener. Transm. Distrib. 2019, 13, 4842–4852. [Google Scholar] [CrossRef]
  42. Tian, M.; Gao, X.; Dai, C. Differential evolution with improved individual-based parameter setting and selection strategy. Appl. Soft Comput. 2017, 56, 286–297. [Google Scholar] [CrossRef]
  43. Shih, M.Y.; Enríquez, A.C.; Hsiao, T.-Y.; Treviño, L.M.T. Enhanced differential evolution algorithm for coordination of directional overcurrent relays. Electr. Power Syst. Res. 2017, 143, 365–375. [Google Scholar] [CrossRef]
  44. 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. [Google Scholar] [CrossRef]
  45. El-Fergany, A. Optimal directional digital overcurrent relays coordination and arc-flash hazard assessments in meshed networks. Int. Trans. Electr. Energy Syst. 2016, 26, 134–154. [Google Scholar] [CrossRef]
  46. Pandya, K.S.; Rajput, V.N. A hybrid improved harmony search algorithm-nonlinear programming approach for optimal coordination of directional overcurrent relays including characteristic selection. Int. J. Power Energy Convers. 2018, 9, 228. [Google Scholar] [CrossRef]
  47. Kim, C.-H.; Khurshaid, T.; Wadood, A.; Farkoush, S.G.; Rhee, S.-B. Gray wolf optimizer for the optimal coordination of directional overcurrent relay. J. Electr. Eng. Technol. 2018, 13, 1043–1051. [Google Scholar] [CrossRef]
  48. Srinivas, S.T.P.; Swarup, S.K. Application of improved invasive weed optimization technique for optimally setting directional overcurrent relays in power systems. Appl. Soft Comput. 2019, 79, 1–13. [Google Scholar]
  49. Luo, C.; Xu, Y.; Liu, Q. Using improved pollen algorithm to optimize coordination of relay protection. In Proceedings of the 10th International Conference on Power and Energy Systems (ICPES), Chengdu, China, 25–27 December 2020. [Google Scholar] [CrossRef]
  50. Guvenc, U.; Bakir, H.; Duman, S. Optimal coordination of directional overcurrent relays using artificial ecosystem-based optimization. In Trends in Data Engineering Methods for Intelligent Systems; Hemanth, J., Yigit, T., Patrut, B., Angelopoulou, A., Eds.; Lecture Notes on Data Engineering and Communications Technologies; Springer: Cham, Switzerland, 2021; Volume 76. [Google Scholar] [CrossRef]
  51. Acharya, D.; Das, D.K. Optimal coordination of over current relay using opposition learning-based gravitational search algorithm. J. Supercomput. 2021, 77, 10721–10741. [Google Scholar] [CrossRef]
  52. Damchi, Y.; Dolatabadi, M. Hybrid VNS–LP algorithm for online optimal coordination of directional overcurrent relays. IET Gener. Transm. Distrib. 2020, 14, 5447–5455. [Google Scholar] [CrossRef]
  53. Kahraman, H.T.; Bakir, H.; Duman, S.; Katı, M.; Aras, S.; Guvenc, U. Dynamic FDB selection method and its application: Modeling and optimizing of directional overcurrent relays coordination. Appl. Intell. 2021, 52, 4873–4908. [Google Scholar] [CrossRef]
  54. Gabr, M.A.; El-Sehiemy, R.A.; Megahed, T.F.; Ebihara, Y.; Abdelkader, S.M. Optimal settings of multiple inverter-based distributed generation for restoring coordination of DOCRs in meshed distribution networks. Electr. Power Syst. Res. 2022, 213, 108757. [Google Scholar] [CrossRef]
  55. Sarwagya, K.; Nayak, P.K.; Ranjan, S. Optimal coordination of directional overcurrent relays in complex distribution networks using sine cosine algorithm. Electr. Power Syst. Res. 2020, 187, 106435. [Google Scholar] [CrossRef]
  56. Kamel, S.; Korashy, A.; Youssef, A.-R.; Jurado, F. Development and application of an efficient optimizer for optimal coordination of direction overcurrent relays. Neural Comput. Appl. 2020, 32, 8561–8583. [Google Scholar] [CrossRef]
  57. Draz, A.; Elkholy, M.M.; El-Fergany, A. Over-current relays coordination including practical constraints and DGs: Damage curves, inrush, and starting currents. Sustainability 2022, 14, 2761. [Google Scholar] [CrossRef]
  58. Saldarriaga-Zuluaga, S.D.; López-Lezama, J.M.; Muñoz-Galeano, N. Optimal Coordination of Over-Current Relays in Microgrids Using Unsupervised Learning Techniques. Appl. Sci. 2021, 11, 1241. [Google Scholar] [CrossRef]
  59. Ramadan, A.; Ebeed, M.; Kamel, S.; Agwa, A.M.; Tostado-Véliz, M. The probabilistic optimal integration of renewable distributed generators considering the time-varying load based on an artificial gorilla troops optimizer. Energies 2022, 15, 1302. [Google Scholar] [CrossRef]
  60. Abdollahzadeh, B.; Gharehchopogh, F.S.; Mirjalili, S. Artificial gorilla troops optimizer: A new nature-inspired metaheuristic algorithm for global optimization problems. Int. J. Intell. Syst. 2021, 36, 5887–5958. [Google Scholar] [CrossRef]
  61. Ginidi, A.; Ghoneim, S.M.; Elsayed, A.; El-Sehiemy, R.; Shaheen, A.; El-Fergany, A. Gorilla troops optimizer for electrically based single and double-diode models of solar photovoltaic systems. Sustainability 2021, 13, 9459. [Google Scholar] [CrossRef]
  62. Bui, D.M.; Le, P.D.; Nguyen, T.P.; Nguyen, H. An adaptive and scalable protection coordination system of overcurrent relays in distributed-generator-integrated distribution networks. Appl. Sci. 2021, 11, 8454. [Google Scholar] [CrossRef]
Figure 1. A log-to-log plot for IEC 60255-3 TCCs.
Figure 1. A log-to-log plot for IEC 60255-3 TCCs.
Mathematics 11 00774 g001
Figure 2. GTO Flow chart procedures.
Figure 2. GTO Flow chart procedures.
Mathematics 11 00774 g002
Figure 3. The SLD of the IEEE 15-bus network.
Figure 3. The SLD of the IEEE 15-bus network.
Mathematics 11 00774 g003
Figure 4. FOF convergence of the IEEE 15-bus network using GTO.
Figure 4. FOF convergence of the IEEE 15-bus network using GTO.
Mathematics 11 00774 g004
Figure 5. The SLD of Agiba test network.
Figure 5. The SLD of Agiba test network.
Mathematics 11 00774 g005
Figure 6. The 2-phase fault currents distribution over Dy11 distribution transformer.
Figure 6. The 2-phase fault currents distribution over Dy11 distribution transformer.
Mathematics 11 00774 g006
Figure 7. FOF convergence of Agiba test network using scenario 1 settings.
Figure 7. FOF convergence of Agiba test network using scenario 1 settings.
Mathematics 11 00774 g007
Figure 8. FOF convergence of Agiba test network using scenario 2 settings.
Figure 8. FOF convergence of Agiba test network using scenario 2 settings.
Mathematics 11 00774 g008
Table 1. Constant values for various IEC standard curves.
Table 1. Constant values for various IEC standard curves.
Standard T C C   Type a ß
IECNI0.140.02
IECVI13.501.00
IECEI80.002.00
IECLI120.001.00
Table 2. Optimum DOCRs settings of the IEEE 15-bus using GTO.
Table 2. Optimum DOCRs settings of the IEEE 15-bus using GTO.
Relay ID.Scenario 1Scenario 2
I p   ( A ) T D   ( s ) I p   ( A ) T D   ( s ) Curve
R1274.33580.0675293.99910.0215EI
R2313.96080.0681307.61760.0244EI
R3478.92560.0654477.17560.0221EI
R4440.92140.0663442.49780.0294EI
R5489.97210.0662431.70930.0297EI
R6373.44840.0661374.99950.0264EI
R7345.02520.0685367.49980.0270EI
R8556.51370.0668559.59830.0205EI
R9432.79320.0658433.35800.0184EI
R10403.17250.0634403.83700.0199EI
R11449.18120.0677449.99820.0269EI
R12483.84210.0666502.44890.0210EI
R13509.74510.0500516.49430.0131EI
R14394.20570.0649323.75740.0338EI
R15344.36980.0663367.49980.0251EI
R16253.70670.0639245.12710.0232EI
R17179.54770.0667187.49890.0351EI
R18457.30940.0678487.94450.0204EI
R19425.25350.0672425.63980.0251EI
R20620.04740.0641622.32040.0213EI
R21539.96640.0612539.99920.0166EI
R22202.24950.0639201.86580.0244EI
R23395.01200.0644393.48770.0243EI
R24251.17170.0653224.42150.0314EI
R25348.81780.0629286.85130.0287EI
R26304.94230.0685307.24270.0383EI
R27352.48270.0653320.58830.0275EI
R28447.81160.0667389.54270.0293EI
R29671.00480.0673674.25270.0263EI
R30201.82160.0658192.88320.0310EI
R31300.57950.0671263.04050.0283EI
R32278.93330.0661284.98370.0161EI
R33351.37400.0745405.01060.0227EI
R34298.82610.0685280.27850.0308EI
R35364.03800.0603296.53950.0290EI
R36433.71950.0676382.21690.0261EI
R37553.70380.0666599.99940.0276EI
R38299.40940.0672248.67520.0331EI
R39285.59460.0667294.42030.0225EI
R40560.63710.0670490.99300.0293EI
R41297.10190.0635299.99730.0268EI
R42337.11910.0674374.13600.0164EI
TOT (s)9.07751.3962
Table 3. Operating times of M/B relay pairs with their associated CTM values of the IEEE 15-bus based on GTO.
Table 3. Operating times of M/B relay pairs with their associated CTM values of the IEEE 15-bus based on GTO.
Relay PairsScenario 1Scenario 2Relay PairsScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
160.17830.38300.20470.01140.21540.203920300.17420.37430.20020.01130.21620.2049
240.17300.37950.20650.00880.23200.223221170.15190.38280.23090.00550.30530.2998
2160.17300.41150.23850.00880.22710.218321190.15190.39700.24510.00550.21350.2080
310.21150.41160.20000.02570.23190.206121300.15190.37430.22240.00550.21620.2107
3160.21150.41150.20000.02570.22710.201322230.19300.49210.29910.02110.37440.3533
470.19760.40560.20800.02420.26550.241222340.19300.40270.20970.02110.22420.2031
4120.19760.41670.21910.02420.22490.200623110.17440.39390.21950.01260.22120.2086
4200.19760.41510.21750.02420.22870.204523130.17440.47890.30460.01260.33250.3200
520.23750.43800.20050.04080.24400.203224210.20210.47230.27020.02430.26340.2391
680.23180.45250.22070.04330.24670.203424340.20210.40270.20060.02430.22420.2000
6100.23180.43810.20630.04330.24740.204125150.22950.44420.21480.03660.33770.3012
750.23770.43750.19980.04780.25060.202825180.22950.44290.21340.03660.25820.2216
7100.23770.43810.20040.04780.24740.199526280.23250.47240.23990.05570.27990.2242
830.21470.41550.20080.02360.22370.200126360.23250.49930.26680.05570.28090.2252
8120.21470.41670.20200.02360.22490.201227250.25800.45810.20010.05750.25730.1999
8200.21470.41510.20050.02360.22870.205027360.25800.49930.24130.05750.28090.2235
950.23570.43750.20180.03260.25060.218028290.26540.46510.19970.05710.33160.2745
980.23570.45250.21680.03260.24670.214028320.26540.50050.23520.05710.25890.2018
10140.19930.41170.21240.02060.22240.201829170.18210.38280.20070.01380.30530.2914
1130.20420.41550.21130.02340.22370.200329190.18210.39700.21490.01380.21350.1997
1170.20420.40560.20140.02340.26550.242129220.18210.38280.20070.01380.21390.2001
11200.20420.41510.21090.02340.22870.205330270.20960.41840.20890.03100.23180.2008
12130.21120.47890.26770.02450.33250.308030320.20960.50050.29100.03100.25890.2279
12240.21120.41190.20070.02450.24520.220731270.20370.41840.21470.01920.23180.2126
1390.18090.53960.35870.02480.33310.308431290.20370.46510.26140.01920.33160.3124
14110.18040.39390.21340.01340.22120.207732330.22630.43070.20440.02490.25100.2261
14240.18040.41190.23150.01340.24520.231832420.22630.47190.24560.02490.26970.2447
1510.17290.41160.23870.01230.23190.219633210.27200.47230.20030.05780.26340.2056
1540.17290.37950.20650.01230.23200.219733230.27200.49210.22010.05780.37440.3166
16180.20140.44290.24150.02280.25820.235334310.26980.46990.20010.06760.26740.1998
16260.20140.43600.23450.02280.39960.376734420.26980.47190.20210.06760.26970.2021
17150.19440.44420.24990.02840.33770.309435250.23690.45810.22120.04750.25730.2099
17260.19440.43600.24160.02840.39960.371235280.23690.47240.23550.04750.27990.2324
18190.15810.39700.23890.00550.21350.208036380.22910.43090.20180.02860.22850.1998
18220.15810.38280.22470.00550.21390.208437350.25640.45640.19990.07540.27590.2006
18300.15810.37430.21620.00550.21620.210738400.30000.50660.20660.08580.32760.2418
1930.20530.41550.21020.02300.22370.200839370.28470.48510.20050.07900.46810.3890
1970.20530.40560.20020.02300.26550.242540410.26760.47890.21130.05880.41480.3560
19120.20530.41670.21140.02300.22490.201941310.23040.46990.23950.05080.26740.2165
20170.17420.38280.20870.01130.30530.294041330.23040.43070.20030.05080.25100.2002
20220.17420.38280.20870.01130.21390.202642390.20220.40360.20140.01720.21740.2002
Table 4. GTO TOT comparison with other algorithms of the IEEE 15-bus.
Table 4. GTO TOT comparison with other algorithms of the IEEE 15-bus.
Scenario 1Scenario 2
GTOSMA [12]EGWO [57]MEFO [25]MWCA [13]GTOSMA [12]SFSA [44]FPA [45]
9.077511.976112.228213.95313.2821.39622.45043.212.95
Table 5. OCRs optimum settings of Agiba network using Test Model 1.
Table 5. OCRs optimum settings of Agiba network using Test Model 1.
Relay ID.Scenario 1Scenario 2
I p   ( A ) T D   ( s ) I p   ( A ) T D   ( s ) Curve
R1331.61170.0644340.33420.0470VI
R2330.53660.0604341.19650.0314EI
R3331.28080.0627341.06090.0304EI
R4167.76140.0639135.99650.1137VI
R5199.12740.0205152.10010.2837EI
R620.33630.037015.25500.8794VI
R7156.38810.0723150.79170.1205VI
R8226.32090.0207248.90350.1443EI
R910.16720.042510.37080.9998VI
R10164.76150.0646167.89630.0889VI
R11152.12860.0226202.35520.1596EI
R1240.52820.031637.47710.2736VI
R13167.29440.0639167.92900.1754EI
R14196.50180.0206202.70590.0556VI
R1515.25660.050319.46210.5316VI
R16163.78320.0639160.85500.0909VI
R17243.58890.0188238.06190.1101EI
TOT (s)1.25090.8368
Table 6. OCRs optimum settings of Agiba network using Test Model 2.
Table 6. OCRs optimum settings of Agiba network using Test Model 2.
Relay ID.Scenario 1Scenario 2
I p   ( A ) T D   ( s ) I p   ( A ) T D   ( s ) Curve
R1300.79640.0688341.17390.0300EI
R2303.76510.0674341.19940.0276EI
R3290.88230.0688341.09800.0287EI
R4154.03120.0678167.89090.0909VI
R5164.06290.0220201.72820.1612EI
R616.54010.038720.32110.0572LI
R7146.54190.0755136.04920.2656EI
R8251.01510.0200188.40000.2519EI
R910.29560.042410.36990.9998VI
R10167.52200.0647166.68660.1765EI
R11152.10000.0226152.10130.2835EI
R1240.00690.031740.63040.0284LI
R13151.19980.0685138.63020.1137VI
R14152.10350.0226167.44780.2337EI
R1517.91160.038120.33920.0572LI
R16125.97000.0745167.63050.1751EI
R17185.14580.0209185.10000.1923EI
TOT (s)1.26140.7607
Table 7. Operating times of M/B relay pairs with their associated CTM values of the Agiba Network using Test Model 1.
Table 7. Operating times of M/B relay pairs with their associated CTM values of the Agiba Network using Test Model 1.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.05010.25000.19990.05000.24940.1994
410.15430.42950.27530.07810.36200.2839
420.15430.40150.24720.07810.38410.3061
430.15430.41760.26340.07810.37080.2928
610.05010.42950.37940.06480.36200.2972
620.05010.40150.35140.06480.38410.3193
630.05010.41760.36760.06480.37080.3060
870.04990.25010.20020.05010.24900.1989
710.17010.42950.25940.09220.36200.2697
720.17010.40150.23130.09220.38410.2919
730.17010.41760.24750.09220.37080.2786
910.05000.42950.37950.05000.36200.3120
920.05000.40150.35150.05000.38410.3341
930.05000.41760.36770.05000.37080.3208
11100.05010.25000.19990.04990.25020.2003
1010.15490.42950.27460.07620.36200.2858
1020.15490.40150.24660.07620.38410.3079
1030.15490.41760.26280.07620.37080.2946
1210.05000.42950.37950.04990.36200.3121
1220.05000.40150.35150.04990.38410.3342
1230.05000.41760.36760.04990.37080.3209
14130.05010.24980.19970.05010.43080.3807
1310.15420.42950.27530.05030.36200.3117
1320.15420.40150.24730.05030.38410.3338
1330.15420.41760.26340.05030.37080.3205
1510.06410.42950.36540.05010.36200.3119
1520.06410.40150.33740.05010.38410.3341
1530.06410.41760.35360.05010.37080.3208
17160.05000.25000.20000.05010.25020.2001
1610.15290.42950.27660.07450.36200.2875
1620.15290.40150.24860.07450.38410.3096
1630.15290.41760.26470.07450.37080.2963
Table 8. Operating times of M/B relay pairs with their associated CTM values of the Agiba Network using Test Model 2.
Table 8. Operating times of M/B relay pairs with their associated CTM values of the Agiba Network using Test Model 2.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.05000.25010.20000.25010.05010.2000
410.15870.41910.26030.36650.07800.2884
420.15870.41430.25560.33720.07800.2592
430.15870.40710.24840.35100.07800.2730
610.05010.41910.36900.36650.05000.3164
620.05010.41430.36420.33720.05000.2871
630.05010.40710.35700.35100.05000.3009
870.05030.25030.20000.29640.05000.2463
710.17370.41910.24530.36650.04990.3165
720.17370.41430.24060.33720.04990.2872
730.17370.40710.23330.35100.04990.3011
910.05000.41910.36910.36650.05000.3165
920.05000.41430.36430.33720.05000.2872
930.05000.40710.35710.35100.05000.3010
11100.05010.25020.20010.41030.05000.3603
1010.15620.41910.26290.36650.04990.3166
1020.15620.41430.25820.33720.04990.2873
1030.15620.40710.25090.35100.04990.3011
1210.05000.41910.36910.36650.05000.3164
1220.05000.41430.36430.33720.05000.2871
1230.05000.40710.35710.35100.05000.3010
14130.05000.25030.20030.24940.04990.1994
1310.15940.41910.25960.36650.07970.2868
1320.15940.41430.25490.33720.07970.2575
1330.15940.40710.24760.35100.07970.2713
1510.05010.41910.36900.36650.05000.3164
1520.05010.41430.36430.33720.05000.2871
1530.05010.40710.35700.35100.05000.3009
17160.05010.25070.20050.43310.05270.3803
1610.16290.41910.25620.36650.05000.3164
1620.16290.41430.25150.33720.05000.2871
1630.16290.40710.24420.35100.05000.3010
Table 9. OCRs optimum settings of Agiba network using Test Model 3.
Table 9. OCRs optimum settings of Agiba network using Test Model 3.
Relay ID.Scenario 1Scenario 2
I p   ( A ) T D   ( s ) I p   ( A ) T D   ( s ) Curve
R1319.69390.0505311.22070.0208EI
R2341.19410.0491340.42730.0181EI
R4165.70310.0558154.79750.0744EI
R5200.79960.0176196.51160.0795EI
R615.25500.034516.04240.0394LI
R7125.97000.0712131.21420.1403EI
R8188.40000.0192217.20350.0864EI
R97.78500.039810.30800.0616LI
R10161.57790.0567151.41550.0779EI
R11152.10000.0197183.52100.0412VI
R1230.54000.029130.54000.0249LI
R13125.97010.0659146.69470.0832EI
R14152.10000.0197171.15410.1047EI
R1515.25500.034520.07600.0314LI
R16163.21650.0555125.97000.1105EI
R17201.78200.0174234.58840.0532EI
TOT (s)1.33850.7875
Table 10. OCRs optimum settings of Agiba network using Test Model 4.
Table 10. OCRs optimum settings of Agiba network using Test Model 4.
Relay ID.Scenario 1Scenario 2
I p   ( A ) T D   ( s ) I p   ( A ) T D   ( s ) Curve
R1300.92340.0570341.18270.0197EI
R2302.80600.0529341.19860.0307VI
R4167.52520.0544125.97000.1075EI
R5152.10000.0197199.33790.0774EI
R615.25500.034516.42870.3422VI
R7125.97010.0703126.03660.1436EI
R8188.40000.0193188.41710.1158EI
R97.78500.03987.78720.7265VI
R10125.97000.0653167.30150.0599EI
R11152.10030.0201153.70810.0501VI
R1240.61460.026940.70840.1364VI
R13167.70600.0544167.95910.0594EI
R14202.78960.0176152.18520.1332EI
R1520.20510.032315.27610.3681VI
R16166.99240.0538165.35690.0588EI
R17185.10000.0181221.12830.0328VI
TOT (s)1.32500.7589
Table 11. Operating times of M/B relay pairs of the Agiba Network using Test Model 3.
Table 11. Operating times of M/B relay pairs of the Agiba Network using Test Model 3.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.04990.25020.20020.05000.24990.1999
410.17170.40030.22860.06130.32730.2660
420.17170.42050.24880.06130.35540.2941
610.05000.40030.35030.05000.32730.2773
620.05000.42050.37050.05000.35540.3054
870.05020.25010.19990.05000.25050.2005
710.19440.40030.20600.08280.32730.2445
720.19440.42050.22620.08280.35540.2726
910.05000.40030.35030.05000.32730.2773
920.05000.42050.37050.05000.35540.3054
11100.05000.25020.20020.05000.24990.1999
1010.17260.40030.22780.06140.32730.2660
1020.17260.42050.24800.06140.35540.2941
1210.05000.40030.35030.06070.32730.2666
1220.05000.42050.37050.06070.35540.2947
14130.05000.25000.20000.04990.25000.2001
1310.18000.40030.22040.06150.32730.2658
1320.18000.42050.24060.06150.35540.2939
1510.05010.40030.35030.05010.32730.2773
1520.05010.42050.37050.05010.35540.3053
17160.04990.25010.20020.05000.25380.2038
1610.16970.40030.23070.06010.32730.2672
1620.16970.42050.25090.06010.35540.2953
Table 12. Operating times of M/B relay pairs for Agiba Network using Test Model 4.
Table 12. Operating times of M/B relay pairs for Agiba Network using Test Model 4.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.05010.25020.20000.05010.24900.1989
410.16830.42240.25410.05850.38920.3307
420.16830.39450.22620.05850.33210.2736
610.04990.42240.37250.05000.38920.3391
620.04990.39450.34460.05000.33210.2821
870.05050.25080.20030.05030.24980.1994
710.19220.42240.23020.07820.38920.3110
720.19220.39450.20240.07820.33210.2539
910.05000.42240.37240.05010.38920.3391
920.05000.39450.34450.05010.33210.2820
11100.05110.25140.20030.05020.25020.2000
1010.17830.42240.24410.05780.38920.3314
1020.17830.39450.21620.05780.33210.2744
1210.05010.42240.37230.05020.38920.3389
1220.05010.39450.34450.05020.33210.2819
14130.05040.25020.19980.05010.25030.2002
1310.16830.42240.25410.05780.38920.3314
1320.16830.39450.22620.05780.33210.2743
1510.05010.42240.37230.05000.38920.3391
1520.05010.39450.34450.05000.33210.2821
17160.05000.25030.20030.05010.25000.1999
1610.16620.42240.25620.05540.38920.3338
1620.16620.39450.22830.05540.33210.2767
Table 13. Statistical measures of GTO performance in Agiba power network over 30 independent runs.
Table 13. Statistical measures of GTO performance in Agiba power network over 30 independent runs.
Test ModelParametric TestsNon-Parametric TestsElapsed Time (s)
MinMaxMeanMedianSDp-Value
Model 1Scenario 11.25091.49471.30431.28390.05460101.3520
Scenario 20.8368316.082141.45771.094091.29710.010696.4464
Model 2Scenario 11.26141.55601.33211.32040.0612089.0859
Scenario 20.760751.93674.97271.081712.19450.034399.9674
Model 3Scenario 11.33851.78451.41231.38140.10570.000378.1487
Scenario 20.7875261.38889.83771.154747.51080.152773.4870
Model 4Scenario 11.32501.88921.39531.35870.10820.000778.1213
Scenario 20.7589109.77495.52431.201920.07330.101976.3707
Table 14. GTO defense regarding the TOT in Agiba power network.
Table 14. GTO defense regarding the TOT in Agiba power network.
Test ModelScenarioGTOWCA
111.25091.6962
20.83681.7862
211.26141.6556
20.76071.4319
311.33851.7049
20.78751.3996
411.32501.9487
20.75891.4550
Table 15. Coordination check of Test Model 1.
Table 15. Coordination check of Test Model 1.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.05520.29400.23870.08400.33940.2554
410.19030.48370.29340.13620.43650.3004
420.19030.45200.26180.13620.50350.3673
610.05620.48370.42750.10950.43650.3270
620.05620.45200.39580.10950.50350.3940
870.05550.29110.23550.08690.34390.2570
710.20870.48370.27490.16160.43650.2750
720.20870.45200.24330.16160.50350.3419
910.05540.48370.42830.08440.43650.3521
920.05540.45200.39660.08440.50350.4191
11100.05490.29360.23870.08390.34560.2617
1010.19080.48370.29290.13420.43650.3023
1020.19080.45200.26120.13420.50350.3693
1210.05730.48370.42640.08480.43650.3517
1220.05730.45200.39470.08480.50350.4187
14130.05520.29340.23820.06610.73850.6724
1310.19000.48370.29360.14350.43650.2930
1320.19000.45200.26200.14350.50350.3600
1510.07150.48370.41210.08470.43650.3519
1520.07150.45200.38050.08470.50350.4188
17160.05570.29320.23750.08380.34320.2594
1610.18820.48370.29540.13090.43650.3057
1620.18820.45200.26380.13090.50350.3726
Table 16. Coordination check of Test Model 2.
Table 16. Coordination check of Test Model 2.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.05750.29490.23730.10690.35330.2464
410.20180.50970.30790.15090.59200.4411
420.20180.50470.30280.15090.54470.3938
610.05710.50970.45260.09220.59200.4998
620.05710.50470.44750.09220.54470.4525
870.05890.29260.23370.10950.54020.4308
710.21990.50970.28980.16870.59200.4233
720.21990.50470.28480.16870.54470.3761
910.05640.50970.45330.09190.59200.5001
920.05640.50470.44830.09190.54470.4528
11100.05740.29740.24000.10650.73160.6252
1010.20010.50970.30960.16890.59200.4231
1020.20010.50470.30460.16890.54470.3758
1210.05870.50970.45100.09280.59200.4992
1220.05870.50470.44600.09280.54470.4520
14130.05740.29440.23700.10650.34750.2410
1310.20220.50970.30750.15260.59200.4394
1320.20220.50470.30240.15260.54470.3921
1510.05730.50970.45240.09230.59200.4997
1520.05730.50470.44740.09230.54470.4524
17160.05790.29030.23230.11200.76640.6544
1610.20350.50970.30620.16950.59200.4225
1620.20350.50470.30120.16950.54470.3752
Table 17. Coordination check of Test Model 3.
Table 17. Coordination check of Test Model 3.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.04510.21440.16930.03010.14860.1185
410.13340.35370.22030.01760.25080.2331
420.13340.36830.23490.01760.26910.2514
610.04380.35370.30990.02680.25080.2240
620.04380.36830.32450.02680.26910.2423
870.04540.21950.17420.02920.14550.1163
710.15490.35370.19880.02380.25080.2269
720.15490.36830.21350.02380.26910.2452
910.04450.35370.30920.02680.25080.2239
920.04450.36830.32390.02680.26910.2422
11100.04560.21480.16920.03810.14870.1106
1010.13440.35370.21930.01760.25080.2331
1020.13440.36830.23400.01760.26910.2514
1210.04290.35370.31080.03240.25080.2184
1220.04290.36830.32540.03240.26910.2367
14130.04560.21900.17330.03000.14880.1188
1310.14330.35370.21040.01770.25080.2331
1320.14330.36830.22500.01770.26910.2514
1510.04380.35370.30990.02670.25080.2240
1520.04380.36830.32450.02670.26910.2423
17160.04510.21440.16920.03020.15230.1221
1610.13200.35370.22170.01730.25080.2335
1620.13200.36830.23640.01730.26910.2517
Table 18. Coordination check of Test Model 4.
Table 18. Coordination check of Test Model 4.
M/B Relay PairScenario 1Scenario 2
MB t M   ( s ) t B   ( s ) CTM (s) t M   ( s ) t B   ( s ) CTM (s)
540.04370.21030.16660.02350.14100.1175
410.13130.34730.21600.01730.24090.2236
420.13130.32410.19290.01730.23730.2200
610.04390.34730.30340.02720.24090.2137
620.04390.32410.28020.02720.23730.2102
870.04370.21680.17310.02300.13720.1142
710.15360.34730.19370.02320.24090.2177
720.15360.32410.17050.02320.23730.2142
910.04460.34730.30270.02730.24090.2136
920.04460.32410.27950.02730.23730.2101
11100.04460.21700.17240.03360.14030.1066
1010.14270.34730.20460.01700.24090.2238
1020.14270.32410.18140.01700.23730.2203
1210.04260.34730.30470.02710.24090.2138
1220.04260.32410.28150.02710.23730.2103
14130.04320.21040.16720.02350.14020.1167
1310.13130.34730.21600.01700.24090.2239
1320.13130.32410.19280.01700.23730.2203
1510.04360.34730.30370.02720.24090.2137
1520.04360.32410.28050.02720.23730.2102
17160.04340.21060.16720.03320.14140.1082
1610.12970.34730.21760.01630.24090.2245
1620.12970.32410.19450.01630.23730.2210
Table 19. CTM comparison of the various test models.
Table 19. CTM comparison of the various test models.
Test Model NoScenario NoSum of CTMsAverage of CTMsStandard Deviation
117.19280.31270.0740
28.02670.34900.0882
217.79560.33890.0868
210.06870.43780.0929
315.60770.24380.0589
24.85090.21090.0514
415.16290.22450.0531
24.46830.19430.0443
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Draz, A.; Elkholy, M.M.; El-Fergany, A.A. Automated Settings of Overcurrent Relays Considering Transformer Phase Shift and Distributed Generators Using Gorilla Troops Optimizer. Mathematics 2023, 11, 774. https://doi.org/10.3390/math11030774

AMA Style

Draz A, Elkholy MM, El-Fergany AA. Automated Settings of Overcurrent Relays Considering Transformer Phase Shift and Distributed Generators Using Gorilla Troops Optimizer. Mathematics. 2023; 11(3):774. https://doi.org/10.3390/math11030774

Chicago/Turabian Style

Draz, Abdelmonem, Mahmoud M. Elkholy, and Attia A. El-Fergany. 2023. "Automated Settings of Overcurrent Relays Considering Transformer Phase Shift and Distributed Generators Using Gorilla Troops Optimizer" Mathematics 11, no. 3: 774. https://doi.org/10.3390/math11030774

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop