Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem

被引:0
作者
Vojvodic, Goran [1 ]
Novoa, Luis J. [2 ]
Jarrah, Ahmad I. [3 ]
机构
[1] JS Held, 11710 Plaza Amer Dr 300, Reston, VA 20190 USA
[2] James Madison Univ, Coll Business, Dept Comp Informat Syst & Business Analyt, 421 Bluestone Dr, Harrisonburg, VA 22807 USA
[3] George Washington Univ, Sch Business, Dept Decis Sci, 2201 G St NW, Washington, DC 20052 USA
关键词
OR in energy; Large-scale optimization; Stochastic programming; Benders decomposition; Generation capacity expansion; CROSS-DECOMPOSITION; ALGORITHM; PROGRAMS; DESIGN;
D O I
10.1016/j.ejco.2023.100059
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The main purpose of solving a classical generation capacity expansion problem is to ensure that, in the medium-to long-term time frame, the electric utility has enough capacity available to reliably satisfy the demand for electricity from its customers. However, the ability to operate the newly built power plants also has to be considered. Operation of these plants could be curtailed by fuel availability, environmental constraints, or intermittency of renewable generation. This suggests that when generation capacity expansion problems are solved, along with the yearly timescale necessary to capture the long-term effect of the decisions, it is necessary to include a timescale granular enough to represent operations of generators with a credible fidelity. Additionally, given that the time horizon for a capacity expansion model is long, stochastic modeling of key parameters may generate more insightful, realistic, and judicious results. In the current model, we allow the demand for electricity and natural gas to behave stochastically. Together with the dual timescales, the randomness results in a large problem that is challenging to solve. In this paper, we experiment with synergistically combining elements of several methods that are, for the most part, based on Benders decomposition and construct an algorithm which allows us to find near-optimal solutions to the problem with reasonable run times.(c) 2023 The Author(s). Published by Elsevier Ltd on behalf of Association of European Operational Research Societies (EURO). This is an open access article under the CC BY-NC-ND license (http:// creativecommons .org /licenses /by -nc -nd /4 .0/).
引用
收藏
页数:52
相关论文
共 52 条
[1]   Benders Decomposition for Production Routing Under Demand Uncertainty [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
OPERATIONS RESEARCH, 2015, 63 (04) :851-867
[2]  
Alabama Power, 2019, INTEGRATED RESOURCE
[3]  
[Anonymous], 2020, Integrated Resource Plan
[4]  
[Anonymous], 2021, 117 CONG TESTIMONY J
[5]  
[Anonymous], 2021, Annual Energy Outlook
[6]   Combinatorial Benders Cuts for the Minimum Tollbooth Problem [J].
Bai, Lihui ;
Rubin, Paul A. .
OPERATIONS RESEARCH, 2009, 57 (06) :1510-1522
[7]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[8]  
Bertsimas D., 1997, INTRO LINEAR OPTIMIZ, V1st
[9]   A MULTICUT ALGORITHM FOR 2-STAGE STOCHASTIC LINEAR-PROGRAMS [J].
BIRGE, JR ;
LOUVEAUX, FV .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (03) :384-392
[10]   Dual decomposition in stochastic integer programming [J].
Caroe, CC ;
Schultz, R .
OPERATIONS RESEARCH LETTERS, 1999, 24 (1-2) :37-45