Ant Colony Algorithm and Its Application in Solving the Traveling Salesman Problem

With the modernization of the rapid development of science and technology, high technology has been more and more widely applied. Ant colony algorithm is a novel category of bionic meta-heuristic system and parallel computation and positive feedback mechanism are adopted in this algorithm. Ant colony algorithm, which has strong robustness and is easy to combine with other methods in optimization, has wide application in various combined optimization fields, but the basic ant colony algorithm is of slow convergence and easy to stagnation and easily converges to local solutions. many scholars did a lot of effort to improve these weaknesses, but the research still needs improving. This paper expounds the basic principle, model, advantages and disadvantages of ant colony algorithm and the TSP problem, the concrete realization process of ant colony algorithm is put forward in solving traveling salesman problem and the simulation shows that solution is feasible.