Research On The Path Optimization Problem And Algorithm Of The Joint Delivery Of E-commerce Parcels And O2O Parcels

This article mainly studies the path planning problem and algorithm improvement of the joint distribution of e-commerce parcels and O2O parcels.This paper improves the Random Optimal Insertion Fireworks Algorithm(RBIFWA)and uses the standard dataset and Tianchi Competition dataset to verify the effectiveness of the algorithm.The path planning for the joint distribution of e-commerce parcels and O2O parcels was analyzed and modeled,and the conclusion that the path planning of ecommerce parcel distribution is similar to the CVRP problem and the path planning of O2O parcel distribution is similar to the PDPTW problem was concluded.In order to simplify the model and make relevant assumptions about the joint distribution model in combination with actual living conditions,considering that the e-commerce package delivery has the constraints of commuting time,a time window constraint is also added for each e-commerce package delivery order,so that electricity The path planning of commercial parcel delivery also translates into PDPTW problems.After analyzing and modeling the transformed problem,the related objective functions and constraints are obtained,which provides an improvement direction for the following algorithms.For the path planning model for the joint distribution of e-commerce parcels and O2O parcels,the random optimal insertion algorithm(RBI)was first improved to construct the initial solution,which not only has a simple and easy-to-understand algorithm,but also effectively increases the diversity of understanding,and then improves the firework algorithm(FWA),redesigned the explosion resource allocation method,explosion operator and mutation operator,so that the algorithm can be effectively combined with the path planning model.Finally,the standard data set TSPLIB is used to test the algorithm.Compared with other improved sub-heuristic intelligent algorithms,the results show that the improved random optimal insertion firework algorithm has better convergence ability and can obtain more accurate solutions.The data of a total of 11,270 orders from the Tianchi Contest “Fast Kilometre Speed Delivery” was used as a data set for simulation experiments.The data set was first divided according to the service scope of the distribution center to reduce the scale of the problem.The results show that the improved RBIFWA algorithm exhibits a strong local search ability in the early stage of the search,can quickly converge,and exhibits a certain global search ability in the later stage,making the algorithm difficult to fall into a local optimal solution.The area of 100 shows excellent solution ability,making the average cost of each order between 40 and 50.As the order volume increases,the algorithm faces a larger solution space,and the search easily falls into the local optimal solution.The average cost of a bill increases.The improved RBIFWA algorithm in this paper provides a solution to the path planning problem of joint distribution of e-commerce parcels and O2O parcels.