Updated: Wed, 10/09/2024 - 15:16

Oct. 10-11, campus is open to McGill students, employees and essential visitors. Most classes are in-person. See Campus Public Safety website for details.


Les 10 et 11 octobre, le campus est accessible aux étudiants et au personnel de l’Université, ainsi qu’aux visiteurs essentiels. La plupart des cours ont lieu en présentiel. Voir le site Web de la Direction de la protection et de la prévention pour plus de détails.

News

Inventory Control and Learning for One-Warehouse Multistore system with Censored Demand

Published: 5 December 2023

Authors: Recep Yusuf Bekci, Mehmet Gumus and Sentao Miao.

Publication: Operations Research, Forthcoming.
Article in advance, published online: August 2, 2023.

Motivated by our collaboration with one of the largest fast-fashion retailers in Europe, we study a two-echelon inventory control problem called the one-warehouse multistore (OWMS) problem when the demand distribution is unknown. This system has a central warehouse that receives an initial replenishment and distributes its inventory to multiple stores in each time period during a finite horizon. The goal is to minimize the total expected cost, which consists of shipment, holding, lost-sales, and end-of-horizon disposal costs. The OWMS system is ubiquitous in supply chain management, yet its optimal policy is notoriously difficult to calculate even under the complete demand distribution case. In this work, we consider the OWMS problem when the demand is censored and its distribution is unknown a priori. The main challenge under the censored demand case is the difficulty in generating unbiased demand estimation. In order to address this, we propose a primal-dual algorithm in which we continuously learn the demand and make inventory control decisions on the fly. Results show that our approach has great theoretical and empirical performances.

 

Feedback

For more information or if you would like to report an error, please web.desautels [at] mcgill.ca (subject: Website%20News%20Comments) (contact us).

Back to top