The online order fulfillment of online-to-offline (O2O) supermarket faces the challenge in how to pick orders from thousands of products on the supermarket shelves and deliver them to customers in different zones and locations by a vehicle routing method within the lowest cost and shortest time. It is critical to integrate the order picking and delivery processes and schedule them jointly with a coordinated manner. Thus, in this paper, we study the online integrated order picking and delivery problem with multizone routing method (IOPDP-MR) to minimize both the maximum delivery completion time and the total delivery cost. The online algorithm A is presented to solve the online problem and is proved to be -competitive, where is the vehicle capacity. Since it is difficult to get a lower competitive ratio theoretically, the numerical experiments are proposed to analyze the gaps by comparing the values of algorithm A with the ones of offline optimal algorithm A∗ under different situations. It can be inferred that the competitive ratio is less than 2.5 and the average flow time for customer orders is less than 30 minutes, which verifies the good performance in both computation efficiency and customer satisfaction of algorithm A.

中文翻译：

---

线上到线下超市多区域车辆路径选择与配送集成的在线调度问题研究

在线到离线（O2O）超市的在线订单履行面临着一个挑战，即如何从超市货架上的数千种产品中挑选订单，并通过车辆路由方法以最低的成本将其交付给不同区域和位置的客户。最短的时间。整合订单拣配和交付流程并以协调的方式共同安排它们至关重要。因此，在本文中，我们使用多区域路由方法（IOPDP-MR）研究在线集成订单拣选和交付问题，以最大程度地减少最大交付完成时间和总交付成本。提出了在线算法A来解决在线问题，并证明是-有竞争力，车辆容量在哪里？由于理论上很难获得较低的竞争比，因此提出了数值实验，通过比较算法A与离线优化算法A ∗在不同情况下的值来分析差距。可以推断出竞争比小于2.5，客户订单的平均流转时间小于30分钟，验证了算法A的计算效率和客户满意度方面的良好性能。