期刊文献+

基于混沌遗传算法的组播路由优化研究 被引量:14

Research on Multicast Routing Optimization Based on Chaos Genetic Algorithm
在线阅读 下载PDF
导出
摘要 在采用混沌遗传算法优化多目标QoS组播路由时,为克服Logistic映射收敛速度不快,而使传统混沌遗传算法优化效果不好的缺陷,将Tent混沌遗传算法引入QoS组播路由问题的求解中。该算法利用Tent混沌映射优越的区间均匀搜索能力,对通过遗传优选出的个体再次进行混沌优化,优化出适应度最高的个体进行交叉变异,从而保证足够多的下一代,以致算法不会陷入早熟。仿真结果表明,该算法优于Logistic混沌遗传算法,有效地改进了搜索效率,且收敛速度更快、更稳定。 The introduction of chaos Ganetic Algorithm(GA) to optimize multi-objective QoS multicast routing, is to overcome the convergence of logistic map isn't fast enough, will affect the efficiency of the tradition chaos genetic algorithm. A new kind of chaos GA based on Tent map chaos GA is introduced to the solving of QoS multicast routing in this paper. The excellent interval uniform search capability of tent map is used, chaos optimization again to individuals which are selected out of the genetic optimization, optimizing the highest fitness individuals to crossover and mutation, to ensure a sufficient number of the next generation, and algorithm will not fall into premature. Simulation results show the algorithm is better than Logistic chaos GA, which is effective to improve the search efficiency, speed up the convergence and make it more stable.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第3期155-157,共3页 Computer Engineering
基金 国家"863"计划基金资助项目(2006AA10Z262) 华南农业大学校长基金资助项目(K07170 2008X004)
关键词 Tent混沌映射 遗传算法 QOS组播路由 优化 Tent chaos map Genetic Algorithm(GA) QoS multicast routing optimization
  • 相关文献

参考文献6

二级参考文献33

  • 1Munemoto M, Takai Y, Sato Y. A Migration Scheme for the Genetic Adaptive Routing Algorithm[C]//Proc. of IEEE International Conference on Systems, Man, and Cybernetics. Diego, USA: [s. n.], 1998: 2774-2779.
  • 2Inagaki J, Haseyama M, Kitajima H. A Genetic Algorithm for Determining Multiple Routes and Its Applications[C]//Proc. of IEEE International Symposium on Circuits and Systems. Orlando, Florida, USA: [s. n.], 1999: 137-140.
  • 3Feng Xiang, Li Junzhou, Wu Jieyi, et al. QoS Routing Based on Genetic Algorithm[J]. Computer Communications, 1999, 22(15): 1392- 1399.
  • 4Ravikumar C P, Bajpai R. Source-based Delay-bounded Multicasting in Multimedia Networks[J]. Computer Communications, 1998, 21(2): 126-132.
  • 5Sun Q. A Genetic Algorithm for Delay Constrained Minimum Cost Multicasting[R]. Institut fiir Betriebssysteme und Rechnerverbund, Tech. Rep.: 38106, 1999.
  • 6Salama H F, Reeves D S, Viniotis Y. Evaluation of Multicast Routing Algorithms for Real-time Communication on High-speed Networks[J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 332-345.
  • 7Chen L, Aihara K. Global search ability of chaotic neural networks [J]. IEEE Trans on Circuits Systems, 1999, 46 (8) : 974-993.
  • 8Feng J, Ying W Y. Pattern search algorithm an its application research in three-dimensional component layout [J]. J of Wuhan University of Technology,2003,27(2) :280-284.
  • 9Salama H F, Reeves D S, Viniotis Y. Evaluation of Multicast Routing Algorithms for Real-time Communication on High-speed Networks[J]. IEEE JSAC, 1997,15(3):332-345.
  • 10Chen L K, Aihara K. Chaotic Simulated Annealing by a Neural Network Model with Transient Chaos[J]. Neural Networks, 1995,8(6): 915-930.

共引文献236

同被引文献91

引证文献14

二级引证文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部