Research And Implementation Of The Ant Colony Algorithm For Vehicle Dispatching Decision-Making In Logistics System

In recent years, logistics industry in our country has the huge profit space and become the most important Chinese competition area. And in the operation cost of logistics enterprise distribution costs cost the high rate.Current distribution is hard to be controlled and the problems to be solved. In front of the logistics professionals is how to finish the task at the lowest cost, realize customer transportation and enterprise profit maximization. Distribution of vehicle routing problem (VRP) is the science's NP question and in real life because of its complicated factors it is more difficult to solve.Based on comprehensive analysis of heuristic algorithm, I decided to adopt the parallelism and strong robustness and positive feedback mechanism of ant colony algorithm to solve VRP. In order to solve the ant colony algorithm slow convergence speed and prone to local optimal solution, etc, we also for the most common case VRP with time window-the vehicle routing problem with time restrictions (VRPSTW) improved. The time limit into the problem of ant colony algorithm to divert probability, suit the VRPSTW the point, then I analyze and modeling for VRPSTW, with improved ant colony algorithm presented to solve specific steps.Then, the paper has completed the overall design of the system, including the system architecture design, function module design and database design, etc. Based on the actual development of the system, and finally achieve the vehicle dispatching decision-making system of the whole process.The subject of the logistics path optimization system using Google electronic map as the basis, with ArcGIS map editor and processing, with the improvement of ant colony algorithm to realize the intellectualized and visualization VRPSTW, it has strong practical value.