1996
DOI: 10.1109/59.486140
|View full text |Cite
|
Sign up to set email alerts
|

Distribution system reconfiguration for loss reduction: an algorithm based on network partitioning theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0
2

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 75 publications
(16 citation statements)
references
References 6 publications
0
14
0
2
Order By: Relevance
“…In [2], by optimal distribution system configuration, the lowest current is determined by the optimal power flow method. Other techniques like Quadratic programming [3] and network partitioning techniques [4], a heuristic nonlinear constructive method [5] are used in earlier stages. These methods find admirable solutions for the medium size systems and are not suitable for large systems [6].…”
Section: Introductionmentioning
confidence: 99%
“…In [2], by optimal distribution system configuration, the lowest current is determined by the optimal power flow method. Other techniques like Quadratic programming [3] and network partitioning techniques [4], a heuristic nonlinear constructive method [5] are used in earlier stages. These methods find admirable solutions for the medium size systems and are not suitable for large systems [6].…”
Section: Introductionmentioning
confidence: 99%
“…This category includes valuable past procedures such as the Branch Exchange Method [1,2] and Sequence Switch Operation Method (SSOM) [3,4] or further improved techniques such as the Artificial Neural Network (ANN), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) based and other heuristic methods such as in Refs. [5][6][7][8][9][10]. The general procedure in the Branch Exchange Method starts with closing all network switches to perform a mesh configuration.…”
Section: Introductionmentioning
confidence: 99%
“…In order to avoid the evaluation of the entire space of the candidate solutions and to minimize the computation burden, several algorithms have been developed. Most authors have used different well known heuristics (branch exchange [2,3,21], branch and bound [1,4], simulated annealing [5]), other heuristic rules or meta-heuristics [7][8][9][11][12][13]15,17,22,23,25,27,28] or multi-agent technologies [20]. On the other hand, some authors have developed methods based on evolutionary computation techniques [6,14,16,18,19,24,26,29,30].…”
Section: Introductionmentioning
confidence: 99%