Simulation Based Scheduling Strategies Comparison of O2O Instant Delivery System

Abstract

O2O instant delivery is a key success factor for internet-driven traditional business revolution such as 020 fast food delivery and fetch and carry services. With its rapid development, it has to face a variety of instant delivery scheduling problems. These have become a major bottleneck for the instant delivery platforms and it’s decision makers. The traditional method based on human experience has been no longer suitable for the current scenarios with large-scale orders and randomness. Therefore, we define the scheduling problem and scheduling strategies of instant orders delivery based on the real-world investigation, and verify the feasibility of order scheduling strategies by establishing an integrated simulation platform including traffic, orders, customers and merchants based on the DRL’s sumo simulation library and the comparison of the three scheduling strategies are used to select the optimal strategy. We simply designed these three scheduling strategies: (1) RD: The platform randomly assigns the order to the rider. (2) SP-D: The generated order is dispatched in real time to the rider closest to the order. (3) BPD: After all the orders generated in a fixed period of time are put together, all the orders are dispatched to several riders. It was found that the performance of BP-D was better in the comparison of SP-D and BP-D. And we found that when it comes to dealing with large-scale orders, the BP-D can most effectively dispatch passengers, maximizing the benefits of merchants, passengers and platforms.