An improved hybrid ant colony algorithm and its application in solving TSP

Ant colony algorithm is a simulated evolutionary algorithm with the characteristics of positive feedback and distributed computation. It simulate the process of ants foraging to search the optimal solution. But the algorithm fall into local optimum easily and the convergence speed is very slow. After analyzing the disadvantages of ant colony algorithm, we put forward an improved hybrid ant colony algorithm. For each generation of ant colony perform crossover and mutation operations, and accept new individuals with a specified probability according to the Metropolis criterion of simulation annealing algorithm. Through series of simulation experiments' results, it can be found that the proposed algorithm is good at stability and optimization capacity.