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

启发式 仓库 利润(经济学) 时间范围 数学优化 启发式 经济订货量 约束(计算机辅助设计) 业务 供应链 计算机科学 微观经济学 运筹学 经济 营销 数学 几何学
作者
Qiyuan Deng,Xiaobo Li,Yun Fong Lim,Fang Liu
出处
期刊:Manufacturing & Service Operations Management [Institute for Operations Research and the Management Sciences]
卷期号:26 (5): 1925-1944 被引量:4
标识
DOI:10.1287/msom.2021.0394
摘要

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. Funding: X. Li is supported by the Singapore Ministry of Education [Tier 1 Grant 23-0619-P0001]. Y. F. Lim is grateful for the support from the Singapore Management University under the Maritime and Port Authority Research Fellowship and the Singapore Ministry of Education [Tier 1 Grant MSS23B001]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2021.0394 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
yaya发布了新的文献求助10
刚刚
元清发布了新的文献求助10
刚刚
archer01发布了新的文献求助10
刚刚
2秒前
2秒前
轻舟发布了新的文献求助10
2秒前
2秒前
狐尔莫完成签到,获得积分10
2秒前
科研通AI6.2的应助被潇洒诗槐采纳,获得10
2秒前
3秒前
yy发布了新的文献求助10
3秒前
4秒前
慕青的应助被邵光顺采纳,获得10
5秒前
蚊子发布了新的文献求助30
5秒前
顾矜的应助被慈祥的涵易采纳,获得10
5秒前
酷波er的应助被温柔海采纳,获得10
6秒前
Jonathan发布了新的文献求助10
7秒前
鲁滨逊完成签到 ,获得积分10
8秒前
曾经如凡发布了新的文献求助30
8秒前
爱吃荔枝发布了新的文献求助10
9秒前
9秒前
唐宁完成签到,获得积分10
9秒前
852的应助被jie采纳,获得30
10秒前
寒冷笙完成签到,获得积分10
10秒前
上官若男的应助被白菜鸭鸭采纳,获得10
10秒前
11秒前
11秒前
科比布莱恩完成签到,获得积分10
12秒前
英姑的应助被meng采纳,获得10
12秒前
葫芦家二娃完成签到,获得积分10
13秒前
13秒前
13秒前
蚊子完成签到,获得积分20
13秒前
14秒前
Tinasmiling完成签到,获得积分20
14秒前
轻舟完成签到,获得积分20
15秒前
15秒前
16秒前
lxl有点傻发布了新的文献求助10
16秒前
轻松咖啡豆完成签到,获得积分10
16秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Rosenblum, Global Change Biology 800
自動車の空力技術 800
Organizational Behavior 510
Management and the Arts 510
Geschichtliche Grundbegriffe (GGB), Band 5: Pro–Soz 300
Die Religion in Geschichte und Gegenwart (RGG), 4. Auflage, Band 7: R–S 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7790022
求助须知:如何正确求助?哪些是违规求助? 9327554
关于积分的说明 20418946
捐赠科研通 7379554
什么是DOI,文献DOI怎么找? 3322967
关于科研通互助平台的介绍 2470897
邀请新用户注册赠送积分活动 2339810