摘要
基本蚁群算法求解多约束的QoS网络路由时速度慢,容易出现早熟收敛和停滞现象,将信息素适量更新与变异的蚁群算法应用到网络路由问题中,使得每轮搜索后信息素的增量更好地反映了解的质量,实验仿真表明该思想的引入加快了收敛速度,在很大程度上弥补了基本蚁群算法在解决网络路由优化问题时出现的不足。
To overcome the default of slow convergence speed,precocity and stagnation in the basic Ant Colony Algorithm （ACA） to solve the multiple constrained QoS routing problem,this paper applies a new rule of updating pheromones of ACA for routing problem,which the quality of a solution can be reflected better through the increment of pheromone after every round of search and the convergence rate is enhanced as well.The simulation result of the QoS routing problem shows that the performance of basic ant colony algorithm is improved effectively by the new rule of updating method
出处
《计算机工程与应用》
CSCD
北大核心
2011年第13期212-215,共4页
Computer Engineering and Applications
基金
国家自然科学基金No.60773224~~
关键词
蚁群算法
多约束服务质量(QoS)
网络路由
ant colony algorithm
multiple constrained Quality of Service（QoS）
network routing
