2015
DOI: 10.1109/tsg.2014.2385309
|View full text |Cite
|
Sign up to set email alerts
|

Service Restoration of Distribution Networks Considering Switching Operation Costs and Actual Status of the Switching Equipment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0
2

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 48 publications
(33 citation statements)
references
References 28 publications
0
31
0
2
Order By: Relevance
“…Therefore, the SR problem can be considered as a problem of finding spanning trees that represent possible radial structures of the network and satisfy operating constraints. Different techniques have been proposed in [22]- [26] to generate spanning trees. A cut set theory based spanning tree search algorithm was proposed in [22], in which a new tree can be generated by operating a pair of switches (a normally closed switch and a normally open switch) and the power flow calculation is conducted to evaluate all newly formed trees.…”
Section: ) Graph Theorymentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, the SR problem can be considered as a problem of finding spanning trees that represent possible radial structures of the network and satisfy operating constraints. Different techniques have been proposed in [22]- [26] to generate spanning trees. A cut set theory based spanning tree search algorithm was proposed in [22], in which a new tree can be generated by operating a pair of switches (a normally closed switch and a normally open switch) and the power flow calculation is conducted to evaluate all newly formed trees.…”
Section: ) Graph Theorymentioning
confidence: 99%
“…After evaluating all "interested trees", the best full restoration plan can be reached. In [26], instead of substations, the nodes that are in energized areas and connect de-energized areas are considered as roots of trees, which means that the process of restoring faulted areas can be treated as a process of identifying multiple spanning trees.…”
Section: ) Graph Theorymentioning
confidence: 99%
“…On the other hand, the switching cost is considered to be infinity in this study, similar to the previous ones. It is preferred that multiple instances of energization and de‐energization of distribution feeders are avoided during the restoration process . Hence, it is assumed that once a feeder is energized, it will remain connected for the rest of the restoration period.…”
Section: Deterministic Load Restoration Problemmentioning
confidence: 99%
“…It is preferred that multiple instances of energization and de-energization of distribution feeders are avoided during the restoration process. 24 Hence, it is assumed that once a feeder is energized, it will remain connected for the rest of the restoration period. This constraint is modeled in 8:…”
Section: Constraintsmentioning
confidence: 99%
“…proposto o uso da reconfiguração para reduzir perdas técnicas. Apesar de não tratar do problema de restabelecimento diretamente, é um dos pioneiros no uso da técnica de reconfiguração de redes para tratamento de problemas de SDs, que viria a ser aplicada para o restabelecimento em vários trabalhos que tiram proveito do desenvolvimento computacional observado desde então (NGUYEN et al, 2012;SANCHES, 2013;SANCHES et al, 2014;PRADO et al, 2014;ROMERO et al, 2015;DIMITRIJEVIC et al, 2015).…”
Section: Justificativaunclassified