Should Only Popular Products Be Stocked? Warehouse Assortment Selection for E-Commerce Companies

Author:

Li Xiaobo1ORCID,Lin Hongyuan23ORCID,Liu Fang4ORCID

Affiliation:

1. Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576;

2. Faculty of Business in SciTech, University of Science and Technology of China, Hefei 230026, People’s Republic of China;

3. School of Management, University of Science and Technology of China, Hefei 230026, People’s Republic of China;

4. Durham University Business School, Durham University, Durham DH1 3LB, United Kingdom

Abstract

Problem definition: This paper studies the single-warehouse assortment selection problem that aims to minimize the order fulfillment cost under the cardinality constraint. We propose two fulfillment-related cost functions corresponding to spillover fulfillment and order splitting. This problem includes the fill rate maximization problem as a special case. We show that although the objective function is submodular for a broad class of cost functions, the fill rate maximization problem with the largest order size being two is NP-hard. Methodology/results: To make the problem tractable to solve, we formulate the general warehouse assortment problem under the two types of cost functions as mixed integer linear programs (MILPs). We also provide a dynamic programming algorithm to solve the problem in polynomial time if orders are nonoverlapping. Furthermore, we propose a simple heuristic called the marginal choice indexing (MCI) policy that allows the warehouse to store the most popular products. This policy is easy to compute, and hence, it is scalable to large-size problems. Although the performance of MCI can be arbitrarily bad in some extreme scenarios, we find a general condition under which it is optimal. This condition is satisfied by many multi-purchase choice models. Managerial implications: Through extensive numerical experiments on a real-world data set from RiRiShun Logistics, we find that the MCI policy is surprisingly near optimal in all the settings we tested. Simply applying the MCI policy, the fill rate is estimated to improve by 9.18% on average compared with the current practice for the local transfer centers on the training data set. More surprisingly, the MCI policy outperforms the MILP optimal solution in 14 of 25 cases on the test data set, illustrating its robustness against demand fluctuations. History: This paper has been accepted as part of the 2021 M&SOM Data-Driven Research Challenge. Funding: This work was supported by the Singapore Ministry of Education (MoE) Tier 1 [Grant 23-0619-P0001]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0428 .

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3