2006 IEEE Power Engineering Society General Meeting 2006
DOI: 10.1109/pes.2006.1708995
|View full text |Cite
|
Sign up to set email alerts
|

A new heuristic reconfiguration algorithm for large distribution systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

3
84
0
13

Year Published

2009
2009
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 49 publications
(100 citation statements)
references
References 0 publications
3
84
0
13
Order By: Relevance
“…Item 3 ensures simplicity of the overall procedure by relying on an existing power flow tool (used as repeated power flow computation) to identify sterilizing substations and compute the maximum generation amount in the remaining ones. Item 4 implies running optimal network reconfiguration for active power losses reduction [15] since it has potential to increase system capacity [16].…”
Section: Gcan Computationmentioning
confidence: 99%
See 4 more Smart Citations
“…Item 3 ensures simplicity of the overall procedure by relying on an existing power flow tool (used as repeated power flow computation) to identify sterilizing substations and compute the maximum generation amount in the remaining ones. Item 4 implies running optimal network reconfiguration for active power losses reduction [15] since it has potential to increase system capacity [16].…”
Section: Gcan Computationmentioning
confidence: 99%
“…Many algorithms were proposed for optimal network reconfiguration [15,16]. Through extensive testing of different algorithms we found that the heuristic one of [15] is particularly useful based on its simplicity and ability to attain the solution comparable with more sophisticated algorithms.…”
Section: Optimal Network Reconfigurationmentioning
confidence: 99%
See 3 more Smart Citations