MULTIYEAR EXPANSION PLANNING FOR DISTRIBUTION-SYSTEMS

被引：47

作者：

NARA, K

SATOH, T

AOKI, K

KITAGAWA, M

机构：

[1] HIROSHIMA PREFECTURAL UNIV,SHOBARA 727,JAPAN

[2] CHUGOKU ELECT,DIV ELECT ENGN POWER CO INC,HIROSHIMA,JAPAN

来源：

IEEE TRANSACTIONS ON POWER SYSTEMS | 1991年 / 6卷 / 03期

关键词：

DISTRIBUTION SYSTEM; EXPANSION PLANNING; BRANCH EXCHANGE; MIXED INTEGER PROGRAMMING; APPROXIMATE SOLUTION;

D O I：

10.1109/59.119234

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, a multi-term distribution system expansion planning method is proposed. Many mathematical programming approaches have been proposed in this area. However, because of the complexity of the problem or the limitations of a computational time and a memory size, these method can only be applied to a small scale system. In this paper, to solve large scale problems, the authors propose a new decomposition algorithm based on the branch exchange method. A n-years planning problem is decomposed into n one-year planning problems, and one-year results are coordinated through what we can call the forward/backward path. The validity and effectiveness of the algorithm are ascertained by applying it to real scale numerical examples.

引用

页码：952 / 958

页数：7