Solving the unit commitment problem by a unit decommitment method

被引:28
作者
Tseng, CL [1 ]
Li, CA
Oren, SS
机构
[1] Univ Maryland, Dept Civil Engn, College Pk, MD 20742 USA
[2] Pacific Gas & Elect Co, San Francisco, CA 94106 USA
[3] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
power system scheduling; unit commitment; unit decommitment; mixed-integer programming; Lagrangian relaxation; heuristic procedures;
D O I
10.1023/A:1004653526131
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we present a unified decommitment method to solve the unit commitment problem. This method starts with a solution having all available units online at all hours in the planning horizon and determines an optimal strategy for decommitting units one at a time. We show that the proposed method may be viewed as an approximate implementation of the Lagrangian relaxation approach and that the number of iterations is bounded by the number of units. Numerical tests suggest that the proposed method is a reliable, efficient, and robust approach for solving the unit commitment problem.
引用
收藏
页码:707 / 730
页数:24
相关论文
共 21 条
[21]  
ZHUANG F, 1988, THESIS MCGILL U