摘要
根据旅行商问题中城市分布的特点,提出了分区域聚类的蚁群算法.首先,对城市分布进行球形聚类,再分别对剩下的城市进行线形聚类和孤立点聚类.采用这样的分区域聚类的蚁群算法收敛速度快,寻求的解更优.实验表明,该算法比基本蚁群算法在求得解更优的同时,速度快3～13倍.
Based on the characteristics of urban distribution in the TSP problem, an ant colony algorithm is put forth for local clustering. First, urban distribution is treated by means of spherical clustering. Subsequently, the remaining cities are subjected to the treatment of linear clustering and isolated points clustering respectively. The ant colony algorithm for local clustering is characterized by a faster velocity of convergence and a better sought solution as well. Experimental results show that, by use of such an algorithm, the solution thus worked out is not only better but also the speed can be 3-13 times faster than by means of the basic ant colony algorithm.
出处
《内江师范学院学报》
2013年第2期25-27,共3页
Journal of Neijiang Normal University
