基于遗传蚁群算法的多约束QoS组播路由算法  

A Multiple Constrained QoS Multicast Routing Algorithm Based on Genetic Algorithm-Ant Colony Algorithm

作　　者：胡浩[1] 张航[1] 康晓军[1] 张思发[1] 

机构地区：[1]中国地质大学(武汉),武汉430074

出　　处：《计算机与数字工程》2015年第9期1566-1568,1705,共4页Computer & Digital Engineering

基　　金：湖北省自然科学基金面上项目"基于蚁群遗传算法的QoS组播路由器研究及设计"(编号:2013CFB407)资助

摘　　要：针对带宽、延时、延时抖动和包丢失率约束以及费用最小的多约束QoS路由问题,论文提出一种多约束Qos组播路由算法。该算法结合遗传算法和蚁群算法的优势,将遗传算法和蚁群算法进行融合,对蚁群进行选择、交叉、变异等操作,扩大搜索空间,同时利用遗传算法的快速收敛特性,选取最优个体用于更新全局信息素,加快了算法收敛。仿真结果表明了该算法的有效性和可行性。To solve the least cost QoS multicast routing problem with Multiple Constrained of bandwidth, delay, delay jitter, packet loss. A new way is proposed to combine the genetic algorithm and the ant colony algorithm, this algorithm combines the advantages of genetic algorithm and ant colony algorithm, based on ant colony of selection, crossover and muta- tion operations to expand the search space, at the same time use the fast convergence property of genetic algorithm, selecting the best individual to update global pheromone, accelerate the algorithm convergence. The simulation results show that the algorithm is an effective and feasible multiple constrained QoS routing algorithm.

关 键 词：QOS组播路由 遗传算法 蚁群算法 

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