4.7 Article

Dynamic optimization with side information

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 304, 期 2, 页码 634-651

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2022.03.030

关键词

Stochastic programming; Distributionally robust optimization; Machine learning; Dynamic optimization

向作者/读者索取更多资源

This article presents a data-driven approach that incorporates side information into multi-stage stochastic programming using predictive machine learning methods. The proposed method achieves asymptotic optimality for multi-period stochastic programming with side information, and introduces a general-purpose approximation for dynamic problems that produces high-quality solutions.
We develop a tractable and flexible data-driven approach for incorporating side information into multi-stage stochastic programming. The proposed framework uses predictive machine learning methods (such as k-nearest neighbors, kernel regression, and random forests) to weight the relative importance of vari-ous data-driven uncertainty sets in a robust optimization formulation. Through a novel measure concen-tration result for a class of supervised machine learning methods, we prove that the proposed approach is asymptotically optimal for multi-period stochastic programming with side information. We also describe a general-purpose approximation for these optimization problems, based on overlapping linear decision rules, which is computationally tractable and produces high-quality solutions for dynamic problems with many stages. Across a variety of multi-stage and single-stage examples in inventory management, finance, and shipment planning, our method achieves improvements of up to 15% over alternatives and requires less than one minute of computation time on problems with twelve stages.(c) 2022 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据