Robust Stochastic Lot-Sizing by Means of Histograms

被引:70
作者
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
相关论文
共 33 条
[1]   Coherent risk measures in inventory problems [J].
Ahmed, Shabbir ;
Cakmak, Ulas ;
Shapiro, Alexander .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (01) :226-238
[2]  
[Anonymous], 1986, Probability and Measure
[3]  
[Anonymous], 2000, Simulation modeling and analysis
[4]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[5]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[6]   A robust optimization approach to inventory theory [J].
Bertsimas, D ;
Thiele, A .
OPERATIONS RESEARCH, 2006, 54 (01) :150-168
[7]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[8]   Robust discrete optimization and network flows [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71
[9]   Computing robust basestock levels [J].
Bienstock, Daniel ;
Ozbay, Nuri .
DISCRETE OPTIMIZATION, 2008, 5 (02) :389-414
[10]   Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The finite horizon case [J].
Chen, X ;
Simchi-Levi, D .
OPERATIONS RESEARCH, 2004, 52 (06) :887-896