基于动态变异遗传算法的组播路由算法  

A Multicast Routing Approach Based on Dynamic Mutation Genetic Algorithm

作　　者：郑磊[1] 黄胜华[1] 

机构地区：[1]中国科学技术大学电子工程与信息科学系,合肥230027

出　　处：《计算机工程与应用》2005年第31期141-143,共3页Computer Engineering and Applications

摘　　要：具有时延约束的组播路由问题已被证明是NP-完全问题。论文提出了一种基于动态变异遗传算法的组播路由算法,用来解决带时延约束的组播路由问题。通过计算机仿真分析和与同类算法的比较,此算法收敛速度快,不易陷入早熟,具有很强的鲁棒性和实用性。Delay-constrained multicast routing has been proven to be a NP-Complete problem.An approach based on dynamic mutation genetic algorithm is proposed in this article to solve the muhicast routing problems with delay constraint.The computer simulation and the comparison with the similar algorithms show that its constringency is much better and its prematurity is infrequent.Moreover,it has stronger practicality and robustness.

关 键 词：遗传算法 时延约束 组播路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]