一种基于路径相似度的蚁群算法  

Ant colony algorithm based on similarity of paths

作　　者：张鹏[1] 林杰[1] 邓可[1] 

机构地区：[1]同济大学信息管理与信息系统系

出　　处：《计算机工程与应用》2007年第32期28-30,33,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.70531020);新世纪人才支持计划资助(No.NCET-06-0377)。~~

摘　　要：提出了路径相似度的概念,并根据较优可行解与最优解的相似度,来进行路径选择和信息素更新,以求能更快加速收敛和防止早熟、停滞现象。该算法根据截之间的相似度,自适应地调整路径选择策略和信息量更新策略。基于旅行商问题的实验验证了算法比一般蚁群算法具有更好的全局搜索能力、收敛速度和解的多样性。To settle the contradictory between convergence speed and precocity and stagnation in ant colony algorithm,an ant colony algorithm,which is based on adaptive selection of the paths and dynamic updating of pheromone,is presented.By dynamically adjusting the strategy of selection of the paths and the strategy of the trail information updating according to the distribu-. tion of the solutions,the algorithm can keep good balance between accelerating convergence and averting precocity and stagnation. Experimental results on traveling salesman problem show that the method presented in this paper has a better global searching ability,higher convergence speed and solution diversity than that of classical ant colony algorithm.

关 键 词：蚁群算法 路径相似度 旅行商问题 

分 类 号：O141.3[理学—数学]