基于信息素优化的蚁群算法求解QoS单播路由问题  

Ant Colony Algorithm Based on Pheromone Optimization for Solving QoS Unicast Routing Problem

作　　者：杨剑勇[1] 

机构地区：[1]常熟理工学院计算机科学与工程学院,常熟215500

出　　处：《现代计算机（中旬刊）》2014年第11期3-6,27,共5页Modern Computer

摘　　要：蚁群算法是一种新型的启发式智能算法,它具有较好的适应性、较强的搜索能力和鲁棒性。依据这些特点,运用蚁群算法求解QoS单播路由这一多约束的NP难问题的方法。在此基础上提出根据时间变化来控制信息素阈值的优化措施,通过与传统蚁群算法的对比仿真实验,验证算法改进的有效性,并对实验结果进行分析。Ant colony algorithm is a new heuristic intelligent algorithm, it has better adaptability and strong search capability and robustness. Ac- cording to those characteristics, obtains the method to solve the multi constraint NP hard problem by using ant colony algorithm for QoS unicast routing. Then proposes the optimization measures to control pheromone threshold according to the change of time, and verifies the validity of improved algorithm, and analyzes the experimental results by comparing the simulation results with traditional ant colony algo- rithm.

关 键 词：蚁群算法 智能算法 QOS NP难问题 单播路由 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]