| Vehicle routing problem is a hot issues in combinatorial optimization and the field of logistics research.With the customer's site and constraints are increase Vehicle Routing Problem search space is bigger and bigger.Based on the framework of the basic vehicle routing problem,needs a lot of time to find the optimal solution in the large space,so it is very important for the theoretical significance and practical value to find way to get high precision approximate solution in short time.Ant colony algorithm is inspired by the foraging ants in nature has emerged as an intelligent bionic algorithm,A simple general-purpose, robust and strong, positive feedback mechanism, suitable for distributed processing and so on.Therefore, using ant colony algorithm to solve the vehicle routing problem has an important significance.In this paper, an analysis of relevant literature, summarized and refined,The vehicle routing problem of the origin, development, research and application value and a variety of Research to resolve this issue were reviewed and explained the background and significance of thesis research. Through the introduction of several ant colony algorithm to design the basic method to solve traveling salesman problem, and compare the results, in-depth understanding of several ant colony model and mathematical model of ant colony algorithm parameter settings.For the MMAS algorithm, select the status of the transfer of improved strategies and pheromone update strategy, design the second ant colony algorithm to solve the vehicle routing problem.For the vehicle routing problem with time windows and vehicle routing problem, the ant colony to adopt a different model and encoding to overcome the ant colony algorithm for large-scale problems in easy to fall into local minimum defects. Solving the the standard test problems 20 distribution points provided by Solomon, the results will be compared to prove the second ant colony algorithm can be obtained on better solution. |
PDF Full Text Request