NEW APPROXIMATE OPTIMIZATION METHOD FOR DISTRIBUTION-SYSTEM PLANNING

被引:67
作者
AOKI, K [1 ]
NARA, K [1 ]
SATOH, T [1 ]
KITAGAWA, M [1 ]
YAMANAKA, K [1 ]
机构
[1] CHUGOKU ELECT CO INC,TECH RES CTR,DIV ELECT ENG,HIROSHIMA 730,JAPAN
关键词
Approximate solution; Combinatorial optimization; Distribution planning; Distribution system; Facility planning; Simplex algorithm;
D O I
10.1109/59.49096
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An algorithm to obtain an approximate optimal solution to the problem of large scale radial distribution system planning is proposed. The distribution planning problem is formulated as a MIP(Mixed Integer Programming) problem. The set of constraints of this problem is reduced to a set of continuous variable linear equations by using the fact that the basis of the simplex tableau consists of the power flow variables of radial branch. This linear problem is solved by pivot operations which correspond to a branch-exchange of the radial network. Numerical examples are presented to demonstrate the validity and effectiveness of the algorithm. © 1990 IEEE
引用
收藏
页码:126 / 132
页数:7
相关论文
共 8 条
[1]  
ELKADY MA, 1984, IEEE T PAS, V103
[2]  
Gonen T, 1983, IEEE T PAS, VPAS-102
[3]  
GONEN T, 1981, IEE P C, V128
[4]  
Kennington J.L., 1980, ALGORITHMS NETWORK P
[5]  
MIKIC OM, 1986, IEEE T PAS, V1
[6]  
ROSS DW, 1981, US DOE ET78C031845 R
[7]  
SAN DI, 1982, IEEE T PAS, V101
[8]  
WILLIS HL, 1985, IEEE T PAS, V104