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 条
  • [21] Pricing and Lot-Sizing for Continuously Decaying Items with Stochastic Demand
    Kitaeva, Anna V.
    Stepanova, Natalia V.
    Zukovskaya, Alexandra O.
    IFAC PAPERSONLINE, 2017, 50 (01): : 10160 - 10165
  • [22] Robust optimization for lot-sizing problems under yield uncertainty
    Metzker, Paula
    Thevenin, Simon
    Adulyasak, Yossiri
    Dolgui, Alexandre
    COMPUTERS & OPERATIONS RESEARCH, 2023, 149
  • [23] The robust multi-plant capacitated lot-sizing problem
    Aura Jalal
    Aldair Alvarez
    Cesar Alvarez-Cruz
    Jonathan De La Vega
    Alfredo Moreno
    TOP, 2023, 31 : 302 - 330
  • [24] A cash constrained single item stochastic lot-sizing problem
    Chen, Zhen
    Rossi, Roberto
    IFAC PAPERSONLINE, 2019, 52 (13): : 1479 - 1483
  • [25] Evaluation of solution approaches for a stochastic lot-sizing and sequencing problem
    Schemeleva, Kseniya
    Delorme, Xavier
    Dolgui, Alexandre
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2018, 199 : 179 - 192
  • [26] Adaptive robust optimization for lot-sizing under yield uncertainty
    Soares, Paula Metzker
    Thevenin, Simon
    Adulyasak, Yossiri
    Dolgui, Alexandre
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 313 (02) : 513 - 526
  • [27] A perfect information lower bound for robust lot-sizing problems
    Santos, Marcio Costa
    Poss, Michael
    Nace, Dritan
    ANNALS OF OPERATIONS RESEARCH, 2018, 271 (02) : 887 - 913
  • [28] A perfect information lower bound for robust lot-sizing problems
    Marcio Costa Santos
    Michael Poss
    Dritan Nace
    Annals of Operations Research, 2018, 271 : 887 - 913
  • [29] The robust multi-plant capacitated lot-sizing problem
    Jalal, Aura
    Alvarez, Aldair
    Alvarez-Cruz, Cesar
    De la Vega, Jonathan
    Moreno, Alfredo
    TOP, 2023, 31 (02) : 302 - 330
  • [30] LOT-SIZING AND SEQUENCING DELAYS
    KARMARKAR, US
    MANAGEMENT SCIENCE, 1987, 33 (03) : 419 - 423