一种改进的混合型蚁群算法在TSP问题中的应用

介绍了一种求解TSP问题的算法改进的混合型蚁群算法,该算法在近邻法构造初始解的基础上,使用2-opt局部搜索法对当前解进行改进,在更新全局信息素时采用基于排序的蚂蚁系统对排在前2名的蚂蚁更新全局信息素,且为全局信息素设置最大值和最小值,并使用Matlab仿真求解了kroa200等13个经典tsp问题,得到的结果和最优解的误差很小,并和两种最新改进的蚁群算法以及两种自组织算法进行比较,比较结果充分证明了该改进算法的有效性.

An Improved Mixed Ant Colony Algorithm to Solve THe Tsp Problems

In this paper,a mixed ant colony algorithm is introduced.The algorithm is based on the traditional ant colony system algorithm,construct an initial result using the nearest neighbor method and then improve the results using 2-opt partial search strategy,and update the global pheromone for the best two colonies with a maximum and minimum constraint. The simulation using MATLAB for the classic kroa200 and other twelve TSP problems showed us very good results which have small deviations compared to the best-known results. In this paper,I also compared the results to two updated ant colony algorithms and two self organization algorithms,the better results indicated us our mixed ant colony algorithm is a better one.