摘要
基于基本蚁群算法在解决多约束QoS选播路由问题时易陷入局部最优解、收敛速度慢,提出了一种基于自适应变异的二次蚁群算法对该问题进行求解。该算法采取自适应变异方法,借助节点使用计数器,引入二次蚁群搜索机制,减少了算法陷入局部极值的可能性,提高了算法的寻优能力和收敛速度。仿真实验结果表明了该算法的可行性和有效性。
Ant colony algorithm is easy to fall in local best, and its convergent speed is slow in solving multiple QoS constrained Anycast routing problems. An adaptive mutated twice ant colony system algorithm is proposed to solve multiple QoS constrained Anycast routing problem. The algorithm adopted adaptive mutated manner, and the node counts unit, and twice ant colony algorithm search mechanism. The possibility to fall in local best is reduced, thus the algorithm improved search ability and convergence speed of traditional ant colony algorithm. The feasibility and effectiveness of the algorithm are validated by series of simulated results.
出处
《计算机工程与设计》
CSCD
北大核心
2009年第21期4949-4952,共4页
Computer Engineering and Design
基金
国家民委科研基金项目(07GX04)
关键词
多约束
服务质量
选播路由
自适应变异
蚁群算法
multiple constrained
quality of service
Anycast routing
adaptive mutated
ant algorithm
