Optimal planning of distribution substation locations and sizes - Model and algorithm

被引:37
作者
Dai, HW
Yu, YX
Huang, CH
Wang, CS
Ge, SY
Jian, X
Yi, Z
Rui, X
机构
[1] Dept. Elec. Pwr. Eng. and Automat., Tianjin University
[2] Tianjin Electric Power Bureau
关键词
expansion planning; distribution expansion; mathematical programming;
D O I
10.1016/0142-0615(95)00064-X
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A new method is presented in this paper to solve the optimal planning problem of distribution substations. The procedure proposed here does not require candidate substation locations and can automatically select the optimal sizes, locations and service areas of substations in power distribution systems. In addition, an effective solution algorithm is also presented. (C) 1996 Elsevier Science Ltd.
引用
收藏
页码:353 / 357
页数:5
相关论文
共 14 条
[1]   NEW APPROXIMATE OPTIMIZATION METHOD FOR DISTRIBUTION-SYSTEM PLANNING [J].
AOKI, K ;
NARA, K ;
SATOH, T ;
KITAGAWA, M ;
YAMANAKA, K .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1990, 5 (01) :126-132
[2]  
CHEN LH, 1989, OPTIMIZATION METHOD
[3]  
CRAUFORD DM, 1975, IEEE T POWER APPAR S, V94, P230
[4]   COMPUTER-AIDED PLANNING OF DISTRIBUTION SUBSTATION AND PRIMARY FEEDERS [J].
ELKADY, MA .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1984, 103 (06) :1183-1189
[5]  
*EPRI, 1979, EL1198 EPRI
[6]  
GONEN T, 1986, IEE P C, V133, P398
[7]  
HONGWEI D, 1992, THESIS TIANJIN U
[8]   INTERACTIVE PROCEDURE FOR SIZING AND TIMING DISTRIBUTION SUBSTATIONS USING OPTIMIZATION TECHNIQUES [J].
MASUD, E .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1974, PA93 (05) :1281-1286
[9]   OPTIMAL DISTRIBUTION SUBSTATION AND PRIMARY FEEDER PLANNING VIA THE FIXED CHARGE NETWORK FORMULATION [J].
SUN, DI ;
FARRIS, DR ;
COTE, PJ ;
SHOULTS, RR ;
CHEN, MS .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1982, 101 (03) :602-609
[10]   A BRANCH AND BOUND MODEL FOR CHOOSING OPTIMAL SUBSTATION LOCATIONS [J].
THOMPSON, GL ;
WALL, DL .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1981, 100 (05) :2683-2688