基于自适应蚁群算法的多受限网络QoS路由优化  

Optimization of Multiple Constrains QoS Routing Based on an Adaptive Ant Colony System Algorithm

作　　者：高坚[1] 

机构地区：[1]烟台大学计算机学院,烟台264005

出　　处：《计算机工程》2003年第19期40-41,67,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(69875014)

摘　　要：高速多媒体网络中的路由问题是有QoS约束的路由问题,多受限的路由问题是一个NP-完全问题。该文提出了一种解决多受限Qos路由问题的自适应蚁群算法。该算法采用基于目标函数值的信息索分配策略和根据目标函数值自适应调整蚂蚁的搜索行为,从而保证搜索的快速有效性,使多受限Qos路由优化问题得到了很好地解决。In multimedia network the routing problem is subject to QoS constrains. These problems are NP-complete. In this paper, an adaptive ant colony system algorithm is proposed to solve the QoS routing for multiple constrains. A new objective-function-based heuristic pheromone assignment approach is used for pheromone update and an elitist strategy is used to filtrate solution candidates. The algorithm gets good performance and can effectively solve QoS routing with multiple constrains.

关 键 词：多受限 QOS路由 自适应 蚁群算法 

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