By Topic

An improved branch-exchange algorithm for large-scale distribution network planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Miguez, E. ; Departamento de Enxeneria Electrica, Vigo Univ., Spain ; Cidras, J. ; Diaz-Dorado, E. ; Garcia-Dornelas, J.L.

Design of optimal layout for medium-voltage power networks is a common issue in electrical distribution planning. Technical constraints (radial structure, voltage drops, and equipment capacity), and reliability limits must be fulfilled. The function for minimizing includes investments, power losses, and quality of supply costs. The authors present in this paper an improved algorithm based on a branch-exchange technique to solve large-scale problems. A heuristic algorithm for solving a Euclidean Steiner problem is used to improve the network by including transshipment nodes.

Published in:

Power Systems, IEEE Transactions on  (Volume:17 ,  Issue: 4 )