Research On Dynamic Vehicle Routing Problem Model And Algorithm Based On Real-Time Information

With the development of modern smart logistics,the traditional vehicle routing problem(VRP)model has been difficult to meet the needs of customers.Therefore,the study of dynamic vehicle routing problem(DVRP)is crucial for the development of modern smart logistics.Based on domestic and foreign DVRP research,this paper focuses on the new DVRP model and solving algorithm.The main research work of this paper is as follows:(1)Combining the previous research on DVRP problem,the research status of dynamic vehicle routing problem is expounded,and the existing problems and deficiencies are summarized.At the same time,according to different constraints,the vehicle routing problem is classified and analyzed.In addition,the algorithms commonly used to solve DVRP are also classified in detail.(2)Mathematical modeling of the dynamic single-vehicle vehicle routing problem is carried out,and a hybrid ant colony algorithm is designed to solve the problem.Firstly,the improved K-means algorithm is applied to determine the K value and the distribution area.Then the ant colony algorithm is used to generate the initial optimization path and the best cost route crossover optimization is applied to optimize the path.Finally,the 2-Opt algorithm is used to optimize the local path.In the experimental part,not only the results are directly compared based on data sets of different scales,but also the vehicle usage rate,dynamic degree and algorithm convergence are analyzed to verify the validity of the model and algorithm.(3)Modeling and solving the dynamic multi-depot vehicle routing problem(DMDVRP)are conducted in this paper.According to the characteristics of DMDVRP problem,the corresponding mathematical model is established.At the same time,the ant colony tabu algorithm and the real-time addition optimization algorithm are designed to solve the problem.The ant colony tabu algorithm uses the ant colony algorithm framework,which combines the genetic algorithm's mutation operation and tabu search algorithm.For the addition and optimization of new customers,a new real-time addition optimization algorithm was designed to achieve addition and optimization synchronization.In the experimental part,after comparing with the experimental results of the latest published papers,it is proved that the proposed algorithm can solve the DMDVRP problem efficiently.In addition,this paper also compares the optimization effect of the real-time addition optimization algorithm.Experiments show that it is an efficient addition optimization algorithm.