节点文献

求解动态组播路由问题的混合优化遗传算法

Hybridized optimization genetic algorithm for multicast routing problem

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 陈云亮杨捷康立山

【Author】 CHEN Yun-liang~1,YANG Jie~2,KANG Li-shan~1 (1.School of Computer,China University of Geosciences,Wuhan Hubei 430074,China;2.Institute for Pattern Recognition and Artificial Intelligence,Huazhong University of Science and Technology,Wuhan Hubei 430074,China)

【机构】 中国地质大学计算机学院华中科技大学图像识别与人工智能研究所中国地质大学计算机学院 湖北武汉430074湖北武汉430074

【摘要】 分析了具有网络时延和时延抖动限制的动态组播路由问题的数学模型。在此模型的基础上提出了一种基因库(GP)与传统遗传算法(GA)混合的优化算法GP-GA。该算法利用基因库保存进化过程中得到的解路径以指导后继进化过程,同时改进了交叉和变异算子来加快算法的收敛速度。考虑到问题可能陷入的局部最优情况,又构造了基于“保留和不保留”的进化控制策略来增强寻优能力,很大程度上避免了算法“早熟”现象的发生。大量的仿真实验表明:GP-GA算法相对现有的遗传算法求得最优解的概率更高,相对于动态的组播环境也有很好的代价性能。

【Abstract】 The mathematic model of dynamic multicast routing with Nodes delay and delay variation constraints was analyzed.Based on the model,an optimization algorithm called GP-GA was proposed by hybridizing Gene-Pool(GP) with traditional Genetic Algorithm(GA).This method made use of the gene-pool to save the solutions during the process so as to direct the remaining evolution.In the mean time,the crossover and mutation operator were improved to accelerate the convergence speed.Considering that the problem may be trapped by local optimization easily,the evolution strategy based-on("reserved) and non-reserved" was also constructed to enhance the ability of finding optimal solution and decrease the probability of "premature" phenomena commendably.A great number of simulations demonstrate that the probability of GP-GA converging optimal solutions is higher than general GA,and the algorithm is also effective for being adjusted to the dynamic multicast routing.

【基金】 中国地质大学(武汉)优秀青年教师资助计划资助项目(CUGQNL44)
  • 【文献出处】 计算机应用 ,Journal of Computer Applications , 编辑部邮箱 ,2006年08期
  • 【分类号】TP18;TN919.8
  • 【被引频次】5
  • 【下载频次】86
节点文献中: 

本文链接的文献网络图示:

本文的引文网络