期刊
INFORMS JOURNAL ON COMPUTING
卷 34, 期 6, 页码 3151-3169出版社
INFORMS
DOI: 10.1287/ijoc.2022.1215
关键词
lot sizing; stochastic dual dynamic programming; stochastic optimization; stochastic demand
资金
- Mitacs
- Institut de Valorisation des Donnees (IVADO)
This study delves into lot sizing with component substitution under demand uncertainty, proposing a stochastic programming formulation using stochastic dual dynamic programming (SDDP) to optimize the problem. Computational experiments show that the heuristic version of SDDP outperforms other methods in terms of efficiency and dynamic planning capabilities.
This work investigates lot sizing with component substitution under demand uncertainty. The integration of component substitution with lot sizing in an uncertain demand context is important because the consolidation of the demand for components naturally allows risk-pooling and reduces operating costs. The considered problem is relevant not only in a production context, but also in the context of distribution planning. We propose a stochastic programming formulation for the static-dynamic type of uncertainty, in which the setup decisions are frozen but the production and consumption quantities are decided dynamically. To tackle the scalability issues commonly encountered in multistage stochastic optimization, this paper investigates the use of stochastic dual dynamic programming (SDDP). In addition, we consider various improvements of SDDP, including the use of strong cuts, the fast generation of cuts by solving the linear relaxation of the problem, and retaining the average demand scenarios. Finally, we propose two heuristics, namely, a hybrid of progressive hedging with SDDP and a heuristic version of SDDP. Computational experiments conducted on well-known instances from the literature show that the heuristic version of SDDP outperforms other methods. The proposed method can plan with up to 10 decision stages and 20 scenarios per stage, which results in 2010 scenario paths in total. Moreover, as the heuristic version of SDDP can replan to account for new information in less than a second, it is convenient in a dynamic context.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据