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

基于模式求解旅行商问题的蚁群算法
引用本文:李炳宇,萧蕴诗.基于模式求解旅行商问题的蚁群算法[J].同济大学学报(自然科学版),2003,31(11):1348-1352.
作者姓名:李炳宇  萧蕴诗
作者单位:同济大学,信息与控制工程系,上海,200092
摘    要:群体智能已经被广泛应用于分布式控制、调度、优化等领域.其中蚁群算法已经成为该领域的一个研究热点.在蚁群算法的基础上针对旅行商问题(TSP),首先提出了小窗口蚁群算法,提高初始解的质量,然后与基于模式的蚁群算法相结合,通过提取模式,改变计算粒度,缩短计算时间,提高计算精度.实验结果表明该算法有较好的效果.

关 键 词:蚁群算法  小窗口  模式  旅行商问题
文章编号:0253-374X(2003)11-1348-05
修稿时间:2003年3月14日

Ant Colony Algorithm Based on Model Algorithm for Traveling Salesman Problem
LI Bing-yu,XIAO Yun-shi.Ant Colony Algorithm Based on Model Algorithm for Traveling Salesman Problem[J].Journal of Tongji University(Natural Science),2003,31(11):1348-1352.
Authors:LI Bing-yu  XIAO Yun-shi
Abstract:Swarm intelligence has been applied in domains of distributed control, job-shop schedule, and optimization. Ant colony algorithm(ACO),one of swarm intelligence, has become a hot research field. This paper proposes an ant colony algorithm based on little window and obtains models from typical ant algorithm. The algorithm reduces computing time and improves computing accuracy by limiting the size of solution space, extracting models and changing computing granularity. Simulations demonstrate that the improved algorithm can achieve better performance than typical algorithm and some other improved algorithms.
Keywords:ant colony algorithm  little window  model  traveling salesman problem (TSP)
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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