Study On Ant Colony Algorithm Based On Vehicle Routing Problem

The Ant Colony Algorithm (ACA) is a new optimization algorithm based on biologic behavior that real ants look for food in nature, which is mainly composed by pheromone refreshing, local research algorithm and roulette strategy etc. Since Italy scholar M.Dorigo put forward this algorithm in early 1990's, a lot of experts researched and improved it for different problem especially. Now, many kinds of different improved algorithms appeared, and the ability of searching for optimum solutions and convergence of these algorithms are better than the old. The Ant Colony Algorithm has already been applied to many fields successfully, such as Traveling Salesman Problem(TSP), Courses Arrangement, Intelligence Robot, Vehicle Routing Problem(VRP) and so on, and had a good effect.Vehicle Routing Problem(VRP) has become an important problem in recent years in the fields of Operational Research, Application Mathematics, Network Analysis, Graph Theory, Computer Applications, Traffic Transportation etc. It was derived from the fields of Traffic Transportation and had widely applied to communication, production, national defense, biology etc. But up to now, it was difficult to get the accurate solutions of VRP with numerous nodes. So, it has become an important issue studied by some scholars that how to get the satisfied solutions by a little of calculations.In this paper, a new improved Ant Colony Algorithm based on existing Ant Colony Algorithm was found by analyzing the Capacity Vehicle Routing Problem(CVRP), it is proved the improved ACA can solve the CVRP with little nodes by simulating of the examples.Main research work of the paper is as follows:â‘ By studying of Vehicle Routing Problem and Ant Colony Algorithm, some relevant researches domestic and international were summarized simply.â‘¡By analyzing these current Ant Colony Algorithms, an improved Ant Colony Algorithm was put forward for CVRP, the way was found for solving CVRP fast and availably, this part is also the core of the text.â‘¢Based on the idea of the improved Ant Colony Algorithm, the procedure was written by Matlab. Some simulation results of the CVRP demonstrated the effectiveness of this algorithm. This improved Ant Colony Algorithm is a effective way for CVRP, it can scientifically improve efficiency of the Logistics Distribution, which did not have a great significance only in the theoretical research but also in the applied science for the development of E-commerce and Logistics Distribution.