一种基于改进遗传算法的多播路由选择方法  

A Multicast Routing Algorithm Based on An Improved Genetic Algorithm

作　　者：周立德[1,2] 封国剑[1] 孟庆发[1,2] 铁强 

机构地区：[1]中国科学院研究生院 [2]中国科学院计算技术研究所,北京100080

出　　处：《微电子学与计算机》2006年第5期166-169,共4页Microelectronics & Computer

基　　金：国家863计划重大专项资助项目(2002AA103061)

摘　　要：遗传算法已经在多播路由优化问题中得到了广泛应用,但由于算法本身存在着收敛速度与全局收敛性之间的矛盾,使得在具体应用时经常顾此失彼,难以二者兼得,本文借鉴一种改进的遗传算法,在全局收敛的基础上提高收敛速度仿真表明,应用这种改进型遗传算法于多播路由问题,可以得到比现有启发式算法更好的结果。Despite the broad application of GA （Genetic Algorithm） in multicast routing problem, it still has the paradox between the convergence speed and the global astringency. So, in the application, we are not able to get both them usually. In this paper, a improved GA is referred. It can increase the convergence speed based on the global astringency. Simulation results show that the proposed algorithm performs better than other algorithms when be used to solve the multicast routing problem.

关 键 词：多播路由 遗传算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]