摘要
针对基本蚁群算法在收敛速度和求解精度方面的不足,提出一种回归蚁群算法.通过外加牵引力使得蚂蚁按照城市的整体分布规律寻优,增加了算法的全局收敛性.并通过圈地算法,减少了局部搜索的计算量.多个旅行商问题的仿真结果验证了该方法的可行性和高效性.
To overcome the drawbacks of the conventional ant colony algorithm such as slow convergence and low precision, a returned ant algorithm is proposed. To improve global convergence, an outside force makes ants move according to the whole city＇s distribution. Moreover, by comparing the distances between the current position and the others, computational complexity of regional optimization is reduced. The simulation results of several traveling salesman problems show that the proposed algorithm is feasible and highly efficient.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2005年第6期944-947,共4页
Journal of Xidian University
基金
973项目资助(A11503020146)
重点实验室基金资助项目(J14404020104)
关键词
蚁群算法
全局收敛性
旅行商问题
ant colony system（ACS）
global convergence
traveling salesman problem（TSP）
