蚁群算法是一种分布式内在并行算法。单个蚂蚁的搜索过程是彼此独 立的，易于局部最优，通过个体间不断的信息交流和传递有利于发现较好解；并且该算法是一种正反馈算法。路径上的信息素浓度较高，将吸引更多的蚂蚁沿这条路径运动，又使得信息素浓度增加，加快了算法的进化过程。本文通过求解TSP问题，通过在特定情况下对路径进行逐步遍历比较来降低陷入局部最优解的可能性, 找出最优解。-Ant colony algorithm is an inherent distributed parallel algorithm. Single ant search process is independent of each other, easy local optimum, through continuous exchange of information between individuals and found in favor of passing a good solution　and the algorithm is a positive feedback algorithm. The higher the concentration of the pheromone on the path, it will attract more ants motion along this path, but also makes the pheromone concentration, speed up the evolutionary process of the algorithm. By solving the TSP, under certain circumstances by stepwise traversal path into comparison to reduce the possibility of local optimal solution, to find the optimal solution.