Research On Location Planning And Vehicle Path Planning Of Last Mile Urban Express

The last mile of the urban express delivery and distribution route optimization problem is an important issue of urban Express enterprises,how to effectively select the sites and distribution routes is of great significance for distribution companies in order to reduce costs and improve performance.Considering the requirement that the sites has the maximum capacity constraints and the workers limited working time,while the existing literature does not include these two constraints,and the problem with the constraints is more close to the reality,the paper study the clustering site selection algorithm with capacity constraints and CVRP problem with working time constraints.The clustering algorithm with capacity constraints add capacity constraints of each cluster on the basic clustering algorithm for site selection.A proper algorithm is designed for this problem based on K-means clustering algorithm.The CVRP problem with working time constraints is based on the basic CVRP problem by adding working time constraints.A suitable algorithm is designed based on the ant colony algorithm.At the end of this paper,the two algorithms proposed in this paper are used to solve the problem of the last mile location planning and vehicle routing problem of ZMKM distribution enterprises.By comparing with the actual cost and efficiency data of enterprises,the result is better and reasonable.The algorithm proposed in this paper provides theoretical support for the application of the actual enterprise.Other distribution enterprises can also refer to the algorithm to select the sites and plan the routes.The algorithm has strong practical application value.Besides,the algorithm proposed in this paper enlarges the application scope of clustering algorithm and ant colony algorithm,and broadens the future research direction of clustering algorithm and ant colony algorithm.