Author
Listed:
- Qiyuan Deng
(Shenzhen Finance Institute, School of Management and Economics, Chinese University of Hong Kong, Shenzhen, Guangdong 518172, China)
- Xiaobo Li
(Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576)
- Yun Fong Lim
(Lee Kong Chian School of Business, Singapore Management University, Singapore 178899)
- Fang Liu
(Durham University Business School, Durham University, Durham DH1 3LB, United Kingdom)
Abstract
Problem definition : We consider an online retailer selling multiple products to different zones over a finite horizon with multiple periods. At the start of the horizon, the retailer orders the products from a single supplier and stores them at multiple warehouses. The retailer determines the products’ order quantities and their storage quantities at each warehouse subject to its capacity constraint. At the end of each period, after random demands in the period are realized, the retailer chooses the retrieval quantities from each warehouse to fulfill the demands of each zone. The objective is to maximize the retailer’s expected profit over the finite horizon. Methodology/results : For the single-zone case, we show that the multiperiod problem is equivalent to a single-period problem and the optimal retrieval decisions follow a greedy policy that retrieves products from the lowest-cost warehouse. We design a nongreedy algorithm to find the optimal storage policy, which preserves a nested property: Among all nonempty warehouses, a smaller-index warehouse contains all the products stored in a larger-index warehouse. We also analytically characterize the optimal ordering policy. The multizone case is unfortunately intractable analytically, and we propose an efficient heuristic to solve it, which involves a nontrivial hybrid of three approximations. This hybrid heuristic outperforms two conventional benchmarks by up to 22.5% and 3.5% in our numerical experiments with various horizon lengths, fulfillment frequencies, warehouse capacities, demand variations, and demand correlations. Managerial implications : A case study based on data from a major fashion online retailer in Asia confirms the superiority of the hybrid heuristic. With delicate optimization, the heuristic improves the average profit by up to 16% compared with a dedicated policy adopted by the retailer. The hybrid heuristic continues to outperform the benchmarks for larger networks with various structures.
Suggested Citation
Qiyuan Deng & Xiaobo Li & Yun Fong Lim & Fang Liu, 2024.
"Optimal Policies and Heuristics to Match Supply with Demand for Online Retailing,"
Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1925-1944, September.
Handle:
RePEc:inm:ormsom:v:26:y:2024:i:5:p:1925-1944
DOI: 10.1287/msom.2021.0394
Download full text from publisher
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:ormsom:v:26:y:2024:i:5:p:1925-1944. 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.
We have no bibliographic references for this item. You can help adding them by using 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.