基于改进信息素的蚁群算法在QoS组播路由中的研究  

Research based on improved ant colony algorithm in QoS multicast routing

作　　者：陈暄[1] 万志平[1] 许方恒[1] 龙丹[2] 

机构地区：[1]浙江工业职业技术学院,浙江绍兴312000 [2]浙江大学,杭州310058

出　　处：《计算机应用研究》2012年第11期4296-4299,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(30900358/C100701);浙江省教育科学规划课题(SCG366);浙江省科技厅计划资助项目(2011R30008);绍兴市教育科学规划课题(SGJ12078)

摘　　要：针对传统的蚁群算法在求解大规模旅行商问题时容易导致搜索时间过长或陷入停滞的问题,提出了一种基于改进信息素的蚁群算法。通过蚁群算法的改进,使得每轮搜索之后的信息素都能更好地反映解的质量。实验仿真结果表明,改进后的蚁群算法能获得比传统的蚁群算法更优的解,同时具有更快的收敛速度和较好的稳定性。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.

关 键 词：信息素 蚁群算法 服务质量 收敛速度 稳定性 

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