Improved Ant Colony Algorithm for Solving TSP
改进蚁群算法求解TSP

Aiming at solving the problem of falling into local optimization easily and slow convergence,this paper proposes a method that adopts a bi-level searching decision based on adjacent matrix in choosing diverting path to improve ant colony algorithm and solve TSP problem.The experiment results show that the new algorithm has better performance.