首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于路径相似度的蚁群算法
引用本文:张鹏,林杰,邓可. 一种基于路径相似度的蚁群算法[J]. 计算机工程与应用, 2007, 43(32): 28-30
作者姓名:张鹏  林杰  邓可
作者单位:同济大学,信息管理与信息系统系,上海,200092;西安理工大学,信息系,西安,710048;同济大学,信息管理与信息系统系,上海,200092
基金项目:国家自然科学基金 , 新世纪优秀人才支持计划
摘    要:提出了路径相似度的概念,并根据较优可行解与最优解的相似度,来进行路径选择和信息素更新,以求能更快加速收敛和防止早熟、停滞现象。该算法根据截之间的相似度,自适应地调整路径选择策略和信息量更新策略。基于旅行商问题的实验验证了算法比一般蚁群算法具有更好的全局搜索能力、收敛速度和解的多样性。

关 键 词:蚁群算法  路径相似度  旅行商问题
文章编号:1002-8331(2007)32-0028-03
修稿时间:2007-08-01

Ant colony algorithm based on similarity of paths
ZHANG Peng,LIN Jie,DENG Ke. Ant colony algorithm based on similarity of paths[J]. Computer Engineering and Applications, 2007, 43(32): 28-30
Authors:ZHANG Peng  LIN Jie  DENG Ke
Affiliation:1.Department of Information Management and Information System,TongJi University,Shanghai 200092,China 2.Department of Information Engineering,Xi’an University of Technology,Xi’an 710048,China
Abstract: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.
Keywords:ant colony algorithm  similarity of path  TSP(Traveling Salesman Problem)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号