基于改进最大-最小蚁群算法的QoS路由算法

QoS Routing Algorithm Based on Improved Max-Min ant Colony Algorithm

针对蚁群算法在QoS路由应用上的收敛速度慢和易陷入局部最优等缺陷,提出了一种"基于改进的最大-最小蚁群算法的QoS路由算法",在算法中改进节点选择策略,并将最大-最小蚁群算法与局部搜索结合起来,有效抑制算法的过早收敛,提高了全局寻优能力和收敛速度,使QoS路由优化问题得到很好的解决.

For the defects of slow convergence and easy tO fall into local optimum in the ant colony algorithm for QoS routing application , a＂QoS routing algorithm based on improved Max-Min ant colony algorithm＂ is proposed in this paper. The node selection strategy is improved and Max-Min ant colony algorithm is combined with local search. It can maintain the diversity of features, effectively inhibit premature convergence of the algorithm, improve the ability of global optimization and convergence rate, so that the QoS routing optimization problem was effectively solved.