2011
DOI: 10.1109/tpwrd.2011.2123924
|View full text |Cite
|
Sign up to set email alerts
|

Large-Scale Network Layout Optimization for Radial Distribution Networks by Parallel Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(20 citation statements)
references
References 18 publications
0
20
0
Order By: Relevance
“…This model considers all prevalent cost indices, but it is not developed for secondary distribution system planning. A simultaneous optimization of the layout and conductor type in a radial distribution network is investigated in [9]; a branch-exchange algorithm is used for layout optimization, whereas conductor optimization is solved by means of a dynamic programming algorithm. The method has been successfully tested for a large-scale network, but reliability is not considered in the proposed model.…”
Section: Constants C Lmentioning
confidence: 99%
“…This model considers all prevalent cost indices, but it is not developed for secondary distribution system planning. A simultaneous optimization of the layout and conductor type in a radial distribution network is investigated in [9]; a branch-exchange algorithm is used for layout optimization, whereas conductor optimization is solved by means of a dynamic programming algorithm. The method has been successfully tested for a large-scale network, but reliability is not considered in the proposed model.…”
Section: Constants C Lmentioning
confidence: 99%
“…A heuristic algorithm is developed to solve the PDP and a statistical approach is introduced to support network planers identify the best design strategy for given types of LV networks [45]. The PDP is solved by a branch-exchange technique in combination with minimum spanning tree [41] and DP [44,58]. The PDP is divided into the substation problem and the feeder problem; a pseudo-combinatorial algorithm solves the substation problem; next, the feeder problem is solved by two consecutive approaches: the node ordering and the node ordering directed branch exchange [14].…”
Section: Practical Heuristic Algorithmsmentioning
confidence: 99%
“…[43] May 2011 A balanced GA provides higher intensity searching and filtering of the PDP solutions. [44] Jul. 2011 A special algorithm and the utilization of parallel computing allow the solution of large-scale PDP problems.…”
Section: Referencementioning
confidence: 99%
See 1 more Smart Citation
“…Recently, parallel computing has demonstrated to be an appropriate tool for handling solution methods applicable to large-scale power systems [2]. A major goal of parallel computing is to speed up the solution of large networks.…”
Section: Introductionmentioning
confidence: 99%