Managing the Personalized Order-Holding Problem in Online Retailing

Shouchang Chen, Zhenzhen Yan, Yun Fong Lim
{"title":"Managing the Personalized Order-Holding Problem in Online Retailing","authors":"Shouchang Chen, Zhenzhen Yan, Yun Fong Lim","doi":"10.1287/msom.2023.1201","DOIUrl":null,"url":null,"abstract":"Problem definition: A significant percentage of online consumers place consecutive orders within a short duration. To reduce the total order arrangement cost, an online retailer may consolidate consecutive orders from the same consumer. We investigate how long the retailer should hold the consumer’s orders before sending them to a third-party logistics provider (3PL) for processing. In this order-holding problem, we optimize the holding time to balance the total order arrangement cost and the potential delay in delivery. Methodology/results: We model the order-holding problem as a Markov decision process. We show that the optimal order-holding decisions follow a threshold-type policy that is straightforward to implement: Hold any pending orders if the holding time is within a threshold or send them to the 3PL otherwise. Whenever the consumer places a new order, the holding time is reset, and the threshold is updated based on a cumulative set of the past consecutive orders in the consumer’s shopping journey. Using a consumer’s sequential decision model, we personalize the threshold by finding its closed-form expression in the consumer’s order features. We determine the model’s coefficients and evaluate the threshold-type policy using the data of the 2020 MSOM Data Driven Research Challenge. Extensive numerical experiments suggest that the personalized threshold-type policy outperforms two commonly used benchmarks by having fewer order arrangements or shorter holding times. Furthermore, personalizing the order-holding decisions is significantly more valuable for “enterprise” customers. Managerial implications: Our research suggests a higher threshold for consumers who are more likely to place consecutive orders within a short duration. The consumers’ demographic information has a significant effect on the threshold. Specifically, the threshold is higher for “plus” consumers, female consumers, and consumers in the age group of 16–25 years. The threshold for tier 1 cities is lower than that for tier 2 to tier 4 cities but higher than that for tier 5 cities. History: This paper has been accepted for the Manufacturing & Service Operations Management Data Driven Challenge. Funding: This work was supported by the National Natural Science Foundation of China [Grants 71931009, 72201237, and 72231009], the Research Grants Council of Hong Kong [Grants 15501920 and 15501221], the Singapore Ministry of Education Academic Research Fund [Tier 1, Grant RG17/21; Tier 2, Grant MOE2019-T2-1-045], the Association of South-East Asian Nations Business Research Initiative Grant [Grant G17C20421], and the Neptune Orient Lines [Fellowship NOL21RP04]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2023.1201 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2023.1201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Problem definition: A significant percentage of online consumers place consecutive orders within a short duration. To reduce the total order arrangement cost, an online retailer may consolidate consecutive orders from the same consumer. We investigate how long the retailer should hold the consumer’s orders before sending them to a third-party logistics provider (3PL) for processing. In this order-holding problem, we optimize the holding time to balance the total order arrangement cost and the potential delay in delivery. Methodology/results: We model the order-holding problem as a Markov decision process. We show that the optimal order-holding decisions follow a threshold-type policy that is straightforward to implement: Hold any pending orders if the holding time is within a threshold or send them to the 3PL otherwise. Whenever the consumer places a new order, the holding time is reset, and the threshold is updated based on a cumulative set of the past consecutive orders in the consumer’s shopping journey. Using a consumer’s sequential decision model, we personalize the threshold by finding its closed-form expression in the consumer’s order features. We determine the model’s coefficients and evaluate the threshold-type policy using the data of the 2020 MSOM Data Driven Research Challenge. Extensive numerical experiments suggest that the personalized threshold-type policy outperforms two commonly used benchmarks by having fewer order arrangements or shorter holding times. Furthermore, personalizing the order-holding decisions is significantly more valuable for “enterprise” customers. Managerial implications: Our research suggests a higher threshold for consumers who are more likely to place consecutive orders within a short duration. The consumers’ demographic information has a significant effect on the threshold. Specifically, the threshold is higher for “plus” consumers, female consumers, and consumers in the age group of 16–25 years. The threshold for tier 1 cities is lower than that for tier 2 to tier 4 cities but higher than that for tier 5 cities. History: This paper has been accepted for the Manufacturing & Service Operations Management Data Driven Challenge. Funding: This work was supported by the National Natural Science Foundation of China [Grants 71931009, 72201237, and 72231009], the Research Grants Council of Hong Kong [Grants 15501920 and 15501221], the Singapore Ministry of Education Academic Research Fund [Tier 1, Grant RG17/21; Tier 2, Grant MOE2019-T2-1-045], the Association of South-East Asian Nations Business Research Initiative Grant [Grant G17C20421], and the Neptune Orient Lines [Fellowship NOL21RP04]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2023.1201 .
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在线零售中个性化订单持有问题的管理
问题定义:相当大比例的在线消费者在短时间内连续下单。为了降低总订单安排成本,在线零售商可以合并来自同一消费者的连续订单。我们调查零售商在将消费者的订单发送给第三方物流提供商(3PL)进行处理之前应该保留多长时间。在此订单保持问题中,我们优化保持时间以平衡总订单安排成本和潜在的交货延迟。方法/结果:我们将订单保持问题建模为马尔可夫决策过程。我们展示了最优的订单保持决策遵循一个易于实现的阈值类型策略:如果保持时间在阈值内,则保留任何未决订单,否则将其发送给第三方物流。每当消费者下一个新订单时,保持时间将被重置,并且阈值将根据消费者购物过程中过去连续订单的累积集更新。使用消费者的顺序决策模型,我们通过在消费者的订单特征中找到其封闭形式的表达式来个性化阈值。我们使用2020年MSOM数据驱动研究挑战赛的数据确定模型的系数并评估阈值型策略。大量的数值实验表明,个性化阈值型策略通过更少的订单安排或更短的保持时间优于两种常用的基准。此外,个性化保持订单的决策对“企业”客户来说更有价值。管理启示:我们的研究表明,对于那些更有可能在短时间内连续下单的消费者来说,门槛更高。消费者的人口统计信息对阈值有显著影响。具体来说,“plus”消费者、女性消费者和16-25岁年龄段的消费者的门槛更高。一线城市的门槛低于二至四线城市,但高于五线城市。历史:本文已被制造业和服务业运营管理数据驱动挑战赛接受。基金资助:中国国家自然科学基金[资助项目:71931009、72201237和72231009]、香港研究资助局[资助项目:15501920和15501221]、新加坡教育部学术研究基金[第一层,资助项目:RG17/21;第2级,资助MOE2019-T2-1-045,东南亚国家联盟商业研究倡议资助[资助G17C20421]和海王星东方航线[奖学金NOL21RP04]。补充材料:在线附录可在https://doi.org/10.1287/msom.2023.1201上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Physician Adoption of AI Assistant Disclosing Delivery Performance Information When Consumers Are Sensitive to Promised Delivery Time, Delivery Reliability, and Price Loyalty Currency and Mental Accounting: Do Consumers Treat Points Like Money? Dealership or Marketplace with Fulfillment Services: A Dynamic Comparison Introduction: Frontiers in Operations
×
引用
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