%0 Journal Article
%T Hybridized optimization genetic algorithm for multicast routing problem<br>求解动态组播路由问题的混合优化遗传算法
%A CHEN Yun-liang
%A YANG Jie
%A KANG Li-shan
%A <br>陈云亮
%A 杨捷
%A 康立山
%J 计算机应用
%D 2006
%I 
%X The mathematic model of dynamic multicast routing with Nodes delay and delay variation constraints was analyzed.Based on the model,an optimization algorithm called GP-GA was proposed by hybridizing Gene-Pool(GP) with traditional Genetic Algorithm(GA).This method made use of the gene-pool to save the solutions during the process so as to direct the remaining evolution.In the mean time,the crossover and mutation operator were improved to accelerate the convergence speed.Considering that the problem may be trapped by local optimization easily,the evolution strategy based-on("reserved) and non-reserved" was also constructed to enhance the ability of finding optimal solution and decrease the probability of "premature" phenomena commendably.A great number of simulations demonstrate that the probability of GP-GA converging optimal solutions is higher than general GA,and the algorithm is also effective for being adjusted to the dynamic multicast routing.
%K Steiner tree
%K dynamic multicast routing
%K Gene-Pool(GP)
%K Genetic Algorithm(GA)
%K routing optimization<br>Steiner树
%K 动态组播路由
%K 基因库
%K 遗传算法
%K 路由优化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=2EFA9F2AF1E158C7&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=5D311CA918CA9A03&sid=1569A0C6818E7615&eid=3D6B058F17849798&journal_id=1001-9081&journal_name=计算机应用&referenced_num=2&reference_num=16