Integrated Forecasting and Inventory Control for Seasonal Demand

We present a data-driven forecasting technique with integrated inventory control for seasonal data, and compare it to the traditional Holt-Winters algorithm in the context of the newsvendor problem. The data-driven approach relies on (i) clustering data points reflecting a similar phase of the demand process, and (ii) computing the optimal order quantity using the critical quantile for the relevant data, i.e., data observed when the demand was in a similar phase to the one forecasted for the next time period. Results indicate that the data-driven approach achieves a 1-5% improvement in the average regret when holding and backorder costs are of the same order of magnitude. For particularly imbalanced cost structures, average regret can be improved by up to 90%. This is because traditional forecasting penalizes under- and over-shooting equally, but penalties at the inventory management level are much more severe in one case (typically, backorder) than the other (typically, holding). This suggests the data-driven approach holds much promise as a cost reduction technique.

[1]  David B. Shmoys,et al.  Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models , 2007, Math. Oper. Res..

[2]  G. Ryzin,et al.  Revenue Management Without Forecasting or Optimization: An Adaptive Algorithm for Determining Airline Seat Protection Levels , 2000 .

[3]  Jeffrey I. McGill,et al.  Airline Seat Allocation with Multiple Nested Fare Classes , 1993, Oper. Res..

[4]  Martin L. Puterman,et al.  The Censored Newsvendor and the Optimal Acquisition of Information , 2002, Oper. Res..

[5]  Peter R. Winters,et al.  Forecasting Sales by Exponentially Weighted Moving Averages , 1960 .

[6]  W. Art Chaovalitwongse,et al.  Optimization and logistics challenges in the enterprise , 2009 .

[7]  Russell Bent,et al.  Online Stochastic Optimization Without Distributions , 2005, ICAPS.

[8]  Warrren B Powell,et al.  An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution , 2001 .

[9]  Dimitris Bertsimas,et al.  A Data-Driven Approach To Newsvendor Problems , 2005 .

[10]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[11]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[12]  M. Dada,et al.  Dynamic learning, pricing, and ordering by a censored newsvendor , 2007 .

[13]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[14]  Gokhan Metan,et al.  A Dynamic and Data-Driven Approach to the News Vendor Problem Under Cyclical Demand , 2009 .

[15]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[16]  H. L. Le Roy,et al.  Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .

[17]  H. Robbins A Stochastic Approximation Method , 1951 .

[18]  Peter W. Glynn,et al.  A Nonparametric Approach to Multiproduct Pricing , 2006, Oper. Res..