| 基于自适应变异蚁群算法的QoS路由算法 |
| |
| 引用本文： | 古明家,宣士斌,廉侃超,李永胜.基于自适应变异蚁群算法的QoS路由算法[J].计算机工程,2009,35(23):209-211. |
| |
| 作者姓名： | 古明家 宣士斌 廉侃超 李永胜 |
| |
| 作者单位： | 广西民族大学数学与计算机科学学院,南宁,530006 |
| |
| 基金项目： | 国家民委科研基金资助项目 |
| |
| 摘 要： | 多约束QoS单播路由问题是NP完全问题，针对基本蚁群算法在解决该问题时易于陷入局部最优、收敛速度慢的缺点，提出自适应变异蚁群算法对该问题进行求解。该算法采取自适应变异方法，引入二次蚁群搜索机制，减少了算法陷入局部极值的可能性，提高了算法的寻优能力和收敛速度。仿真实验结果验证了该算法的可行性和有效性。
|
| 关 键 词： | 多约束QoS 单播路由 自适应变异 蚁群算法 |
| 修稿时间： | |
QoS Routing Algorithm Based on Adaptive Mutated Ant Colony Algorithm |
| |
| GU Ming-jia,XUAN Shi-bin,LIAN Kan-chao,LI Yong-sheng.QoS Routing Algorithm Based on Adaptive Mutated Ant Colony Algorithm[J].Computer Engineering,2009,35(23):209-211. |
| |
| 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) |
| |
| Abstract: | 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. |
| |
| Keywords: | multiple constrained QoS unicast routing adaptive mutated ant colony algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
