An adaptive hybrid ant colony optimization algorithm for solving Capacitated Vehicle Routing

摘要

Ant Colony Algorithm has certain advantages in solving Capacitated Vehicle Routing Problem (CVRP), but there are still easy to fall into local optimum, the search speed etc. To overcome these problems this paper presents an adaptive hybrid Ant colony optimization algorithm for solving Capacitated Vehicle Routing Problem. The adaptive hybrid ant colony optimization algorithm uses genetic algorithms to adjust pheromone matrix algorithm, and designs an adaptive pheromone evaporation rate adjustment strategies, and uses local search strategies to reduce the amount of calculation. Experiment on Some classic problems shows that the presented algorithm for solving the Capacitated Vehicle Routing Problem is effective and has better performance.