基于改进伊藤算法的最短路径网络路由优化算法

摘要

Through the analysis of shortest path problem on network routing,we built the network model of the shortest path routing problem by using ITO algorithm to get the lowest cost route optimization target.To speed up ITO lowest routing algorithm''s convergence speed,the proposed algorithm involves cost inspired factor in the state transition strategy,and hence improves path weight updating rules.The convergence speed and optimization capability are enhanced simultaneously by introducing the method of population cross and using the information exchange between populations.A 2-opt operator-based inversion operator is adopted to optimize the algorithm and to avoid falling into local optimal solution.The astringency of the algorithm was also analyzed systematically.The case study illustrates that the improved algorithm is effective to speed up the convergence speed and enhance optimization capability.%通过对网络路由最短路径问题进行分析,使用伊藤算法求解以费用最低为目标的路由优化问题,建立最短路径路由问题的网络结构模型.为加快伊藤算法求解费用最低路由的收敛速度,在状态转移策略中引入费用启发因子,优化漂移和波动过程,并改进路径权重更新规则.将种群交叉思想引入算法中,利用种群间的信息交流加快了算法的收敛速度并提高了寻优能力.在2-opt算子局部优化的基础上加入反转算子,避免陷入局部最优解.文中还对算法的收敛性进行了系统分析.实验结果表明,改进后的算法有效提升了收敛速度并加强了寻优能力.