改进蚁群算法FENA2O解决TSP问题研究

为了解决传统蚁群算法解决TSP问题时收敛速度慢、易陷入局部最优的问题,提出了一种名为FENA2O的改进蚁群算法。通过寻找并更新精英蚂蚁行走路径来提高收敛速度,通过规定蚂蚁数量来降低陷入局部最优的可能,配合2-Opt算法进一步优化所得路径。实验结果表明,算法改进后的收敛速度得到了较大提高,并能够有效解决局部最优。

Research on TSP using Improved Ant Colony Algorithm FENA20

To solve problem that the traditional ant colony algorithm converged slowly and its standstill search came up easily when solving the TSP. A novel algorithm for improved ant colony algorithm called Find Elites in N Ants with 2-Optimization （FENA20） was proposed. Increasing convergence speed by finding and updating information in the paths of elite ants. Reducing the possibility of obtaining local optimization by setting the number of ants. And then a further optimization was made to the obtained route by using 2-Opt algorithm. The experimental results showed that the convergence speed of the improved algorithm had been rapidly developed and local optimization could be solved effectively.