Surrogate-Assisted Scenario-Generation Method for Simulation-Based Stochastic Programming Problems

被引:0
作者
Suemitsu, Issei [1 ,2 ]
Izui, Kazuhiro [1 ]
机构
[1] Kyoto Univ, Dept Micro Engn, Nishikyo Ku, Kyoto 6158540, Japan
[2] Hitachi Ltd, Ctr Technol Innovat, Res & Dev Grp, Kokubunji, Tokyo 1858601, Japan
关键词
Uncertainty; Stochastic processes; Optimization; Scenario generation; Programming; Probability distribution; Monte Carlo methods; Computational modeling; Decision making; Supply chain management; Planning under uncertainty; optimization and optimal control; AI-based methods; inventory management; OPTIMIZATION;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Simulation is required in real-world industrial decision-making to model the complexity, such as supply chain management with uncertain future demand. Scenario generation is critical for handling inherent uncertainties as deterministic scenarios to solve stochastic programming problems (SPPs). Generating a minimal yet representative scenario set is important to solve simulation-based SPPs (SBSPPs) since SBSPPs require thousands of simulation iterations proportional to the number of scenarios, leading to significant computational time. However, conventional methods, such as Monte Carlo method and recent problem-driven approaches, are ineffective in solving SBSPPs due to time-consuming simulation evaluation. This paper proposes a surrogate-assisted scenario-generation method called Inferred Cost-Space Scenario Clustering (ICSSC) that is applicable to various SPPs including SBSPPs. ICSSC employs a scenario clustering based on a new cost-space scenario distance evaluated by the surrogate model trained with offline simulation data to quickly approximate simulation evaluations. We conducted three types of numerical experiments to validate the effectiveness: Markowitz portfolio optimization, stochastic server location, and inventory placement optimization. Empirical results revealed that ICSSC could generate an effective scenario set based on the impact of uncertainties on decision outcomes for broader SPPs, and yields better solutions with 7.2 times shorter runtime than Monte Carlo methods.
引用
收藏
页码:13161 / 13174
页数:14
相关论文
共 42 条
[1]  
Ahmed S, 2015, SIPLIB STOCHASTIC IN
[2]  
Arnold DV, 2002, IEEE T EVOLUT COMPUT, V6, P30, DOI [10.1109/4235.985690, 10.1023/A:1015059928466]
[3]  
Baharom N., 2018, J. Comput. Res. Innov, V3, P38
[4]   Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization [J].
Bertsimas, Dimitris ;
Mundru, Nishanth .
OPERATIONS RESEARCH, 2023, 71 (04) :1343-1361
[5]  
Birge J. R., 2011, Springer Series in Operations Research and Financial Engineering, V831
[6]   Repetitive Scenario Design [J].
Calafiore, Giuseppe C. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2017, 62 (03) :1125-1137
[7]   Scenario generation for stochastic optimization problems via the sparse grid method [J].
Chen, Michael ;
Mehrotra, Sanjay ;
Papp, David .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2015, 62 (03) :669-692
[8]   Multi-Fidelity Simulation Modeling for Discrete Event Simulation: An Optimization Perspective [J].
Chen, Wenjie ;
Hong, Wenjing ;
Zhang, Hu ;
Yang, Peng ;
Tang, Ke .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2023, 20 (02) :1156-1169
[9]   An Adaptive Gaussian Process-Based Search for Stochastically Constrained Optimization via Simulation [J].
Chen, Wenjie ;
Guo, Hainan ;
Tsui, Kwok-Leung .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2021, 18 (04) :1718-1729
[10]   Problem-Driven Scenario Generation for Stochastic Programming Problems: A Survey [J].
Chou, Xiaochen ;
Messina, Enza .
ALGORITHMS, 2023, 16 (10)