首页 | 本学科首页   官方微博 | 高级检索  
     

基于自适应蚁群算法的多受限网络QoS路由优化
引用本文:高坚.基于自适应蚁群算法的多受限网络QoS路由优化[J].计算机工程,2003,29(19):40-41,67.
作者姓名:高坚
作者单位:烟台大学计算机学院,烟台,264005
基金项目:国家自然科学基金资助项目(69875014)
摘    要:高速多媒体网络中的路由问题是有QoS约束的路由问题,多受限的路由问题是一个NP-完全问题。该文提出了一种解决多受限QoS路由问题的自适应蚁群算法。该算法采用基于目标函数值的信息素分配策略和根据目标函数值自适应调整蚂蚁的搜索行为,从而保证搜索的快速有效性,使多受限QoS路由优化问题得到很好地解决。

关 键 词:多受限  QoS路由  自适应  蚁群算法
文章编号:1000-3428(2003)19-0040-02

Optimization of Multiple Constrains QoS Routing Based on an Adaptive Ant Colony System Algorithm
GAO Jian.Optimization of Multiple Constrains QoS Routing Based on an Adaptive Ant Colony System Algorithm[J].Computer Engineering,2003,29(19):40-41,67.
Authors:GAO Jian
Abstract: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.
Keywords:Multiple constrains  QoS routing  Adaptive  Ant colony system algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号