检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机与网络》2009年第10期61-64,共4页Computer & Network
摘 要:蚁群优化(Ant Colony Optimization,ACO)是一种新型的分布式仿生优化算法,可有效地用来解决组合优化问题,而网络路由优化问题则正是组合优化问题当中的一种。因此,本文首先分析了常用路由算法与蚁群优化的基本原理,根据网络路由优化问题与蚁群优化算法的许多匹配特性,提出了一种基于改进蚁群优化的QoS路由算法(Route Algorithm based on Improved Ant Colony Optimization,RAIACO)。最后,通过实验分析,对其可行性进行了证明。Ant colony optimization (ACO) is a new type of distributed evolutionary optimization algorithm, in which the combinatorial optimization problems is solved effectively, and the network routing optinfizes is exactly one kind of combinatorial optimization problems. Thus, in this article, the basic principles about route algorithm and ant colony optimization are analyzed. Then, corresponding to the the similar characteristics between the network routing and ant colony optimization, a new QoS route algorithm based on improvement ant colony optimization (RAIACO) is proposed. Experimental results show the vadility of the proposed method.
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171