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

Xiaobo Li, Hongyuan Lin, Fang Liu
{"title":"Should Only Popular Products Be Stocked? Warehouse Assortment Selection for E-Commerce Companies","authors":"Xiaobo Li, Hongyuan Lin, Fang Liu","doi":"10.1287/msom.2022.0428","DOIUrl":null,"url":null,"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 MSOM 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 .","PeriodicalId":501267,"journal":{"name":"Manufacturing & Service Operations Management","volume":"40 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2022.0428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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 MSOM 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 .
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
是否只应储存热门产品?电子商务公司的仓库分类选择
问题定义本文研究的是单一仓库品种选择问题,其目的是在数量限制条件下最大限度地降低订单履行成本。我们提出了两个与履行相关的成本函数,分别对应溢出履行和订单分割。这个问题包括作为特例的填充率最大化问题。我们的研究表明,虽然对于一大类成本函数来说,目标函数都是亚模态的,但最大订单量为 2 的填充率最大化问题却是 NP 难题。方法/结果:为了使问题易于解决,我们将两类成本函数下的一般仓库分类问题表述为混合整数线性程序(MILPs)。如果订单不重叠,我们还提供了一种动态编程算法,可在多项式时间内解决该问题。此外,我们还提出了一种简单的启发式方法,即边际选择索引(MCI)策略,允许仓库存储最受欢迎的产品。该策略易于计算,因此可扩展至大型问题。虽然在某些极端情况下,MCI 的性能可能会非常糟糕,但我们发现了一个一般条件,在这个条件下,MCI 是最优的。许多多重购买选择模型都满足这一条件。管理意义:通过对日日顺物流公司的真实数据集进行大量数值实验,我们发现 MCI 政策在所有测试环境中都出人意料地接近最优。与训练数据集上本地转运中心的现行做法相比,只需应用 MCI 政策,估计平均填充率就能提高 9.18%。更令人惊讶的是,在测试数据集的 25 个案例中,有 14 个案例的 MCI 政策优于 MILP 最佳解决方案,这说明 MCI 政策对需求波动具有稳健性:本文已作为 2021 年 MSOM 数据驱动研究挑战赛的一部分被接受:这项工作得到了新加坡教育部(MoE)一级拨款[Grant 23-0619-P0001]的支持:电子附录可在 https://doi.org/10.1287/msom.2022.0428 上查阅。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Competition in Optimal Stopping: Behavioral Insights Information Dependency in Mitigating Disruption Cascades Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning Problem Demand Equilibria in Spatial Service Systems Optimal Salesforce Compensation with General Demand and Operational Considerations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1