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

Robust coordination of directional overcurrent relays using a matheuristic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
14
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 48 publications
(14 citation statements)
references
References 68 publications
0
14
0
Order By: Relevance
“…Minimising relay operating times while considering coordination constraints is a non-linear programming optimisation problem. To solve this problem, various metaheuristic algorithms [3,13,27,32,[35][36][37][38] deterministic algorithms [7,14,15,24,39] and their combination [22,26,[40][41][42][43] have been employed in the literature. In our previous study [43], the merits and demerits of each optimisation approach were discussed in detail.…”
Section: Introductionmentioning
confidence: 99%
“…Minimising relay operating times while considering coordination constraints is a non-linear programming optimisation problem. To solve this problem, various metaheuristic algorithms [3,13,27,32,[35][36][37][38] deterministic algorithms [7,14,15,24,39] and their combination [22,26,[40][41][42][43] have been employed in the literature. In our previous study [43], the merits and demerits of each optimisation approach were discussed in detail.…”
Section: Introductionmentioning
confidence: 99%
“…In [17], a new directional algorithm is proposed, which can detect faults direction using the only sign of the imaginary part of the post-fault current phasor. The article by Costa et al [18] explains how directional relays should be coordinated to operate as fast as possible and in the adequate sequence. In relation to all papers, the review paper [19] presents the state-of-the-art technologies and techniques for determining single-phase earth fault location on distribution networks.…”
Section: Introductionmentioning
confidence: 99%
“…In [7] a local-fit method was proposed by defining reference marks based on the OCR's characteristics. Furthermore, several metaheuristic algorithms were applied, like enhanced differential evolution [8], a combination of the differential evolution and linear programming problem [9], a genetic algorithm [10], a combination of the genetic algorithm and the linear programming problem [11], or a combination of a specialized genetic algorithm and an efficient heuristic algorithm [12]. Moreover, a symbiotic organism search algorithm [13], teaching learningbased optimization [14], particle-swarm optimization [15], ant-colony optimization [16], and whale optimization algorithm [17] were also applied.…”
Section: Introductionmentioning
confidence: 99%