首页 | 官方网站   微博 | 高级检索  
     

基于遗传蚁群算法的Qos路由约束问题的研究
引用本文:王浩,曹仲伟.基于遗传蚁群算法的Qos路由约束问题的研究[J].湖北工业大学学报,2011,26(2):71-73.
作者姓名:王浩  曹仲伟
作者单位:湖北工业大学计算机学院,湖北,武汉,430068
摘    要:针对Qos路由约束问题(是一个NP-完全问题,即是一个多项式复杂程度的非确定问题),设计了一种将遗传算法和蚁群算法优点融合的算法(GA_ACO).该算法的基本思想是:用遗传算法生成蚁群算法需要的信息素初值,然后利用蚁群算法求得精解.通过NS2仿真表明遗传蚁群算法相比单一的遗传算法和蚁群算法更适合解决Qos路由约束问题.

关 键 词:NP-完全问题  遗传算法  蚁群算法  Qos

Qos Routing Constraint Based on the Combination of Genetic and Ant Colony Algorithmand
WABG Hao,CHAO Zhong-wei.Qos Routing Constraint Based on the Combination of Genetic and Ant Colony Algorithmand[J].Journal of Hubei University of Technology,2011,26(2):71-73.
Authors:WABG Hao  CHAO Zhong-wei
Affiliation:WABG Hao,CHAO Zhong-wei(School of Computer Science,HuBei Univ.of Tech.,Wuhan 430068,China)
Abstract:For Qos routing constraint problem is a problem with NP completely and it is also a polynomial complexity problem.An algorithm is design via combining the advantages of genetic algorithm and ant colony algorithm.The basic thought of this algorithm is to produce initial information with genetic algorithm which colony algorithm need,and the ant colony algorithm is used to get a pure solution.The simulation of NS2 shows that genetic and ant colony algorithm,when compared with single genetic algorithm or ant colony algorithm,is better in solving Qos routing constraint problems.
Keywords:Qos
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号