基于改进型蚁群算法的研究

Routing technology has been one of the core research of intelligent optical network. As the maximum and minimum ant colony algorithm has a good global search capability, ant colony algorithm as a representative of dynamic routing, is widely used in intelligent optical network dynamic routing. However, this algorithm has many disadvantages such as a large amount of computation time, long solution time and slow convergence time. To speed up the convergence time of ant colony algorithm, an improved ant colony algorithm is proposed in this paper and validated on the TSP problem. The results show that compared with the basic ant colony algorithm, the improved ant colony algorithm can effectively improve the convergence time.