2002
DOI: 10.1109/61.974205
|View full text |Cite
|
Sign up to set email alerts
|

Comparative study of modern heuristic algorithms to service restoration in distribution systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
62
0
7

Year Published

2012
2012
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 200 publications
(69 citation statements)
references
References 11 publications
0
62
0
7
Order By: Relevance
“…Some researches adopted intelligent and heuristic algorithms to make restoration strategies. Toune et al [4] compared the efficiency of different kinds of traditional intelligent algorithms such as genetic algorithm, simulated annealing and Tabu search; human experiences and special properties of distribution network restorations are utilized in [5]- [9]. In most heuristic methods, the optimality of solution could not be guaranteed.…”
Section: Nomenclature J ∈ Imentioning
confidence: 99%
“…Some researches adopted intelligent and heuristic algorithms to make restoration strategies. Toune et al [4] compared the efficiency of different kinds of traditional intelligent algorithms such as genetic algorithm, simulated annealing and Tabu search; human experiences and special properties of distribution network restorations are utilized in [5]- [9]. In most heuristic methods, the optimality of solution could not be guaranteed.…”
Section: Nomenclature J ∈ Imentioning
confidence: 99%
“…We can see more clearly in the above figure than in Table 1, that restoration using the original model cost longer or even insufferable period of time, while using the constraint (9), time consumed is relatively shorter. When constraint (9) and (10), which are the strict and heuristic methods, are used together, the effect is the greatest. It could be predicted that we can benefit more from the proposed efficiency improving method when the computation scale becomes even larger.…”
Section: B Tests For Computational Efficiencymentioning
confidence: 99%
“…The works in [7]- [10] belong to the first three categories, which were time consuming or could not achieve the optimal value. The fourth one could get an optimal value but it usually encounters high computation burden.…”
Section: Introductionmentioning
confidence: 99%
“…Other mathematical formulations of DSR problems, which do not depend from a data structure (from an ADS), can be found in references [5] and [6].…”
Section: Modeling Of the Dsr Problemsmentioning
confidence: 99%