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

一种改进的自适应蚁群算法及其应用研究
引用本文:蒲兴成,孙凯.一种改进的自适应蚁群算法及其应用研究[J].重庆邮电学院学报(自然科学版),2011(3).
作者姓名:蒲兴成  孙凯
作者单位:重庆邮电大学数理学院;重庆邮电大学计算机科学与技术学院;
基金项目:科技部国家合作项目(2010DFA12160); 重庆市科委项目(2009JJ1276); 重庆邮电大学青年基金(A2009-50)~~
摘    要:蚁群算法作为一种新型的模拟进化算法,具有分布计算和信息正反馈等优点,但蚁群算法与其他进化算法一样存在收敛速度慢,易陷于局部最优等缺陷。针对这一问题,提出一种改进的蚁群算法,结合遗传算法和图论中的最邻近算法,并自适应地初始化信息素和限定信息素的大小范围。将该算法应用于旅行商问题(traveling salesman problem,TSP)求解,与基本蚁群算法比较,数值实验结果表明,这种改进算法能有效抑制算法陷入局部最优的缺陷,从而提高了解的全局搜索能力和解的质量。

关 键 词:蚁群算法  旅行商问题(TSP)  自适应  遗传算法  

An improved adaptive ant colony optimization algorithm with application
PU Xing-cheng,SUN Kai.An improved adaptive ant colony optimization algorithm with application[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),2011(3).
Authors:PU Xing-cheng  SUN Kai
Institution:PU Xing-cheng1,SUN Kai2 (1.College of Mathematics and Physics,Chongqing University of Posts and Telecom-munications,Chongqing 400065,P.R.China,2.College of Computer Science and Technology,Chongqing University of Posts and Telecommunications,P.R.China)
Abstract:Ant Colony Optimization algorithm is a novel evolutionary simulating algorithm,which has the merit of distributed computation and positive feedback of information.But Ant Colony Optimization algorithm also has some shortcomings such as needing longer computing time and tending to go into local optimum as other evolutionary algorithms.To solve this problem,An improved Ant Colony Optimization is proposed.The algorithm combines genetic algorithms and the nearest neighbor algorithm of graph theory to adaptively...
Keywords:ant colony optimization  traveling salesman problem(TSP)  adaptive  genetic algorithm  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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