Research and improvement of ant colony algorithm based on TSP

Ant colony algorithm is a new algorithm of heuristic bionic calculation. Now, it has been widely applied in many fields of combinatorial optimization. This paper elaborates the basic principle and mathematical model of typical ant colony algorithm for solving the traveling salesman problem, and analyzes impact of the optimal parameters to the performance of algorithm. Based on its shortages, an improved algorithm by dynamically adjusting parameters is proposed. Finally, the paper gives the simulation result, and it indicates the improved algorithm has a better performance.