Big Ant Ant Colony Algorithm to Solve TSP

摘要

In the TSP research,the global search capability,convergence speed and robustness have become the hot issues.This paper presents an improved algorithm based on ant colony algorithm.The algorithm introduces the concept of the big ants.So the algorithm is called as Big Ant Ant Colony Algorithm.It is abbreviated as BAACA in the paper.There are two species ants that are big ants and ordinary ants in the algorithm.They are inspired by different factors in the search.The distribution of the big ants will affect the movement of ordinary ant,and the attraction for the ordinary ants decreased on the locations where big ants have.Thus it has stronger global search capability.In the paper the BAACA is used to solute TSP.The ratio of two kinds of ants on the initial moment is determined by the experiment.The experimental results show that the number of iterations of the algorithm reduces several times or even ten times more than the basic ant colony algorithm.Besides this algorithm has stronger robustness.