IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v59y2011i4p929-941.html
   My bibliography  Save this article

Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator

Author

Listed:
  • Woonghee Tim Huh

    (Sauder School of Business, University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada)

  • Retsef Levi

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Paat Rusmevichientong

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

  • James B. Orlin

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

Abstract

Using the well-known product-limit form of the Kaplan-Meier estimator from statistics, we propose a new class of nonparametric adaptive data-driven policies for stochastic inventory control problems. We focus on the distribution-free newsvendor model with censored demands. The assumption is that the demand distribution is not known and there are only sales data available. We study the theoretical performance of the new policies and show that for discrete demand distributions they converge almost surely to the set of optimal solutions. Computational experiments suggest that the new policies converge for general demand distributions, not necessarily discrete, and demonstrate that they are significantly more robust than previously known policies. As a by-product of the theoretical analysis, we obtain new results on the asymptotic consistency of the Kaplan-Meier estimator for discrete random variables that extend existing work in statistics. To the best of our knowledge, this is the first application of the Kaplan-Meier estimator within an adaptive optimization algorithm, in particular, the first application to stochastic inventory control models. We believe that this work will lead to additional applications in other domains.

Suggested Citation

  • Woonghee Tim Huh & Retsef Levi & Paat Rusmevichientong & James B. Orlin, 2011. "Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator," Operations Research, INFORMS, vol. 59(4), pages 929-941, August.
  • Handle: RePEc:inm:oropre:v:59:y:2011:i:4:p:929-941
    DOI: 10.1287/opre.1100.0906
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1100.0906
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.1100.0906?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Samuel Karlin, 1960. "Dynamic Inventory Policy with Varying Stochastic Demands," Management Science, INFORMS, vol. 6(3), pages 231-258, April.
    2. Oded Berman & Richard C. Larson, 2001. "Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming," Transportation Science, INFORMS, vol. 35(2), pages 192-213, May.
    3. Li Chen & Erica L. Plambeck, 2008. "Dynamic Inventory Management with Learning About the Demand Distribution and Substitution Probability," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 236-256, May.
    4. Katy S. Azoury, 1985. "Bayes Solution to Dynamic Inventory Models Under Unknown Demand Distribution," Management Science, INFORMS, vol. 31(9), pages 1150-1160, September.
    5. Steven Nahmias, 1994. "Demand estimation in lost sales inventory systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 739-757, October.
    6. Garrett van Ryzin & Jeff McGill, 2000. "Revenue Management Without Forecasting or Optimization: An Adaptive Algorithm for Determining Airline Seat Protection Levels," Management Science, INFORMS, vol. 46(6), pages 760-775, June.
    7. Dimitris Bertsimas & Aurélie Thiele, 2006. "A Robust Optimization Approach to Inventory Theory," Operations Research, INFORMS, vol. 54(1), pages 150-168, February.
    8. Xiangwen Lu & Jing-Sheng Song & Kaijie Zhu, 2008. "Analysis of Perishable-Inventory Systems with Censored Demand Data," Operations Research, INFORMS, vol. 56(4), pages 1034-1038, August.
    9. Martin A. Lariviere & Evan L. Porteus, 1999. "Stalking Information: Bayesian Inventory Management with Unobserved Lost Sales," Management Science, INFORMS, vol. 45(3), pages 346-363, March.
    10. Georgia Perakis & Guillaume Roels, 2008. "Regret in the Newsvendor Model with Partial Information," Operations Research, INFORMS, vol. 56(1), pages 188-203, February.
    11. Xiaomei Ding & Martin L. Puterman & Arnab Bisi, 2002. "The Censored Newsvendor and the Optimal Acquisition of Information," Operations Research, INFORMS, vol. 50(3), pages 517-527, June.
    12. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.
    13. Woonghee Tim Huh & Paat Rusmevichientong, 2009. "A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 103-123, February.
    14. Retsef Levi & Robin O. Roundy & David B. Shmoys, 2007. "Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models," Mathematics of Operations Research, INFORMS, vol. 32(4), pages 821-839, November.
    15. Ahmed, Shabbir & Cakmak, Ulas & Shapiro, Alexander, 2007. "Coherent risk measures in inventory problems," European Journal of Operational Research, Elsevier, vol. 182(1), pages 226-238, October.
    16. Warren Powell & Andrzej Ruszczyński & Huseyin Topaloglu, 2004. "Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 814-836, November.
    17. George R. Murray, Jr. & Edward A. Silver, 1966. "A Bayesian Analysis of the Style Goods Inventory Problem," Management Science, INFORMS, vol. 12(11), pages 785-797, July.
    18. Donald L. Iglehart, 1964. "The Dynamic Inventory Problem with Unknown Demand Distribution," Management Science, INFORMS, vol. 10(3), pages 429-440, April.
    19. Apostolos N. Burnetas & Craig E. Smith, 2000. "Adaptive Ordering and Pricing for Perishable Products," Operations Research, INFORMS, vol. 48(3), pages 436-443, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Woonghee Tim Huh & Paat Rusmevichientong, 2009. "A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 103-123, February.
    2. Hao Yuan & Qi Luo & Cong Shi, 2021. "Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs," Management Science, INFORMS, vol. 67(10), pages 6089-6115, October.
    3. Retsef Levi & Robin O. Roundy & David B. Shmoys, 2007. "Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models," Mathematics of Operations Research, INFORMS, vol. 32(4), pages 821-839, November.
    4. Omar Besbes & Alp Muharremoglu, 2013. "On Implications of Demand Censoring in the Newsvendor Problem," Management Science, INFORMS, vol. 59(6), pages 1407-1424, June.
    5. Aditya Jain & Nils Rudi & Tong Wang, 2015. "Demand Estimation and Ordering Under Censoring: Stock-Out Timing Is (Almost) All You Need," Operations Research, INFORMS, vol. 63(1), pages 134-150, February.
    6. Woonghee Tim Huh & Paat Rusmevichientong, 2014. "Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 150-159, February.
    7. Jiri Chod & Mihalis G. Markakis & Nikolaos Trichakis, 2021. "On the Learning Benefits of Resource Flexibility," Management Science, INFORMS, vol. 67(10), pages 6513-6528, October.
    8. Cong Shi & Weidong Chen & Izak Duenyas, 2016. "Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand," Operations Research, INFORMS, vol. 64(2), pages 362-370, April.
    9. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    10. Lin An & Andrew A. Li & Benjamin Moseley & R. Ravi, 2023. "The Nonstationary Newsvendor with (and without) Predictions," Papers 2305.07993, arXiv.org, revised Jul 2024.
    11. Gah-Yi Ban, 2020. "Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring," Operations Research, INFORMS, vol. 68(2), pages 309-326, March.
    12. Zhang, Jian & Zhang, Juliang & Hua, Guowei, 2016. "Multi-period inventory games with information update," International Journal of Production Economics, Elsevier, vol. 174(C), pages 119-127.
    13. Gah-Yi Ban & Cynthia Rudin, 2019. "The Big Data Newsvendor: Practical Insights from Machine Learning," Operations Research, INFORMS, vol. 67(1), pages 90-108, January.
    14. Gen Sakoda & Hideki Takayasu & Misako Takayasu, 2019. "Data Science Solutions for Retail Strategy to Reduce Waste Keeping High Profit," Sustainability, MDPI, vol. 11(13), pages 1-30, June.
    15. Boxiao Chen & Xiuli Chao, 2020. "Dynamic Inventory Control with Stockout Substitution and Demand Learning," Management Science, INFORMS, vol. 66(11), pages 5108-5127, November.
    16. Satya S. Malladi & Alan L. Erera & Chelsea C. White, 2023. "Inventory control with modulated demand and a partially observed modulation process," Annals of Operations Research, Springer, vol. 321(1), pages 343-369, February.
    17. Li, Tianyun & Fang, Weiguo & Baykal-Gürsoy, Melike, 2021. "Two-stage inventory management with financing under demand updates," International Journal of Production Economics, Elsevier, vol. 232(C).
    18. Arnab Bisi & Maqbool Dada, 2007. "Dynamic learning, pricing, and ordering by a censored newsvendor," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(4), pages 448-461, June.
    19. Alp Akcay & Bahar Biller & Sridhar Tayur, 2011. "Improved Inventory Targets in the Presence of Limited Historical Demand Data," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 297-309, July.
    20. Mila Nambiar & David Simchi‐Levi & He Wang, 2021. "Dynamic Inventory Allocation with Demand Learning for Seasonal Goods," Production and Operations Management, Production and Operations Management Society, vol. 30(3), pages 750-765, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:59:y:2011:i:4:p:929-941. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.