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

This paper presents an algorithm to simultaneously optimize the layout and conductor type in a radial distribution network. The optimization includes the investment cost and losses in the lines, with the maximum current constraints per conductor, maximum voltage drop in any node in the network, and...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power delivery 2011-07, Vol.26 (3), p.1946-1951
Main Authors: Moreira, J. C., Miguez, E., Vilacha, C., Otero, A. F.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Branch exchange
Computation
Conductors
Conductors (devices)
Disturbances. Regulation. Protection
Electrical engineering. Electrical power engineering
Electrical power engineering
Exact sciences and technology
Feeding
Heuristic algorithms
Joining processes
Layout
Miscellaneous
network planning
Networks
Operation. Load control. Reliability
Optimization
parallel computing
Parallel processing
Planning
power distribution planning
Power networks and lines
Radial distribution
Users connections and in door installation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an algorithm to simultaneously optimize the layout and conductor type in a radial distribution network. The optimization includes the investment cost and losses in the lines, with the maximum current constraints per conductor, maximum voltage drop in any node in the network, and tapering constraints. A branch-exchange algorithm is used for layout optimization; this generates intermediate points to avoid reaching local minimums, and conductor optimization is solved with a dynamic programming algorithm. There is also a variant for use in large-scale areas with several feeding points and a set of geographically distributed loads, which do not require a preassignation of the loads, allowing their connection to the point that offers lower overall cost. To achieve reasonable resolution times, a grid is built to utilize parallel computing.
ISSN:0885-8977
1937-4208
DOI:10.1109/TPWRD.2011.2123924