Research on Analysis of Convergence of an Adaptive Ant Colony Optimization Algorithm

摘要：

In order to improve the global ability of basicACA(Ant Colony Algorithm),a novel ACA algorithmwhich is based on adaptively adjusting pheromonedecay parameter has been proposed,and it has beenproved that for a sufficiently large number of iterations,the probability of finding the global best solution tendsto l.The simulations for TSP problem show that theimproved ACA can find better routes than basic ACA.

作者: Weijin Jiang

作者单位: School of Computer and Electronic Engineering,Hunan University of Commerce,Changsha,P.R.China;Department of Computer,Hunan University of Chinese Medicine,Changsha,P.R.China

会议类型: 国际会议

会议名称: 2008 3rd International Conference on Intelligent System and Knowledge Engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)

会议地点: 厦门

会议语种:英文

页码: 491-496

在线出版日期: 2008-11-17（万方平台首次上网日期，不代表论文的发表时间）