| 具有时延约束网络路由问题的自适应蚁群优化算法 |
| |
| 引用本文： | 高坚. 具有时延约束网络路由问题的自适应蚁群优化算法[J]. 计算机应用与软件, 2005, 22(11): 96-98 |
| |
| 作者姓名： | 高坚 |
| |
| 作者单位： | 烟台大学计算机学院,山东,烟台,264005 |
| |
| 摘 要： | 高速多媒体网络中的路由问题是有QoS约束的路由问题，满足一个或多个约束的路由问题是NP-完全问题，其中，具有时间延迟约束的QoS路由问题是一个极具代表性的问题。本文给出了一种求解具有时间延迟约束的QoS路由问题的自适应蚁群算法。该算法在种群中采用基于目标函数值的启发式信息素分配策略和根据目标函数自动调整蚂蚁搜索路径的行为。比一般蚁群算法具有更强的鲁棒性和全局优化能力。理论分析和仿真实验表明，该算法是有效的网络QoS路由算法。
|
| 关 键 词： | QoS路由问题 蚁群算法 信息素 |
| 收稿时间： | 2004-02-24 |
| 修稿时间： | 2004-02-24 |
QoS ROUTING OPTIMIZATION APPROACH WITH TIME DELAY CONSTRAINT BASED ON ANT COLONY ADAPTIVE ALGORITHM |
| |
| Gao Jian. QoS ROUTING OPTIMIZATION APPROACH WITH TIME DELAY CONSTRAINT BASED ON ANT COLONY ADAPTIVE ALGORITHM[J]. Computer Applications and Software, 2005, 22(11): 96-98 |
| |
| Authors: | Gao Jian |
| |
| Affiliation: | School of Computer Science and Technology, Yantai University, Yantai Shandong 264005, China |
| |
| Abstract: | In multimedia network the routing problem is subject to QoS constraints. These problems are NP-complete. In this paper, an ant colony adaptive algorithm is proposed to solve the QoS Routing Problem with time delay constraint. This method takes self-adaptive heuristic pheromone assignment approach strategy based on objective-funciton value. Both the analytical and experimented studies indicate that this method is faster and more efficient to converge upon the optimal value in the whole field. |
| |
| Keywords: | QoS routing problem Ant colony algorithm Pheromone |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
