A decomposition approach to the two-stage stochastic unit commitment problem

被引:107
作者
Zheng, Qipeng P. [1 ]
Wang, Jianhui [2 ]
Pardalos, Panos M. [3 ,4 ]
Guan, Yongpei [3 ]
机构
[1] W Virginia Univ, Dept Ind & Management Syst Engn, Morgantown, WV 26506 USA
[2] Argonne Natl Lab, Decis & Informat Sci Div, Argonne, IL 60439 USA
[3] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA
[4] Natl Res Univ, Higher Sch Econ, LATNA, Moscow 101000, Russia
关键词
Benders decomposition; Energy; Two-stage stochastic unit commitment; Stochastic mixed integer programming; Mixed integer subproblem; ACCELERATING BENDERS DECOMPOSITION; INTEGER; PROGRAMS; ALGORITHM; MODEL;
D O I
10.1007/s10479-012-1092-7
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 [运筹学与控制论]; 120117 [社会管理工程];
摘要
The unit commitment problem has been a very important problem in the power system operations, because it is aimed at reducing the power production cost by optimally scheduling the commitments of generation units. Meanwhile, it is a challenging problem because it involves a large amount of integer variables. With the increasing penetration of renewable energy sources in power systems, power system operations and control have been more affected by uncertainties than before. This paper discusses a stochastic unit commitment model which takes into account various uncertainties affecting thermal energy demand and two types of power generators, i.e., quick-start and non-quick-start generators. This problem is a stochastic mixed integer program with discrete decision variables in both first and second stages. In order to solve this difficult problem, a method based on Benders decomposition is applied. Numerical experiments show that the proposed algorithm can solve the stochastic unit commitment problem efficiently, especially those with large numbers of scenarios.
引用
收藏
页码:387 / 410
页数:24
相关论文
共 43 条
[1]
[Anonymous], 1997, Introduction to stochastic programming
[2]
Balas E., 1979, Discrete Optimisation, P3
[3]
A LIFT-AND-PROJECT CUTTING PLANE ALGORITHM FOR MIXED 0-1 PROGRAMS [J].
BALAS, E ;
CERIA, S ;
CORNUEJOLS, G .
MATHEMATICAL PROGRAMMING, 1993, 58 (03) :295-324
[4]
Barth R., 2006, Probabilistic Methods Applied to Power Systems, P1
[5]
Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[6]
THE VALUE FUNCTION OF AN INTEGER-PROGRAM [J].
BLAIR, CE ;
JEROSLOW, RG .
MATHEMATICAL PROGRAMMING, 1982, 23 (03) :237-273
[7]
L-shaped decomposition of two-stage stochastic programs with integer recourse [J].
Caroe, CC ;
Tind, J .
MATHEMATICAL PROGRAMMING, 1998, 83 (03) :451-464
[8]
Stochastic optimization of unit commitment: A new decomposition framework [J].
Carpentier, P ;
Cohen, G ;
Culioli, JC ;
Renaud, A .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1996, 11 (02) :1067-1073
[9]
Conejo A.J, 2006, Decomposition Techniques in Mathematical Programming: Engineering and Science Applications
[10]
LARGE-SCALE MIXED INTEGER PROGRAMMING - BENDERS-TYPE HEURISTICS [J].
COTE, G ;
LAUGHTON, MA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 16 (03) :327-333