%0 Journal Article
%T Research based on improved ant colony algorithm in QoS multicast routing<br>基于改进信息素的蚁群算法在QoS 组播路由中的研究
%A CHEN Xuan
%A WAN Zhi-ping
%A XU Fang-heng
%A LONG Dan
%A <br>陈　暄
%A 万志平
%A 许方恒
%A 龙　丹
%J 计算机应用研究
%D 2012
%I 
%X QoS multicast routing problem has been widely used for solving complex optimization problems in various engineering and science fields. In order to solve the time or stagnant problems in large-scale traveling salesman problem by using ant colony algorithm, this paper proposed an ant colony algorithm based on the improved pheromone. The improved algorithm made the pheromone after searching reflect solution better and better. The results of simulation experiments show that, based on the pheromone adjustment improved ant colony optimization algorithm can obtain better solution than the basic ant colony algorithm, and increases the stability of the algorithm.
%K pheromone
%K ant colony algorithm
%K QoS
%K rate of convergence
%K stability<br>信息素
%K 蚁群算法
%K 服务质量
%K 收敛速度
%K 稳定性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=F6B2E1193D3BD8E6833402843E6C3EEA&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=708DD6B15D2464E8&sid=C3A4D4F17EFA3F0C&eid=0CCF0907BDB9A249&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13