| 求解QoS组播路由的自适应变异二次蚁群算法 |
| |
| 引用本文： | 古明家,宣士斌,廉侃超,李永胜.求解QoS组播路由的自适应变异二次蚁群算法[J].计算机工程与应用,2010,46(13):98-100. |
| |
| 作者姓名： | 古明家 宣士斌 廉侃超 李永胜 |
| |
| 作者单位： | 广西民族大学 数学与计算机科学学院，南宁 530006 |
| |
| 基金项目： | 国家民委科研项目(No.07GX04) |
| |
| 摘 要： | 多约束QoS组播路由问题是一个NP-完全问题，针对基本蚁群算法在解决多约束QoS组播路由问题时易陷入局部最优解、收敛速度慢的突出缺点。提出了一种基于自适应变异的二次蚁群算法对该问题进行求解，该算法采取自适应变异方法，借助节点使用计数器，引入二次蚁群搜索机制，减少了算法陷入局部极值的可能性，提高了算法的寻优能力和收敛速度。仿真实验结果验证了该算法的可行性和有效性。
|
| 关 键 词： | 多约束 组播路由 自适应变异 蚁群算法 |
| 收稿时间： | 2008-10-28 |
| 修稿时间： | 2009-2-10
|
Adaptive mutated twice ant colony system algorithm for QoS multi-cast routing |
| |
| GU Ming-jia,XUAN Shi-bin,LIAN Kan-chao,LI Yong-sheng.Adaptive mutated twice ant colony system algorithm for QoS multi-cast routing[J].Computer Engineering and Applications,2010,46(13):98-100. |
| |
| Authors: | GU Ming-jia XUAN Shi-bin LIAN Kan-chao LI Yong-sheng |
| |
| Affiliation: | College of Mathematics and Computer Science，Guangxi University for Nationalities，Nanning 530006，China |
| |
| 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 ... |
| |
| Keywords: | multiple constrained multicast routing adaptive mutated ant algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
