Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (13): 98-100.DOI: 10.3778/j.issn.1002-8331.2010.13.029
• 网络、通信、安全 • Previous Articles Next Articles
GU Ming-jia,XUAN Shi-bin,LIAN Kan-chao,LI Yong-sheng
Received:
Revised:
Online:
Published:
Contact:
古明家,宣士斌,廉侃超,李永胜
通讯作者:
Abstract: The multiple QoS constrained multicast 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 QoS constrained multicast routing problems.On the basis of analysis of basic ant colony algorithm,an adaptive mutated twice ant colony system algorithm is proposed to solve multiple QoS constrained multicast routing problem.The algorithm adopts adaptive mutated manner,the node counts unit,and twice ant colony algorithm search mechanism.It reduces the possibility to fall in local best,and thus the algorithm improves search ability and convergence speed of traditional ant colony algorithm.The feasibility and effectiveness of the algorithm are validated by series of simulated results.
Key words: multiple constrained, multicast routing, adaptive mutated, ant algorithm
摘要: 多约束QoS组播路由问题是一个NP-完全问题,针对基本蚁群算法在解决多约束QoS组播路由问题时易陷入局部最优解、收敛速度慢的突出缺点。提出了一种基于自适应变异的二次蚁群算法对该问题进行求解,该算法采取自适应变异方法,借助节点使用计数器,引入二次蚁群搜索机制,减少了算法陷入局部极值的可能性,提高了算法的寻优能力和收敛速度。仿真实验结果验证了该算法的可行性和有效性。
关键词: 多约束, 组播路由, 自适应变异, 蚁群算法
CLC Number:
TP301.6
GU Ming-jia,XUAN Shi-bin,LIAN Kan-chao,LI Yong-sheng. Adaptive mutated twice ant colony system algorithm for QoS multicast routing[J]. Computer Engineering and Applications, 2010, 46(13): 98-100.
古明家,宣士斌,廉侃超,李永胜. 求解QoS组播路由的自适应变异二次蚁群算法[J]. 计算机工程与应用, 2010, 46(13): 98-100.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.13.029
http://cea.ceaj.org/EN/Y2010/V46/I13/98