基于带宽受限模糊权重的蚁群优化算法及其应用  

Ant Colony Optimization Algorithm Based on Limited Bandwidths Fuzzy Weight Value and Its Application

作　　者：金劲[1,2] 洪毅[1] 赵付青[1] 余冬梅[1] 

机构地区：[1]兰州理工大学电气工程与信息工程学院,甘肃兰州730030 [2]兰州交通大学电子与信息工程学院,甘肃兰州730070

出　　处：《南京理工大学学报》2012年第2期320-327,共8页Journal of Nanjing University of Science and Technology

基　　金：国家自然科学基金(61064011)

摘　　要：针对基于流量控制的优化路径很难得到最优解和计算复杂度过大等问题,该文提出带宽受限条件下基于随机网络拓扑的模糊蚁群优化动态流量分配方案。该方案根据网络流量的模糊控制划分路径权重,将路径权重融入信息素中;采用蚁群全局搜索和信息素控制在多条路径中动态选择最优路径。仿真结果证明了该算法的有效性,该法显著加快了传统路由算法网络流量的探索收敛速度。In view of the problem that the traffic-controlled optimal path calculation has no optimal path but complex calculation,a fuzzy ant colony optimization routing algorithm is used to solve the dynamical traffic distribution when the bandwidth is constrained in the random network topology.The path weight value distributed by the fuzzy control of the network traffic is combined with the pheromone.The optimal routings is dynamically selected among the multiple path according to the globl ant colony searching and the pheromone control.The simulation results show that the given algorithm is effective and can improve the exploring convergence speed of the traditional routing algorithm in the network traffic.

关 键 词：路径权重 流量分配 动态路径 带宽受限 

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