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

基于混合行为的自适应蚁群算法
引用本文:王运涛,姚砺,毛力.基于混合行为的自适应蚁群算法[J].计算机仿真,2009,26(12):151-153.
作者姓名:王运涛  姚砺  毛力
作者单位:1. 东华大学计算机科学与技术学院,上海,201620;江南大学信息工程学院,江苏,无锡,214122
2. 东华大学计算机科学与技术学院,上海,201620
3. 江南大学信息工程学院,江苏,无锡,214122
摘    要:针对传统蚁群算法求解能力的不足,提出了一种基于混合行为的自适应蚁群算法(HBACA).通过引入具有多行为的混合蚂蚁来扩大解搜索空间,避免早熟和停滞现象;另外在每次迭代过程中具有不同行为的蚂蚁数目可以视具体情况而动态地进行调整,以便在加速收敛和防止早熟、停滞现象之间取得一个较好的平衡.实验表明,相比ACS、MMAS算法,改进算法求解TSP问题的性能得到了加强.

关 键 词:蚁群算法  旅行商问题  混合行为  自适应

A Self- Adaptive Ant Colony Algorithm Based on Hybrid Behavior
WANG Yun-tao,YAO Li,MAO Li.A Self- Adaptive Ant Colony Algorithm Based on Hybrid Behavior[J].Computer Simulation,2009,26(12):151-153.
Authors:WANG Yun-tao  YAO Li  MAO Li
Abstract:In order to overcome the drawbacks of the conventional ant colony algorithm such as insufficient solu-tion ability, a hybrid behavior based ant colony algorithm (HBACA) is proposed. The ant colony based on hybrid behavior was introduced to extend the area of feasible solutions and overcome the defect of precocity and stagnation. In addition, the number of different ants can be adaptively adjusted to keep good balance between accelerating con-vergence speed and avoiding precocity and stagnation. Experimental results of traveling salesman problem show that the proposed algorithm has a better global searching ability, higher efficiency than Ant Colony System (ACS) and MAX-MIN Ant System (MMAS).
Keywords:Ant colony algorithms  Traveling salesman problem  Hybrid behavior  Self-adaptive
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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