Skip to main content
SpringerLink
Log in

Online Algorithms for the Newsvendor Problem with and without Censored Demands

  • Conference paper
Frontiers in Algorithmics (FAW 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6213))

Included in the following conference series:

Abstract

The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approaches for this well known problem in operations research, both for when the actual demand is known at the end of each day, and for when just the amount sold is known, i.e., the demand is censored. We present three results: (1) the first known algorithm with a bound on its worst-case performance for the censored demand newsvendor problem, (2) an algorithm with improved worst-case performance bounds for the regular newsvendor problem compared to previously known algorithms, and (3) more precise bounds on the performance of the two algorithms when they are seeded with an approximate “guess” on the optimal solution. In addition (4) we test the algorithms in a variety of simulated and real world conditions, and compare the results to those by previously known approaches. Our tests indicate that our algorithms perform comparably and often better than known approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Binali, S.: A Risk-Reward Framework for the Competitive Analysis of Financial Games. Algorithmica 25(1), 99–115 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Azoury, K.: Bayes solution to dynamic inventory models under unknown demand distribution. Management Science, 1150–1160 (1985)

    Google Scholar 

  3. Bergemann, D., Schlag, K.: Robust monopoly pricing: The case of regret. Working Paper (2005)

    Google Scholar 

  4. Bertsimas, D., Thiele, A.: A data driven approach to newsvendor problems. Technical report, Massechusetts Institute of Technology, Cambridge, MA (2005)

    Google Scholar 

  5. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  6. Burnetas, A., Smith, C.: Adaptive ordering and pricing for perishable products. Operations Research 48(3), 436–443 (2000)

    Article  Google Scholar 

  7. Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  8. Chamberlain, G.: Econometrics and decision theory. Journal of Econometrics 95(2), 255–283 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen, L., Plambeck, E.: Dynamic inventory management with learning about the demand distribution and substitution probability. Manufacturing & Service Operations Management 10(2), 236 (2008)

    Article  Google Scholar 

  10. Conrad, S.: Sales data and the estimation of demand. Operational Research Quarterly, 123–127 (1976)

    Google Scholar 

  11. Ding, X., Puterman, M., Bisi, A.: The censored newsvendor and the optimal acquisition of information. Operations Research, 517–527 (2002)

    Google Scholar 

  12. Gallego, G.: Ieor 4000: Production management lecture notes, http://www.columbia.edu/~gmg2/4000/pdf/lect_07.pdf

  13. Gallego, G., Moon, I.: The distribution free newsboy problem: Review and extensions. Journal of the Operational Research Society 44(8), 825–834 (1993)

    Article  MATH  Google Scholar 

  14. Godfrey, G.A., Powell, W.B.: An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Science 47(8), 1101–1112 (2001)

    Article  MATH  Google Scholar 

  15. Harpaz, G., Lee, W., Winkler, R.: Learning, experimentation, and the optimal output decisions of a competitive firm. Management Science, 589–603 (1982)

    Google Scholar 

  16. Huh, W., Janakiraman, G., Muckstadt, J., Rusmevichientong, P.: Asymptotic optimality of order-up-to policies in lost sales inventory systems. Management Science 55(3), 404–420 (2009)

    Article  MATH  Google Scholar 

  17. Huh, W., Rusmevichientong, P.: An Asymptotic Analysis of Inventory Planning with Censored Demand. Technical report, Columbia Working Paper (2006)

    Google Scholar 

  18. Iglehart, D.: The dynamic inventory problem with unknown demand distribution. Management Science, 429–440 (1964)

    Google Scholar 

  19. Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. Journal of Computer and System Sciences 71(3), 291–307 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. J. Comput. Syst. Sci. 71(3), 291–307 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Karlin, S.: Dynamic inventory policy with varying stochastic demands. Management Science, 231–258 (1960)

    Google Scholar 

  22. Lariviere, M., Porteus, E.: Stalking information: Bayesian inventory management with unobserved lost sales. Management Science, 346–363 (1999)

    Google Scholar 

  23. Levi, R., Roundy, R., Shmoys, D.: Provably near-optimal sampling-based algorithms for stochastic inventory control models. In: Proc. ACM Symposium on Theory of computing, pp. 739–748. ACM, New York (2006)

    Google Scholar 

  24. Lim, A.E.B., Shanthikumar, J.G.: Relative entropy, exponential utility, and robust dynamic pricing. Operations Research 55(2), 198–214 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Information and Computation, 212–261 (1994)

    Google Scholar 

  26. Liyanage, L., Shanthikumar, J.: A practical inventory control policy using operational statistics. Operations Research Letters 33(4), 341–348 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  27. Lu, X., Song, J., Zhu, K.: Inventory control with unobservable lost sales and Bayesian updates. Working Paper (2005)

    Google Scholar 

  28. Lu, X., Song, J., Zhu, K.: Analysis of Perishable-Inventory Systems with Censored Demand Data. Operations Research 56(4), 1034 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  29. Murray Jr., G., Silver, E.: A Bayesian analysis of the style goods inventory problem. Management Science, 785–797 (1966)

    Google Scholar 

  30. Nahmias, S.: Demand estimation in lost sales inventory systems. Naval Research Logistics 41(6) (1994)

    Google Scholar 

  31. O’Neil, S.: Online learning for the newsvendor problem. Master’s thesis, University of Notre Dame (2009)

    Google Scholar 

  32. O’Neil, S., Zhao, X., Sun, D., Chaudhary, A., Wei, J.C.: Coping with demand shocks: A distribution-free algorithm for solving newsvendor problems with limited demand information. (under review)

    Google Scholar 

  33. O’Neil, S., Chaudhary, A.: Comparing online learning algorithms to stochastic approaches for the Multi-Period newsvendor problem. In: Workshop on Algorithm Engineering and Experiments, p. 49 (2008)

    Google Scholar 

  34. Perakis, G., Roels, G.: Regret in the newsvendor model with partial information. Operations Research 56(1), 188–203 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  35. Porteus, E.L.: Foundations of Stochastic Inventory Theory. Stanford University Press, Stanford (2002)

    Google Scholar 

  36. Powell, W., Ruszczyński, A., Topaloglu, H.: Learning algorithms for separable approximations of discrete stochastic optimization problems. Mathematics of Operations Research, 814–836 (2004)

    Google Scholar 

  37. Raman, A., Fisher, M.: Reducing the cost of demand uncertainty through accurate response to early sales. Operations Research 44(4), 87–99 (1996)

    MATH  Google Scholar 

  38. Savage, L.J.: The theory of statistical decisions. Journal of the American Statistical Association 46, 55–67 (1951)

    Article  MATH  Google Scholar 

  39. Scarf, H.: Bayes solutions of the statistical inventory problem. The Annals of Mathematical Statistics, 490–508 (1959)

    Google Scholar 

  40. Scarf, H.: Some remarks on Bayes solutions to the inventory problem. Naval Research Logistics Quarterly 7(4), 591–596 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  41. Scarf, H.E.: A min-max solution of an inventory problem. Stanford University Press, Stanford (1958)

    Google Scholar 

  42. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  43. Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. Journal of Machine Learning Research 4, 773–818 (2003)

    MathSciNet  MATH  Google Scholar 

  44. Vairaktarakis, C.L.: Robust multi-item newsboy models with a budget constraint. International Journal of Production Economics, 213–226 (2000)

    Google Scholar 

  45. Weisstein, E.: Order statistic. From MathWorld—A Wolfram Web Resource, http://mathworld.wolfram.com/OrderStatistic.html

  46. Yu, G.: Robust economic order quantity models. European Journal of Operations Research 100(3), 482–493 (1997)

    Article  MATH  Google Scholar 

  47. Zhang, G., Xu, Y.: A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol. 55, p. 345. Springer, Heidelberg (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Notre Dame, Notre Dame, IN, 46556, USA

    Peter Sempolinski & Amitabh Chaudhary

Authors
  1. Peter Sempolinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amitabh Chaudhary
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Academia Sinica, Institute of Information Science 20, Section 2, 128 Academia Road, Nankang, 11529, Taipei, Taiwan

    Der-Tsai Lee

  2. Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA

    Danny Z. Chen

  3. State Key Laboratory of Software Engineering, Wuhan University, 430072, Wuhan, Hubei, China

    Shi Ying

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sempolinski, P., Chaudhary, A. (2010). Online Algorithms for the Newsvendor Problem with and without Censored Demands. In: Lee, DT., Chen, D.Z., Ying, S. (eds) Frontiers in Algorithmics. FAW 2010. Lecture Notes in Computer Science, vol 6213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14553-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14553-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14552-0

  • Online ISBN: 978-3-642-14553-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation