针对蚁群算法在求解大规模旅行商问题(TSP)时精度和时间方面的不足,提出了一种新的算法,该算法采用多阶段的蚁群寻优策略.算法的复杂度分析及在大规模TSP问题上的实验表明:该算法在保证获得较好解的前提下收敛速度得到了较大的改进.
To improve the computation performance of Ant Colony System for solving large scale Traveling Salesman Problems (TSP), a new algorithm is presented in this paper. It adopts a set of multistage strategies to look for an optimal solution. The analysis for computation complexity and experimental results for TSP problems demonstrate that the proposed algorithm can greatly improve the speed of convergence while keeping more optimal solutions.