一种基于改进蚁群算法的光网络路由分配算法

An improved ant colony algorithm for routing assignment in optical networks

基于蚁群算法原理设计了一种适合于自动交换光网络的算法。在指出基本蚁群算法存在易过早陷入局部最优、易出现停滞现象等一系列问题的同时,针对性地给出了改进策略——状态转移选择、动态信息素更新。仿真结果表明,文章中提出的算法能有效降低全网平均阻塞率、高效分配各种网络资源、促进全网负载均匀。

Design an algorithm which is suitable for automatically switched optical network based on ant colony algorithm. In pointing out the basic ant colony algorithm is easy to fall into local optimum prematurely, algorithm prone to stagnation and a series of problems at the same time, and targeted improvement strate- gies-the state transitions select, dynamic pheromone updating. Simulation results show that the algorithm pro- posed in this paper can effectively reduce the average blocking probability of the whole network, efficient dis- tribution of various network resources, to promote uniform load of the whole network.