Problem-Driven Scenario Generation for Stochastic Programming Problems: A Survey

被引:1
作者
Chou, Xiaochen [1 ]
Messina, Enza [1 ]
机构
[1] Univ Milano Bicocca, Dept Informat Syst & Commun, I-20125 Milan, Italy
关键词
stochastic programming; scenario generation; machine learning; DECOMPOSITION; OPTIMIZATION; UNCERTAINTY; REDUCTION; TREES; RISK;
D O I
10.3390/a16100479
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Stochastic Programming is a powerful framework that addresses decision-making under uncertainties, which is a frequent occurrence in real-world problems. To effectively solve Stochastic Programming problems, scenario generation is one of the common practices that organizes realizations of stochastic processes with finite discrete distributions, which enables the use of mathematical programming models of the original problem. The quality of solutions is significantly influenced by the scenarios employed, necessitating a delicate balance between incorporating informative scenarios and preventing overfitting. Distributions-based scenario generation methodologies have been extensively studied over time, while a relatively recent concept of problem-driven scenario generation has emerged, aiming to incorporate the underlying problem's structure during the scenario generation process. This survey explores recent literature on problem-driven scenario generation algorithms and methodologies. The investigation aims to identify circumstances under which this approach is effective and efficient. The work provides a comprehensive categorization of existing literature, supplemented by illustrative examples. Additionally, the survey examines potential applications and discusses avenues for its integration with machine learning technologies. By shedding light on the effectiveness of problem-driven scenario generation and its potential for synergistic integration with machine learning, this survey contributes to enhanced decision-making strategies in the context of uncertainties.
引用
收藏
页数:16
相关论文
共 72 条
[1]   AN INTRODUCTION TO KERNEL AND NEAREST-NEIGHBOR NONPARAMETRIC REGRESSION [J].
ALTMAN, NS .
AMERICAN STATISTICIAN, 1992, 46 (03) :175-185
[2]  
[Anonymous], About us
[3]  
[Anonymous], 2006, Optirisk Systems: White Paper Series
[4]   A Learning-Based Algorithm to Quickly Compute Good Primal Solutions for Stochastic Integer Programs [J].
Bengio, Yoshua ;
Frejinger, Emma ;
Lodi, Andrea ;
Patel, Rahul ;
Sankaranarayanan, Sriram .
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2020, 2020, 12296 :99-111
[5]   Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization [J].
Bertsimas, Dimitris ;
Mundru, Nishanth .
OPERATIONS RESEARCH, 2023, 71 (04) :1343-1361
[6]   Robust optimization - A comprehensive survey [J].
Beyer, Hans-Georg ;
Sendhoff, Bernhard .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2007, 196 (33-34) :3190-3218
[7]   Efficient Stochastic Programming in Julia [J].
Biel, Martin ;
Johansson, Mikael .
INFORMS JOURNAL ON COMPUTING, 2022, 34 (04) :1885-1902
[8]  
Bynum M.L., 2021, PYOMO OPTIMIZATION M
[9]  
Candelieri A., 2023, P INT C OPT DEC SCI
[10]  
Chou X., 2018, AIRO Springer Series, V1, P169