IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v26y2024i5p1925-1944.html

Optimal Policies and Heuristics to Match Supply with Demand for Online Retailing

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
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.0394
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.0394?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. Paul H. Zipkin, 1980. "Simple Ranking Methods for Allocation of One Resource," Management Science, INFORMS, vol. 26(1), pages 34-43, January.
    2. Awi Federgruen & Gregory Prastacos & Paul H. Zipkin, 1986. "An Allocation and Distribution Model for Perishable Products," Operations Research, INFORMS, vol. 34(1), pages 75-82, February.
    3. Jason Acimovic & Stephen C. Graves, 2015. "Making Better Fulfillment Decisions on the Fly in an Online Retail Environment," Manufacturing & Service Operations Management, INFORMS, vol. 17(1), pages 34-51, February.
    4. Jason Acimovic & Stephen C. Graves, 2017. "Mitigating Spillover in Online Retailing via Replenishment," Manufacturing & Service Operations Management, INFORMS, vol. 19(3), pages 419-436, July.
    5. A. Chambolle & Ch. Dossal, 2015. "On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 968-982, September.
    6. Pavithra Harsha & Shivaram Subramanian & Joline Uichanco, 2019. "Dynamic Pricing of Omnichannel Inventories," Service Science, INFORMS, vol. 21(1), pages 47-65, January.
    7. Dr. Nikolai Ostapenko, 2013. "Online Discount Luxury: In Search of Guilty Customers," International Journal of Business and Social Research, MIR Center for Socio-Economic Research, vol. 3(2), pages 60-68, February.
    8. Zeyang Wu & Kameng Nip & Qie He, 2021. "A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1197-1212, July.
    9. Yuanguang Zhong & Zhichao Zheng & Mabel C. Chou & Chung-Piaw Teo, 2018. "Resource Pooling and Allocation Policies to Deliver Differentiated Service," Management Science, INFORMS, vol. 64(4), pages 1555-1573, April.
    10. Sentao Miao & Stefanus Jasin & Xiuli Chao, 2022. "Asymptotically Optimal Lagrangian Policies for Multi-Warehouse, Multi-Store Systems with Lost Sales," Operations Research, INFORMS, vol. 70(1), pages 141-159, January.
    11. Groenevelt, H., 1991. "Two algorithms for maximizing a separable concave function over a polymatroid feasible region," European Journal of Operational Research, Elsevier, vol. 54(2), pages 227-236, September.
    12. Dr. Nikolai Ostapenko, 2013. "Online Discount Luxury: In Search of Guilty Customers," International Journal of Business and Social Research, LAR Center Press, vol. 3(2), pages 60-68, February.
    13. Awi Federgruen & Henri Groenevelt, 1986. "The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality," Operations Research, INFORMS, vol. 34(6), pages 909-918, December.
    14. Kris Johnson Ferreira & Bin Hong Alex Lee & David Simchi-Levi, 2016. "Analytics for an Online Retailer: Demand Forecasting and Price Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 69-88, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Nannan & Methapatara, Chinnatat & Liu, Tieming & Jian, Ming, 2025. "Hedging demand uncertainty in a two-echelon supply chain: Advanced purchase discount or transshipment or both?," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).

    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. Yun Fong Lim & Song Jiu & Marcus Ang, 2021. "Integrating Anticipative Replenishment Allocation with Reactive Fulfillment for Online Retailing Using Robust Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 23(6), pages 1616-1633, November.
    2. Gabor, Adriana F. & van Ommeren, Jan-Kees & Sleptchenko, Andrei, 2022. "An inventory model with discounts for omnichannel retailers of slow moving items," European Journal of Operational Research, Elsevier, vol. 300(1), pages 58-72.
    3. Ayoub Amil & Ali Makhdoumi & Yehua Wei, 2025. "Multi-Item Order Fulfillment Revisited: LP Formulation and Prophet Inequality," Management Science, INFORMS, vol. 71(12), pages 9917-9935, December.
    4. Quan Zhou & Mehmet Gümüş & Sentao Miao, 2025. "E-Commerce Order Fulfillment Problem with Limited Time Window," Operations Research, INFORMS, vol. 73(6), pages 2914-2932, November.
    5. Sanjith Gopalakrishnan & Moksh Matta & Mona Imanpoor Yourdshahy & Vivek Choudhary, 2023. "Go Wide or Go Deep? Assortment Strategy and Order Fulfillment in Online Retail," Manufacturing & Service Operations Management, INFORMS, vol. 25(3), pages 846-861, May.
    6. Kim, Nayeon & Montreuil, Benoit & Klibi, Walid & Zied Babai, M., 2023. "Network inventory deployment for responsive fulfillment," International Journal of Production Economics, Elsevier, vol. 255(C).
    7. Xueqi Wu & Zhi‐Long Chen, 2022. "Fulfillment scheduling for buy‐online‐pickup‐in‐store orders," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2982-3003, July.
    8. Levi DeValve & Jabari Myles, 2025. "Approximation Algorithms for Dynamic Inventory Management on Networks," Management Science, INFORMS, vol. 71(7), pages 5893-5909, July.
    9. Kris Johnson Ferreira & Bin Hong Alex Lee & David Simchi-Levi, 2016. "Analytics for an Online Retailer: Demand Forecasting and Price Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 69-88, February.
    10. Santiago R. Balseiro & Omar Besbes & Dana Pizarro, 2024. "Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis," Operations Research, INFORMS, vol. 72(5), pages 2168-2189, September.
    11. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
    12. Zhou, Yong-Wu & Zhang, Xiong & Zhong, Yuanguang & Cao, Bin & Cheng, T.C. Edwin, 2021. "Dynamic pricing and cross-channel fulfillment for omnichannel retailing industry: An approximation policy and implications," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    13. Jiu, Song & Wang, Dan & Ma, Zujun, 2024. "Benders decomposition for robust distribution network design and operations in online retailing," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1069-1082.
    14. Chandrasekhar Manchiraju & Milind Dawande & Ganesh Janakiraman, 2024. "Technical Note—A Note on State-Independent Policies in Network Revenue Management," Operations Research, INFORMS, vol. 72(1), pages 277-287, January.
    15. Snoeck, André & Winkenbach, Matthias & Fransoo, Jan C., 2023. "On-demand last-mile distribution network design with omnichannel inventory," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 180(C).
    16. Torsten J. Gerpott & Jan Berends, 2022. "Competitive pricing on online markets: a literature review," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 21(6), pages 596-622, December.
    17. Snoeck, André & Winkenbach, Matthias & Fransoo, Jan C., 2023. "On-demand last-mile distribution network design with omnichannel inventory," Other publications TiSEM 83b06c9f-2a65-4aaf-880b-2, Tilburg University, School of Economics and Management.
    18. Yanzhe (Murray) Lei & Stefanus Jasin & Joline Uichanco & Andrew Vakhutinsky, 2022. "Joint Product Framing (Display, Ranking, Pricing) and Order Fulfillment Under the Multinomial Logit Model for E-Commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1529-1546, May.
    19. Zhaohui (Zoey) Jiang & Jun Li, 2025. "Instrumenting While Experimenting: An Empirical Method for Competitive Pricing at Scale," Operations Research, INFORMS, vol. 73(5), pages 2477-2495, September.
    20. Bayram, Armagan & Cesaret, Bahriye, 2021. "Order fulfillment policies for ship-from-store implementation in omni-channel retailing," European Journal of Operational Research, Elsevier, vol. 294(3), pages 987-1002.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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.

    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.