Large-Scale Network Layout Optimization for Radial Distribution Networks by Parallel Computing: Implementation and Numerical Results

Moreira, José Cláudio Fonseca; Miguez, E.; Vilacha, C.; Otero, Antonio F.

doi:10.1109/tpwrd.2012.2190305

Cited by 20 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

A review of power distribution planning in the modern power systems era: Models, methods and future research

Georgilakis

Hatziargyriou

2015

Electric Power Systems Research

372

175

View full text Add to dashboard Cite

Section: Practical Heuristic Algorithmsmentioning

confidence: 99%

“…DG integration [58] Jul. 2012 The PDP model [44] is validated and applied for solving large-scale PDP problems in reduced time.…”

Section: Referencementioning

confidence: 99%

A review of power distribution planning in the modern power systems era: Models, methods and future research

Georgilakis

Hatziargyriou

2015

Electric Power Systems Research

372

175

View full text Add to dashboard Cite

“…For parallel computing of distribution network, decoupling and segmentation processing of network structure is the main way to reduce the complexity of large-scale optimisation problems. The main idea is to divide the topological structure of the distribution network into multiple sub-region modules without direct electrical connection according to the structural characteristics of the distribution network [13,14]. There are various simple structures and data forms in each sub-region, so as to achieve the purpose of splitting the optimisation problem according to a specific dimension, so that the overall optimisation problem can be decomposed into multiple relatively independent optimisation subproblem.…”

Section: Introductionmentioning

confidence: 99%

Partition decoupling model and method in power distribution network, part II: A novel partitioning optimisation operation method

Sheng

2023

IET Cyber-Phy Sys Theory & Ap

View full text Add to dashboard Cite

In this study, a partition optimisation method for distribution network is proposed to realise decoupling coordination, which provides a research basis for optimising power flow and operation regulation. Firstly, a partition model of distribution network is established, in which the electrical distance, parallel computing efficiency, and operation stability indexes are considered at the same time; Secondly, the AHC algorithm is used to realise the automatic search partition of the distribution network, and the class spacing measurement factors of point‐to‐point, cluster‐to‐cluster are considered in this method. Finally, the Distributed Sequential Quadratic Programming for Distributed Generation (DSQP‐DG) is introduced, and the parallel decoupling coordination of the distribution network is realised by alternate iteration of its inner and outer layers.

show abstract

“…The other crucial components of the total cost, such as loss costs and others, are neglected. On the contrary, the method proposed in [26] prefers to start from the other extreme, a star-like topology. Load nodes are connected to the feeding point via straight lines.…”

Section: Introductionmentioning

confidence: 99%

Slime Mold Inspired Distribution Network Initial Solution

et al. 2020

View full text Add to dashboard Cite

Electricity distribution network optimisation has attracted attention in recent years due to the widespread penetration of distributed generation. A considerable portion of network optimisation algorithms rely on an initial solution that is supposed to bypass the time-consuming steps of optimisation routines. The aim of this paper is to present a nature inspired algorithm for initial network generation. Based on slime mold behaviour, the algorithm can generate a large-scale network in a reasonable computation time. A mathematical formulation and parameter exploration of the slime mold algorithm are presented. Slime mold networks resemble a relaxed minimum spanning tree with better balance between the investment and loss costs of a distribution network. Results indicate lower total costs for suburban and urban networks.

show abstract

Large-Scale Network Layout Optimization for Radial Distribution Networks by Parallel Computing: Implementation and Numerical Results

Cited by 20 publications

References 15 publications

A review of power distribution planning in the modern power systems era: Models, methods and future research

A review of power distribution planning in the modern power systems era: Models, methods and future research

Partition decoupling model and method in power distribution network, part II: A novel partitioning optimisation operation method

Slime Mold Inspired Distribution Network Initial Solution

Contact Info

Product

Resources

About