窗口(计算)
订单(交换)
计算机科学
数学优化
运筹学
数学
业务
万维网
财务
作者
Zhou Quan,Mehmet Gümüş,Sentao Miao
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2025-07-11
卷期号:73 (6): 2914-2932
标识
DOI:10.1287/opre.2023.0453
摘要
Middle-Mile E-Commerce Order Fulfillment In “E-Commerce Order Fulfillment Problem with Limited Time Window,” Zhou, Gümüş, and Miao investigate how online retailers can improve order fulfillment by utilizing the limited fulfillment window in middle-mile logistics. The authors first characterize an optimal policy and then, introduce two simple heuristic approaches for fulfillment decisions based on Lagrangian relaxation. They show that the proposed algorithms are asymptotically optimal when the number of demand locations increases. They also discover that integrating the information about remaining fulfillment windows into the decision-making process can yield additional benefits. Their findings suggest that online retailers can gain a competitive advantage by offering customers options, such as a “two-day fulfillment” service instead of a “same-day fulfillment” service, particularly when faced with limited logistical capacities.
科研通智能强力驱动
Strongly Powered by AbleSci AI