基于可选节点集优化的变异蚁群算法的QoS路由算法  

QOS ROUTING ALGORITHM BASED ON SELECTABLE NODE SET OPTIMIZATION-BASED MUTATED ANT COLONY ALGORITHM

作　　者：古明家[1] 宣士斌[1] 廉侃超[1] 李永胜[1] 

机构地区：[1]广西民族大学数学与计算机科学学院,广西南宁530006

出　　处：《计算机应用与软件》2010年第6期73-76,共4页Computer Applications and Software

基　　金：国家民委科研项目(07GX04)

摘　　要：多约束QoS单播路由问题是一个NP-完全问题,针对基本蚁群算法在解决多约束QoS单播路由问题时易陷入局部最优解、收敛速度慢的突出缺点,提出一种基于可选节点集优化的变异蚁群算法对该问题进行求解。该算法采取混合蚂蚁行为,可选节点集优化,二次变异,借助节点使用计数器,引入二次蚁群搜索机制,减少了算法陷入局部极值的可能性,提高了算法的寻优能力和收敛速度。仿真实验结果验证了该算法的可行性和有效性。QoS-based unicast routing with multiple constraints is an NP-complete problem.Ant colony algorithm is easy to fall into local optimum and is slow in convergence speed when solving QoS-based unicast routing with multiple constraints.In light of this prominent drawback,a mutated ant colony algorithm based on selectable node set optimisation is proposed in this paper to solve this problem.The algorithm adopts hybrid ant behaviour,optimization of selectable node set,twice mutation and uses counter by means of node,it imports the mechanism of twice ant colony search so that the algorithm＇s possibility of falling into local optimum is reduced,its search ability and convergence speed are improved as well.The feasibility and effectiveness of the algorithm are validated by the results of simulation experiment.

关 键 词：多约束 单播路由 二次变异 蚁群算法 

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