摘要
针对Qos路由约束问题(是一个NP-完全问题,即是一个多项式复杂程度的非确定问题),设计了一种将遗传算法和蚁群算法优点融合的算法(GA_ACO).该算法的基本思想是:用遗传算法生成蚁群算法需要的信息素初值,然后利用蚁群算法求得精解.通过NS2仿真表明遗传蚁群算法相比单一的遗传算法和蚁群算法更适合解决Qos路由约束问题.
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.
出处
《湖北工业大学学报》
2011年第2期71-73,共3页
Journal of Hubei University of Technology
