Research On Dynamic Scheduling Of Express Vehicle Based On Ant Colony Algorithm

With the rapid growth of China's express delivery industry,there are also a number of problems emerged.For example,price competition,express vehicle violations,express parcel security issues,by the limited transport capacity of express delivery companies,the continuous growth of express transport demand is limited by the transport capacity of enterprises can not be met and so on.The contradiction between supply and demand has become the focus problem to be solved urgently.As one of the core issues in the study of transport management,vehicle routing problem(VRP)has been highly concerned by experts and scholars,and has become a hot research topic.This paper focuses on the dynamic vehicle routing problem with obstacle area(VRPOA),based on ant colony algorithm on two-dimensional path planning algorithm to solve the problem of express delivery vehicle routing arrangements and vehicle assignment,then to enrich the application scenarios of ant colony algorithm to solve the vehicle routing problem and provide decision-making basis of the vehicle routing planning for express delivery enterprises.In this paper,the VRPOA problem is the object of study,the key is to combine the ant colony algorithm and path planning algorithm to solve the results faster and better.The main research work is as follows:First,look for problems that need to be studied.Through reading a lot of literature,we have made a detailed summary of the definition,classification,complexity and algorithm of vehicle routing problem,found the theoretical model of vehicle routing problem has been mature,But in practical application,considering the actual application scenarios,further research is needed.Second,determine the research methods.Through the accumulation of literature reading,it is found that heuristic algorithm is needed to solve the problem of vehicle routing problem which is a kind of NP-hard problem.Ant colony algorithm has become an effective tool to solve the discrete optimization problem,and has obvious advantages.MAKLINK graph theory can generate the feasible space of dimension route planning.Dijkstra algorithm is a effective algorithm to solve the shortest path problem in the graph,can be used for local vehicle routing optimization.Once again,model construction.Aiming at the problem of delivery vehicle routing problem,a single objective mathematical model with the shortest distance as the target is constructed,and the algorithm and solution strategy are designed.Finally,referring to Problems Benchmark,a numerical example is designed.Experimental results show that the proposed algorithm based on ant colony algorithm for solving the VRPOA problem is effective.