Probability-free solutions to the non-stationary newsvendor problem

This paper concerns the multi-period newsvendor problem. In this problem, the decision maker has to decide the order quantity of an item in the subsequent period in which the demand is usually unknown. No statistical assumptions are made about the unknown demand. We adopt an online learning method from the field of prediction with expert advice to study the non-stationary newsvendor problem. We propose newsvendor strategies for both real-valued and integer order quantities. Taking the non-stationary strategies that can switch between different order quantities as benchmark, we prove that our proposed strategies can guarantee that the newsvendor’s cumulative gains are almost as large as those of the best switching strategies with not too many switches. Simple computational experiments are further performed to illustrate the effectiveness of our strategies.

[1]  Keisuke Matsuyama,et al.  The multi-period newsboy problem , 2006, Eur. J. Oper. Res..

[2]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[3]  Yi Liao,et al.  A distribution-free newsvendor model with balking and lost sales penalty , 2011 .

[4]  I. Moon,et al.  The Distribution Free Newsboy Problem with Balking , 1995 .

[5]  Herbert E. Scarf,et al.  A Min-Max Solution of an Inventory Problem , 1957 .

[6]  J. George Shanthikumar,et al.  A practical inventory control policy using operational statistics , 2005, Oper. Res. Lett..

[7]  Ran El-Yaniv,et al.  Competitive solutions for online financial problems , 1998, CSUR.

[8]  Michael R. Wagner Fully Distribution-Free Profit Maximization: The Inventory Management Case , 2010, Math. Oper. Res..

[9]  H. Scarf Bayes Solutions of the Statistical Inventory Problem , 1959 .

[10]  G. Gallego,et al.  The Distribution Free Newsboy Problem: Review and Extensions , 1993 .

[11]  H. Scarf Some remarks on bayes solutions to the inventory problem , 1960 .

[12]  D. Iglehart The Dynamic Inventory Problem with Unknown Demand Distribution , 1964 .

[13]  Woonghee Tim Huh,et al.  A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand , 2009, Math. Oper. Res..

[14]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[15]  Maurice Queyranne,et al.  Toward Robust Revenue Management: Competitive Analysis of Online Booking , 2009, Oper. Res..

[16]  Woonghee Tim Huh,et al.  An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand , 2009, Math. Oper. Res..

[17]  Vladimir Vovk,et al.  Weak aggregating algorithm for the distribution-free perishable inventory problem , 2010, Oper. Res. Lett..

[18]  Ilkyeong Moon,et al.  Distribution free procedures for make-to-order (MTO), make-in-advance (MIA), and composite policies , 1997 .

[19]  Yuri Kalnishkan,et al.  The weak aggregating algorithm and weak mixability , 2005, J. Comput. Syst. Sci..

[20]  Mark Herbster,et al.  Tracking the Best Expert , 1995, Machine-mediated learning.

[21]  Katy S. Azoury Bayes Solution to Dynamic Inventory Models Under Unknown Demand Distribution , 1985 .

[22]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[23]  James H. Bookbinder,et al.  Estimation of Inventory Re-Order Levels Using the Bootstrap Statistical Procedure , 1989 .

[24]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[25]  Edward A. Silver,et al.  The multi-item newsvendor problem with a budget constraint and fixed ordering costs , 2000, J. Oper. Res. Soc..

[26]  Vladimir Vovk,et al.  Derandomizing Stochastic Prediction Strategies , 1997, COLT '97.

[27]  Hesham K. Alfares,et al.  The distribution-free newsboy problem: Extensions to the shortage penalty case , 2005 .

[28]  Albert P. M. Wagelmans,et al.  Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics , 2007, Oper. Res..

[29]  S. Karlin,et al.  Studies in the Mathematical Theory of Inventory and Production, by K.J. Arrow, S. Karlin, H. Scarf with contributions by M.J. Beckmann, J. Gessford, R.F. Muth. Stanford, California, Stanford University Press, 1958, X p.340p., $ 8.75. , 1959, Bulletin de l'Institut de recherches économiques et sociales.

[30]  Michael R. Wagner Online lot-sizing problems with ordering, holding and shortage costs , 2011, Oper. Res. Lett..