A Study on Online Scheduling Problem of Integrated Order Picking and Delivery with Multizone Vehicle Routing Method for Online-to-Offline Supermarket

Abstract

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 2 1 + Q v -competitive, where Q v 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.

Integrated Online Order Picking and Vehicle Routing of Food Cold Chain with Demand Surge

“…Zhang et al [32] studied the joint optimization of online order picking and distribution, with the goal of minimizing the makespan and distribution cost and designing an online algorithm to solve it. Zhang et al [33] aimed at the lowest cost and shortest time, studied the online integrated order picking and distribution problem, and proposed an online algorithm to solve the online problem.…”

Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises

“…Constraint (10) denotes the finishing time of the jobs at the third stage. Constraint (11) ensures that a job can be assembled only after its two subjobs have been completed. Constraints (12) to (16) ensure that, at any time, only one job can be processed on a machine.…”

“…Peng [10] studied a joint scheduling problem of order batching and distribution routing and took the shortest total fulfillment time from order picking to distribution completion as the goal of B2C e-commerce distribution center. Zhang et al [11] studied the online integrated order picking and delivery problem with the multizone routing method to minimize the sum of the maximum delivery completion time and the total delivery cost.…”