A Dynamic and Data-Driven Approach to the News Vendor Problem Under Cyclical Demand

  • Gokhan Metan
  • Aur’elie Thiele
Part of the Springer Optimization and Its Applications book series (SOIA, volume 30)


We consider the problem of managing the inventory of perishable goods when the demand is cyclical with unknown distribution. While traditional inventory management under uncertainty assumes the precise knowledge of the underlying probabilities, such information is difficult to obtain for time-varying processes in many real-life applications, as the evolution over time of the deterministic seasonal trend interferes with the analysis of the stochastic part of the demand. To address this issue, we propose a dynamic and data-driven approach that builds directly upon the historical observations and addresses seasonality by creating and recombining clusters of past demand points. This allows the decision maker to place his order at each time period based only on the most relevant data. The algorithm we present requires the estimation of only one parameter, the demand periodicity; furthermore, system performance is protected against estimation errors through a cluster aggregation subroutine, which recombines clusters as needed. We present extensive numerical experiments to illustrate the approach. The key contribution of the chapter is to address a logistics challenge faced by many practitioners, namely, the lack of distributional information for nonstationary demand, by integrating historical data directly into the decision-making module through an algorithm devised specifically for cyclical processes.


Optimal Order Demand Process Safety Stock Inventory Problem Cluster Aggregation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



The authors would like to thank two anonymous reviewers for their helpful suggestions. This work was supported in part by NSF Grant DMI-0540143.


  1. 1.
    Arrow K, Harris T, Marschak J (1951) Optimal Inventory Policy. Econometrica 19:250-272.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Arrow K, Karlin S, Scarf H (1958) Studies in the Mathematical Theory of Inventory and Production, Stanford University Press Palo Alto CA.MATHGoogle Scholar
  3. 3.
    Bertsimas D, Thiele A (2004) A Data-Driven Approach to Newsvendor Problems. Technical report, MIT Cambridge, MA.Google Scholar
  4. 4.
    Gallego G, Moon I (1993) The Distribution-Free Newsboy Problem: Review and Extensions. J Oper Res Soc 44:825-834.MATHCrossRefGoogle Scholar
  5. 5.
    Huber P (2003) Robust Statistics. Wiley Series in Probability and Statistics, Wiley New York, NY.Google Scholar
  6. 6.
    Jain A, Murty M, Flynn P (1999) Data Clustering: A Review. ACM Comput Surv 31:264-323.CrossRefGoogle Scholar
  7. 7.
    Kapuscinski R, Tayur S (1998) A Capacitated Production-Inventory Model with Periodic Demand. Oper Res 46:899-911.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Karlin, S (1960) Dynamic Inventory Policy with Varying Stochastic Demands. Man Sci 6:231-258.MATHMathSciNetGoogle Scholar
  9. 9.
    Karlin S (1960) Optimal Policy for Dynamic Inventory Process with Stochastic Demands Subject to Seasonal Variations. J Soc Industr Appli Math 8:611-629.CrossRefMathSciNetGoogle Scholar
  10. 10.
    Ketzenberg M, Metters R, Semple J (2006) A Heuristic for Multi-item Production with Seasonal Demand. IIE Trans 38:201-211.CrossRefGoogle Scholar
  11. 11.
    Lovejoy W (1990) Myopic Policies for Some Inventory Models with Uncertain Demand Distributions. Man Sci 36:724-738.MATHMathSciNetGoogle Scholar
  12. 12.
    MacQueen J (1967) Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press 31:264-323.Google Scholar
  13. 13.
    Metan G, Thiele A (2006) An Adaptive Algorithm for the Optimal Sample Size in the Non-Stationary Data-Driven Newsvendor Problem. In: Extending the Horizon: Advances in Computing, Optimization, and Decision Technologies, pp.77-96. Springer, New York.Google Scholar
  14. 14.
    Metters R (1998) Producing Multiple Products with Stochastic Seasonal Demand and Capacity Limits. J Oper Res Soc 49:263-272.MATHCrossRefGoogle Scholar
  15. 15.
    Morton T (1978) The Nonstationary Infinite Horizon Inventory Problem. Man Sci 24:1474-1482.MATHMathSciNetGoogle Scholar
  16. 16.
    Morton T, Pentico D (1995) The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing. Man Sci 41:334-343.MATHGoogle Scholar
  17. 17.
    Porteus E (2002) Stochastic Inventory Theory, Stanford University Press Palo Alto CA.Google Scholar
  18. 18.
    Scarf H (1958) A Min-Max Solution to an Inventory Problem. In: Studies in the Mathematical Theory of Inventory and Production, Stanford University Press Palo Alto CA.Google Scholar
  19. 19.
    Veinott A (1965) Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem. Man Sci 12:206-222.Google Scholar
  20. 20.
    Zipkin, P (1989) Critical Number Policies for Inventory Models with Periodic Data. Man Sci 35:71-80.Google Scholar

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.American AirlinesFort Worth
  2. 2.Department of Industrial and Systems EngineeringLehigh UniversityBethlehem

Personalised recommendations