摘要
多约束QoS单播路由问题是NP完全问题,针对基本蚁群算法在解决该问题时易于陷入局部最优、收敛速度慢的缺点,提出自适应变异蚁群算法对该问题进行求解。该算法采取自适应变异方法,引入二次蚁群搜索机制,减少了算法陷入局部极值的可能性,提高了算法的寻优能力和收敛速度。仿真实验结果验证了该算法的可行性和有效性。
The multiple constrained QoS unicast routing problem is a NP-complete problem. Ant colony algorithm is easy to fall in local best, and its convergent speed is slow in solving multiple constrained QoS unicast routing problems. An adaptive mutated ant colony algorithm is proposed in this paper to solve multiple constrained QoS unicast routing problem. The algorithm adopts adaptive mutated manner, and introduces twice ant colony algorithm search mechanism, reduces the possibility to fall in local best. It improves the search ability and convergence speed. The feasibility and effectiveness of the algorithm are validated by series of simulated results.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第23期209-211,共3页
Computer Engineering
基金
国家民委科研基金资助项目(07GX04)
关键词
多约束QOS
单播路由
自适应变异
蚁群算法
multiple constrained QoS
unicast routing
adaptive mutated
ant colony algorithm
