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

被引：86

作者：

Míguez, E ^{[1
]}

Cidrás, J

Díaz-Dorado, E

García-Dornelas, JL

机构：

[1] Univ Vigo, Dept Enxeneria Elect, Vigo, Spain

[2] Union Genosa SA, Madrid, Spain

来源：

IEEE TRANSACTIONS ON POWER SYSTEMS | 2002年 / 17卷 / 04期

关键词：

branch exchange; network design; power system; distribution planning; Steiner tree problems;

D O I：

10.1109/TPWRS.2002.804998

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 [电气工程]; 0809 [电子科学与技术];

摘要：

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. We 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.

引用

页码：931 / 936

页数：6

共 13 条

[1]

Two heuristics for the Euclidean Steiner tree problem [J].