返回
A machine learning approach to two-stage adaptive robust optimization
DOI:10.1016/j.ejor.2024.06.012.png)
摘要
En 中文
We propose an approach based on machine learning to solve two-stage linear adaptive robust optimization (ARO) problems with binary here-and-now variables and polyhedral uncertainty sets. We encode the optimal here-and-now decisions, the worst-case scenarios associated with the optimal here-and-now decisions, and the optimal wait-and-see decisions into what we denote as the strategy. We solve multiple similar ARO instances in advance using the column and constraint generation algorithm and extract the optimal strategies to generate a training set. We train machine learning models that predict high-quality strategies for the here-and-now decisions, the worst-case scenarios associated with the optimal here-and-now decisions, and the wait-and-see decisions. The models can be applied to problems with varying dimensions. We also introduce novel methods to expedite training data generation and reduce the number of different target classes the machine learning algorithm needs to be trained on. We apply the proposed approach to the facility location, the multi-item inventory control and the unit commitment problems. Our approach solves ARO problems drastically faster than the state-of-the-art algorithms with high accuracy.
Keyword:
Machine learning
Adaptive robust optimization
Artificial intelligence
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective目标中具有离散不确定性的一阶段和两阶段鲁棒优化的最优方案减少
A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem用于热单位承诺问题的计算有效的混合整数线性公式

