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

Author

Míguez, Edelmiro ; Cidrás, José ; Díaz-Dorado, Eloy ; García-Dornelas, José Luis

Author_Institution

Departamento de Enxeneria Electrica, Vigo Univ., Spain

Volume

17

Issue

4

fYear

2002

fDate

11/1/2002 12:00:00 AM

Firstpage

931

Lastpage

936

Abstract

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.

Keywords

heuristic programming; optimisation; power distribution planning; power distribution reliability; Euclidean Steiner problem; branch-exchange algorithm improvement; branch-exchange technique; heuristic algorithm; investments; large-scale distribution network planning; large-scale problems; medium-voltage power networks; optimal layout design; power losses; reliability limits; supply costs; technical constraints; transshipment nodes; Associate members; Cost function; Heuristic algorithms; Investments; Large-scale systems; Medium voltage; Power system planning; Power system reliability; Steiner trees; Substations;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/TPWRS.2002.804998

Filename

1137577