基于改进克隆选择算法的时延受限多播路由  

Multicast routing with delay constrain based on improved CSA

作　　者：章兢[1] 王炼红[1] 

机构地区：[1]湖南大学电气与信息工程学院,湖南长沙410082

出　　处：《通信学报》2009年第7期54-58,共5页Journal on Communications

基　　金：国家自然科学基金资助项目(60634020);高校博士点基金资助项目(20060532026)~~

摘　　要：所提改进的克隆选择算法主要利用未成熟优良子群体提供的优良基因信息,根据路径代价最小化的原则和延时要求,修改个体基因以改善种群质量,同时增加一个历史至当前代最佳个体记忆单元以防止种群退化。在无需求解备选路径集的情况,直接运用该算法可快速寻到最优解。对时延受限多播路由的仿真实验表明:该算法比一般克隆选择算法和遗传算法的搜索效率更高,收敛速度更快,且算法复杂度较低,顽健性更强。With the application of the good gene information in the immaturity subpopulation, the improved clonal selection algorithm which was proposed, combined the principle of minimum cost and delay constrains to modify each individual gene so as to improve population. Meanwhile, an additional memory cell of the best individual accumulated in the process was set up to avoid population devolution. The optimized solution could be promptly searched and reached without prepared routing set. Simulation tests of multicast routing with delay constrain demonstrate that the improved clonal selection algorithm has better search efficiency, higher convergence speed, lower complexity of calculation, and better robust performance than the usual clonal selection algorithm and the genetic algorithm.

关 键 词：改进克隆选择算法 基因优化 多播路由 时延受限 

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