一种求解TSP问题的改进蚁群算法

An Improved Ant Colony Algorithm on TSP Problem

基本的蚁群算法收敛速度慢,容易陷入局部最优解,针对该问题,提出了从蚁群移动规则、信息素的更新以及信息素的自适应调节等方面改进的策略,使算法能快速收敛,并不容易陷入局部最优解。仿真实验证明,提出的改进算法比带精英的最大最小蚂蚁算法收敛速度快,解得质量更高。

In view of the disadvantage of Slow convergence speed and easy to fall into local optimal solution for the traditional ACO,put forward from the ant movement rules,pheromone updating and pheromone adaptive adjustment of improvement,make the algorithm can fast convergence,and is not easy to fall into local optimal solution.The simulation experiments show that the proposed improved algorithm can converge faster,and the quality of the solutions is higher than the MMAS with elite strategy .