李陶深, 李长才. 基于遗传与蚁群算法融合的选播QoS路由算法[J]. 微电子学与计算机, 2012, 29(9): 137-140,144.
引用本文: 李陶深, 李长才. 基于遗传与蚁群算法融合的选播QoS路由算法[J]. 微电子学与计算机, 2012, 29(9): 137-140,144.
LI Tao-shen, LI Zhang-cai. An QoS Anycast Routing Algorithm Based on the Combination of Genetic and Ant Colony Algorithm[J]. Microelectronics & Computer, 2012, 29(9): 137-140,144.
Citation: LI Tao-shen, LI Zhang-cai. An QoS Anycast Routing Algorithm Based on the Combination of Genetic and Ant Colony Algorithm[J]. Microelectronics & Computer, 2012, 29(9): 137-140,144.

基于遗传与蚁群算法融合的选播QoS路由算法

An QoS Anycast Routing Algorithm Based on the Combination of Genetic and Ant Colony Algorithm

  • 摘要: 为有效解决选播通信中的QoS路由问题,提出一种基于遗传算法与蚁群算法融合的选播QoS路由算法.算法初期使用遗传算法在链路上分布信息素,对蚁群算法的控制参数进行编码和优化;然后通过判断函数来判断遗传算法与蚁群算法融合的时机,初始化信息素,并启动混合算法后期的蚁群算法;引入变异算子,对由变异操作得出新路径进行局部信息素更新,更快地引导蚁群算法找到全局最优解.NS2仿真实验结果表明,该算法很好的解决多QoS选播路由问题,性能优于其它算法.

     

    Abstract: To solve anycast routing problem with multiple QoS constraints, an improved hybrid algorithm which combines genetic algorithm and ant colony algorithm is proposed.In the initial period of hybrid algorithm, genetic algorithm was used to distribute pheromones in links and code and optimize control parameters of ant colony algorithm.Through judgment function, this algorithm can judge the time to combine the genetic algorithm with ant colony algorithm, and initialize the pheromones and start the ant colony algorithm at the last period of hybrid algorithm.To avoid falling into local optimal solution at the last period of hybrid algorithm, a mutation operator was introduced in algorithm hybrid to update local pheromones of new path produced by mutation operation and reduced pheromones concentration on optimal path in time.The NS2 simulation results show that this algorithm can commendably solve the anycast routing problem with multiple QoS constraints, and its performance is better than other algorithms.

     

/

返回文章
返回