首页 | 本学科首页   官方微博 | 高级检索  
     检索      

用一种改进遗传算法求解带时延约束的组播路由问题
引用本文:蔡启博,方建晓.用一种改进遗传算法求解带时延约束的组播路由问题[J].温州大学学报(自然科学版),2007,28(5):41-46.
作者姓名:蔡启博  方建晓
作者单位:温州大学物理与电子信息学院,浙江温州,325035
摘    要:提出一种改进的遗传算法,用以求解带时延约束的组播路由问题.该算法综合考虑了路由费用和路由时延,并给出了一种适应度评价函数,在算法中采用了最佳个体保留、自适应交叉以及非线性排序选择等多种优化机制.仿真结果表明,该算法是可行的,有效的.

关 键 词:组播路由  遗传算法  时延约束
文章编号:1006-0375(2007)05-0041-06
修稿时间:2006年12月26

Solving Multicast Routing Problem with Delay Constraint Based on a Modified Genetic Algorithm
CAI Qibo,FANG Jianxiao.Solving Multicast Routing Problem with Delay Constraint Based on a Modified Genetic Algorithm[J].Journal of Wenzhou University Natural Science,2007,28(5):41-46.
Authors:CAI Qibo  FANG Jianxiao
Abstract:In this paper,an improved genetic algorithm is proposed for multicast routing problem,in which both cost and end-to-end delay are generally considered and several optimization methods such as elitist reserved model,self-adaptation crossing and non-linear rank-based model are also adopted.Simulation results shows that this algorithm is feasible and efficient.
Keywords:Multicast routing  Genetic algorithm  End-to-end delay constraint
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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