2019
DOI: 10.1049/iet-gtd.2018.6995
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced self‐adaptive differential evolution multi‐Objective algorithm for coordination of directional overcurrent relays contemplating maximum and minimum fault points

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 73 publications
0
11
0
Order By: Relevance
“…It can be deduced that the GA is the only algorithm that is able to reduce the tripping times of the PR and BR and consequently, the opening order of the breaker in the faulted section. Compared with other optimization functions, the proposed smart sensor coordination establishes a tripping time lower than that proposed in [55] which ranges from (0.21-0.27) s for the primary relay and from (0.5-0.75) s for the backup relay.…”
Section: Influence Of Different Fault Types and Fault Locationsmentioning
confidence: 94%
“…It can be deduced that the GA is the only algorithm that is able to reduce the tripping times of the PR and BR and consequently, the opening order of the breaker in the faulted section. Compared with other optimization functions, the proposed smart sensor coordination establishes a tripping time lower than that proposed in [55] which ranges from (0.21-0.27) s for the primary relay and from (0.5-0.75) s for the backup relay.…”
Section: Influence Of Different Fault Types and Fault Locationsmentioning
confidence: 94%
“…𝑘 * 𝐼 𝑙𝑜𝑎𝑑 𝑚𝑎𝑥 (6) where 𝐼 𝑠𝑐 2∅ 𝑏𝑎𝑐𝑘𝑢𝑝 represents the two-phase short circuit of the backup unit, the product of 𝑘 and 𝐼 𝑙𝑜𝑎𝑑 𝑚𝑎𝑥 determine the pickup current setting. Hence, constraint of sensitivity [49], is presented in (7):…”
Section: 𝑠𝑒𝑛𝑠𝑖𝑡𝑖𝑣𝑖𝑡𝑦 = 𝐼 𝑠𝑐 2∅ 𝑏𝑎𝑐𝑘𝑢𝑝mentioning
confidence: 99%
“…Against other algorithms that first do a crossover and then mutation, conversely, in the DE algorithm, to create a new generation. DE has become a rapid, robust and reliable optimization technique [50, 51]. Therefore, the length of the mutation step is equal to the amount of distance between the current members.…”
Section: Roadmap Of Problem Optimizationmentioning
confidence: 99%
“…The [50,51]. Therefore, the length of the mutation step is equal to the amount of distance between the current members.…”
Section: De Algorithmmentioning
confidence: 99%