Comparative studies on non-convex optimization methods for transmission network expansion planning

被引:77
作者
Gallego, RA [1 ]
Monticelli, A
Romero, R
机构
[1] Univ Estadual Campinas, Campinas, Brazil
[2] UNESP, FEIS, Ilha Solteira, Brazil
关键词
simulated annealing; genetic algorithm; tabu search; network static expansion planning; combinatorial optimization;
D O I
10.1109/59.708680
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.
引用
收藏
页码:822 / 828
页数:7
相关论文
共 18 条
[1]  
Aarts E., 1989, Wiley-Interscience Series in Discrete Mathematics and Optimization
[2]  
[Anonymous], ERDA EPRI C HENN
[3]  
BALDWING CJ, 1960, T AIEE POWER APP S B, V78, P1638
[4]  
GALLEGO RA, UNPUB TRANSMISSION S
[5]  
GALLEGO RA, 1996, IEEE PES WINT M BALT
[6]   TRANSMISSION NETWORK ESTIMATION USING LINEAR PROGRAMMING [J].
GARVER, LL .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1970, PA89 (07) :1688-&
[7]  
GLDBERG DE, 1989, GENETICS ALGORITHMS
[8]  
Glover F., 1995, TABU SEARCH FUNDAMEN
[9]  
Kazarlis S.A., 1996, IEEE T POWER SYSTEMS, V11
[10]  
LAGUNA M, 1995, TABU SEARCH TUTORIAL