求解QoS组播路由问题的改进蚂蚁算法  

Ant Algorithm for QoS Multicast Routing

作　　者：刘仁芬[1] 张常有[1] 

机构地区：[1]石家庄铁道学院计算机系,河北石家庄050043

出　　处：《石家庄铁道学院学报》2006年第3期70-74,共5页Journal of Shijiazhuang Railway Institute

摘　　要：蚂蚁算法是一种相对较新的启发式方法,通过模拟蚂蚁的觅食行为,提出了求解Qos组播路由问题的改进蚂蚁算法。仿真实验表明,该算法能以较高速度收敛,有效地解决QoS组播路由问题。The ant algorithm is a relatively new meta-heuristic algorithm. The paper proposed an improved ant system algorithm to solve the QoS multicast routing problem by simulating ants＇ foraging behavior. Simulation results show that this improved algorithm have an efficient convergence rate and can solve Multicast routing effectively.

关 键 词：蚂蚁算法 组播路由 启发式搜索 

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