Generation planning using Lagrangian relaxation and probabilistic production simulation

被引:12
作者
Chen, HY [1 ]
Wang, XF [1 ]
Zhao, XY [1 ]
机构
[1] Xian Jiaotong Univ, Dept Elect Power Engn, Xian 710049, Peoples R China
基金
中国国家自然科学基金;
关键词
generation planning; Lagrangian relaxation; probabilistic production simulation;
D O I
10.1016/j.ijepes.2004.04.001
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
Generation planning has been extensively investigated and applied to practical power industry. This paper presents the generation planning model of Jiaotong Automatic System Planning Package (JASP) of Xi'an Jiaotong University, China. JASP decomposes the generation planning problem into a high-level power plant investment decision problem and a low-level operation planning problem and solves them by a decomposition-coordination method. Lagrangian Relaxation is used to solve the power plant investment decision problem and probabilistic production simulation is used to solve the operation planning problem. The generation planning model of JASP can be easily extended to the context of market liberalization. Simulation results show that JASP can not only overcome the 'curse of dimensionality' but also find economical and technically sound generation planning scheme. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:597 / 605
页数:9
相关论文
共 19 条
[1]
[Anonymous], 1989, J CHEMOM, DOI DOI 10.1002/CEM.1180030104
[2]
DILLON TS, 1983, IEEE T POWER APPARAT, V102, P3644
[3]
DILLON TS, 1984, P 8 POW SYSTR COMP C, P207
[4]
DILLON TS, 1983, P IEEE PES WINT M JA
[5]
EDWIN KW, 1978, IEEE T POWER APPARAT, V97, P2156
[6]
[7]
AN OPTIMIZATION-BASED METHOD FOR UNIT COMMITMENT [J].
GUAN, X ;
LUH, PB ;
YAN, H ;
AMALFI, JA .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 1992, 14 (01) :9-17
[8]
HELD M, 1974, MATH PROGRAM, P63
[9]
*INT AT EN AG, 1984, WASP 3 GUID
[10]
COMPARISON OF PROBABILISTIC PRODUCTION COST SIMULATION METHODS [J].
LIN, M ;
BREIPOHL, A ;
LEE, F .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1989, 4 (04) :1326-1334