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 条
  • [31] LOT-SIZING FOR NONSTATIONARY DEMAND
    RITCHIE, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 27 (03) : 267 - 273
  • [32] Lot-sizing for industrial symbiosis
    Suzanne, Elodie
    Absi, Nabil
    Borodin, Valeria
    van den Heuvel, Wilco
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 160 (160)
  • [33] EVALUATION OF LOT-SIZING TECHNIQUES
    AXSATER, S
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1986, 24 (01) : 51 - 57
  • [34] A study of the lot-sizing polytope
    Atamürk, A
    Muñoz, JC
    MATHEMATICAL PROGRAMMING, 2004, 99 (03) : 443 - 465
  • [35] Economic lot-sizing games
    van den Heuvel, Wilco
    Borm, Peter
    Hamers, Herbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) : 1117 - 1130
  • [36] A study of the lot-sizing polytope
    Alper Atamtürk
    Juan Carlos Muñoz
    Mathematical Programming, 2004, 99 : 443 - 465
  • [37] A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
    Yongpei Guan
    Shabbir Ahmed
    George L. Nemhauser
    Andrew J. Miller
    Mathematical Programming, 2006, 105 : 55 - 84
  • [38] Stochastic lot-sizing model for deteriorating items under partial backlogging
    Tan, Yang
    Weng, Michael X.
    International Journal of Services Operations and Informatics, 2012, 7 (01) : 18 - 36
  • [39] The adaptive robust lot-sizing problem with backorders under demand uncertainty
    Metzker, Paula
    Thevenin, Simon
    Adulyasak, Yossiri
    Dolgui, Alexandre
    2021 IEEE 17TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2021, : 997 - 1001
  • [40] A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging
    Guan, Yongpei
    Miller, Andrew
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 2008, 5035 : 450 - +