%0 Journal Article
%T GA for Solving QoS Constraints Multicast Routing Problem<br>一种求解QoS约束组播路由问题的遗传算法
%A YANG Yun
%A TAO Bi-lei
%A XU Jia
%A LIU Feng-yu
%A <br>杨云
%A 陶笔蕾
%A 徐佳
%A 刘凤玉
%J 计算机应用研究
%D 2007
%I 
%X QCMRA-GA(GA of QoS Constraints Multicast Routing Algorithm) is proposed as a scheme to solve multiple QoS Constraints Multicast Routing Problem based on GA.Three operators of typical GA have been redesigned to overcome the drawback of early maturing efficiently.Loop could be avoided due to codifying the chromosome with Prufer tree method.According to the characteristic of Prufer code,QCMRA-GA condenses the solution spaces based on leaf nodes and Steiner nodes in order to accelerate the convergence.Simulation experiments showed that QCMRA-GA is correct and efficient.
%K Multicast Routing
%K QoS Constraints
%K GA(Genetic Algorithm)
%K Convergence<br>组播路由
%K QoS约束
%K 遗传算法
%K 收敛性
%K 求解
%K 约束
%K 组播
%K 路由问题
%K 经典遗传算法
%K Routing
%K Problem
%K Multicast
%K 效率性
%K 实验
%K 收敛速度
%K 压缩
%K 解空间
%K 叶子节点
%K 编码特性
%K 回路
%K 树型编码
%K 染色体
%K 早熟现象
%K 设计
%K 算子
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=343459AF1736CA69333717CF18E4B247&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=0B39A22176CE99FB&sid=8BB50A069C48D50B&eid=AF507FDD66D991DA&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=18