论文部分内容阅读
蚁群算法解决TSP问题时的收敛速度慢、易陷入局部最优。提出了一种基于2-Opt的MMAS型蚁群算法,MMAS可以有效地提高收敛速度,在陷入局部最优后,利用2-Opt搜索算法对局部最优路径进行调整,提高了发现更优路径的可能性,且2-Opt算法简单、易于实现。实验证明,改进后的蚁群算法在收敛速度的提升和更优路径的发现能力上都得到了较大提高。
Ant colony algorithm to solve the TSP problem converges slowly, easy to fall into the local optimum. A MMAS ant colony algorithm based on 2-Opt is proposed. MMAS can effectively improve the convergence speed. After falling into the local optimum, the 2-Opt search algorithm is used to adjust the local optimal path and improve the discovery of a better path The possibility of 2-Opt algorithm is simple and easy to implement. Experiments show that the improved ant colony algorithm has been greatly improved in the rate of convergence and the ability to find the better path.