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

LI Tao-shen; LI Zhang-cai

Chinese

您当前的位置：

首页 >

文章列表页 >

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

更新时间：2026-09-04

- An QoS Anycast Routing Algorithm Based on the Combination of Genetic and Ant Colony Algorithm
- Vol. 29, Issue 9, Pages: 137-140(2012)
- 作者机构：
  
  1. 广西大学计算机与电子信息学院,广西,南宁,530004
  2. 南宁市统计局,广西,南宁,530002
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2012
- 稿件说明：
移动端阅览
李陶深, 李长才. 基于遗传与蚁群算法融合的选播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]. 2012, 29(9): 137-140.
李陶深, 李长才. 基于遗传与蚁群算法融合的选播QoS路由算法[J]. 微电子学与计算机, 2012, 29(9): 137-140,144. DOI：

LI Tao-shen, LI Zhang-cai. An QoS Anycast Routing Algorithm Based on the Combination of Genetic and Ant Colony Algorithm[J]. 2012, 29(9): 137-140. DOI：

摘要

为有效解决选播通信中的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.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The Application of Steiner Tree-based Genetic and Ant Colony Algorithm Path Selection

A feature-oriented context understanding and slice analysis network for tuberculosis detection

High gain stability high temperature operational amplifier based on reverse body bias

Design of ultra-low power real-time clock circuits

Implementation and verification of a dual-chain power gating strategy for low power design

Related Author

HOU Yan

Related Institution

Jilin Police College

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰