订单(交换)
图层(电子)
计算机科学
订单履行
数学优化
运筹学
数学
业务
营销
供应链
化学
有机化学
财务
作者
Yanyang Zhao,Xinshang Wang,Linwei Xin
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2025-04-30
标识
DOI:10.1287/opre.2022.0100
摘要
How Online Retailers Can Fulfill Orders Faster and Cheaper in Structured RDC–FDC Networks The global surge in online shopping has driven e-retailers to rapidly expand their warehouse networks for faster deliveries. However, this has significantly increased fulfillment costs. In the paper “Multi-item Online Order Fulfillment in a Two-Layer Network,” Zhao, Wang, and Xin explore efficient ways to reduce these costs by examining how orders are allocated among warehouses in real time. They analyze a simple “myopic” algorithm, where each order is assigned immediately to the cheapest available warehouse without considering future orders. Surprisingly, this straightforward algorithm proves effective in structured warehouse networks consisting of larger regional distribution centers (RDCs) and smaller front distribution centers (FDCs), like those operated by JD.com . This contrasts sharply with more flexible fulfillment networks such as Amazon’s, where myopic algorithms usually underperform because of more complex fulfillment options requiring more advanced real-time algorithms. The key takeaway for businesses facing uncertain demand is that a less flexible fulfillment network—such as one consisting of large RDCs and smaller FDCs—enables simple and effective allocation methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI