%A MAN Zhen-zhen, YU Shi-ming and HE De-feng %T Shortest Path Network Routing Optimization Algorithm Based on Improved ITO Algorithm %0 Journal Article %D 2017 %J Computer Science %R 10.11896/j.issn.1002-137X.2017.07.038 %P 215-220 %V 44 %N 7 %U {https://www.jsjkx.com/CN/abstract/article_651.shtml} %8 2018-11-13 %X 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.