Improved ant colony algorithm for solving TSP
求解TSP的改进蚁群算法

Aimed at the shortcomings, which needing much time and easier to fall in local optimal solution in the ant colony algorithm, this paper proposed an improved algorithm. Through employing the list of candidate cities in the initial pheromone matrix to decrease inferior solutions and using cluster to do the second search in the local search, it could narrow the searching range of algorithm, could improve the quality of the solution space and raise the searching speed. The simulations result for TSP shows that the algorithm is improved greatly in convergence rate and ability of global optimization.