2020
DOI: 10.1016/j.epsr.2020.106197
|View full text |Cite
|
Sign up to set email alerts
|

An improved simulated annealing–linear programming hybrid algorithm applied to the optimal coordination of directional overcurrent relays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 60 publications
(34 citation statements)
references
References 35 publications
0
34
0
Order By: Relevance
“…Very strong exploitation can cause the slowing down of the exploration, which ultimately leads to premature convergence and an insignificant solution. To deal with this issue and to develop a more efficient algorithm, different search strategies are hybridized in the literature [6,7,9,39,43]. Similarly, the HSA is useful for exploring to find nearby global regions, but it has a problem of searching the local optima [39].…”
Section: Hybrid Hsa-bb Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Very strong exploitation can cause the slowing down of the exploration, which ultimately leads to premature convergence and an insignificant solution. To deal with this issue and to develop a more efficient algorithm, different search strategies are hybridized in the literature [6,7,9,39,43]. Similarly, the HSA is useful for exploring to find nearby global regions, but it has a problem of searching the local optima [39].…”
Section: Hybrid Hsa-bb Methodsmentioning
confidence: 99%
“…The inverse definite minimum time (IDMT) characteristic for DOCRs is widely used in the protection system [5][6][7][8][9][10][11]. It is defined as follows.…”
Section: Characteristic Of Relaymentioning
confidence: 99%
See 1 more Smart Citation
“…New and more comprehensive algorithms such as the hybridation approach have used classical and nature-inspired approaches [21] which have enhanced the convergence and effectiveness of the NIA-heuristic technique. The hybrid type algorithms in general divides the optimization problem into the subproblems, where each subproblem is solved by using a specific algorithm [78]. These techniques are the combination of mathematical and NIA-heuristic or double NIA-heuristic optimization methods, which are widely used to counter a highly constraint DOCR problem [37,[39][40][41].…”
Section: Nia-heuristic and Hybrid Approachmentioning
confidence: 99%
“…Hybrid heuristics and mathematical algorithms such as hybrid BBO and LP [23], hybrid GA and LP [27], hybrid PSO and LP [28], hybrid GA and non‐linear programming [29], hybrid gravitational search algorithm and sequential quadratic programming [30], hybrid cuckoo optimisation algorithm and LP [31], a combination of Rosen's gradient projection–complex method with GA–PSO algorithm [32] and hybrid simulated annealing and LP [33] are proposed to solve the DOCRs coordination problem. In [34], a hybrid PSO and integer linear programming is proposed to obtain optimal settings of DOCRs and the proper setting group to activate each relay in each network state.…”
Section: Introductionmentioning
confidence: 99%