Robust Stochastic Lot-Sizing by Means of Histograms

被引:67
|
作者
Klabjan, Diego [1 ]
Simchi-Levi, David [2 ]
Song, Miao [3 ]
机构
[1] Northwestern Univ, Dept Ind Engn & Management Sci, Evanston, IL 60208 USA
[2] MIT, Dept Civil & Environm Engn, Cambridge, MA 02139 USA
[3] Univ Hong Kong, Dept Ind & Mfg Syst Engn, Hong Kong, Hong Kong, Peoples R China
关键词
stochastic inventory control; robust optimization; dynamic programming; optimal policy; INVENTORY CONTROL; APPROXIMATION; OPTIMIZATION; DEMAND;
D O I
10.1111/j.1937-5956.2012.01420.x
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Traditional approaches in inventory control first estimate the demand distribution among a predefined family of distributions based on data fitting of historical demand observations, and then optimize the inventory control using the estimated distributions. These approaches often lead to fragile solutions whenever the preselected family of distributions was inadequate. In this article, we propose a minimax robust model that integrates data fitting and inventory optimization for the single-item multi-period periodic review stochastic lot-sizing problem. In contrast with the standard assumption of given distributions, we assume that histograms are part of the input. The robust model generalizes the Bayesian model, and it can be interpreted as minimizing history-dependent risk measures. We prove that the optimal inventory control policies of the robust model share the same structure as the traditional stochastic dynamic programming counterpart. In particular, we analyze the robust model based on the chi-square goodness-of-fit test. If demand samples are obtained from a known distribution, the robust model converges to the stochastic model with true distribution under generous conditions. Its effectiveness is also validated by numerical experiments.
引用
收藏
页码:691 / 710
页数:20
相关论文
共 50 条
  • [1] A robust dynamic planning strategy for lot-sizing problems with stochastic demands
    Raa, B
    Aghezzaf, EH
    JOURNAL OF INTELLIGENT MANUFACTURING, 2005, 16 (02) : 207 - 213
  • [2] A robust dynamic planning strategy for lot-sizing problems with stochastic demands
    B. Raa
    E. H. Aghezzaf
    Journal of Intelligent Manufacturing, 2005, 16 : 207 - 213
  • [3] On formulations of the stochastic uncapacitated lot-sizing problem
    Guan, YP
    Ahmed, S
    Miller, AJ
    Nemhauser, GL
    OPERATIONS RESEARCH LETTERS, 2006, 34 (03) : 241 - 250
  • [4] Extended formulations for stochastic lot-sizing problems
    Zhao, Chaoyue
    Guan, Yongpei
    OPERATIONS RESEARCH LETTERS, 2014, 42 (04) : 278 - 283
  • [5] Stochastic lot-sizing: Solution and heuristic methods
    Dellaert, NP
    Melo, MT
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1996, 46 : 261 - 276
  • [6] The stochastic lot-sizing problem with quantity discounts
    Jiao, Wen
    Zhang, Ju-Liang
    Yan, Hong
    COMPUTERS & OPERATIONS RESEARCH, 2017, 80 : 1 - 10
  • [7] Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties
    Hu, Zhengyang
    Hu, Guiping
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (02) : 485 - 497
  • [8] Stochastic lot-sizing with backlogging: computational complexity analysis
    Guan, Yongpei
    JOURNAL OF GLOBAL OPTIMIZATION, 2011, 49 (04) : 651 - 678
  • [9] Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem
    P. Beraldi
    G. Ghiani
    A. Grieco
    E. Guerriero
    Computational Optimization and Applications, 2006, 33 : 303 - 318
  • [10] On stochastic lot-sizing problems with random lead times
    Huang, Kai
    Kuecuekyavuz, Simge
    OPERATIONS RESEARCH LETTERS, 2008, 36 (03) : 303 - 308