An Improved Ant Colony Optimization Algorithm Based on Route Optimization and Its Applications in Travelling Salesman Problem

摘要

In this paper, we introduce two improvements on Ant Colony Optimization (AGO) algorithm: route optimization and individual variation. The first is an optimized implementation of AGO, by which the running time of ants routing is largely reduced. The results of the simulated experiments show that the improved algorithm not only reduces the number of routing in the AGO but also surpasses existing algorithms in performance in solving large-scale TSP problems. In the second improvement, we introduce individual variation to AGO, by which the ants have different routing strategies. Simulation results show that the speed of convergence of AGO algorithm could be enhanced greatly.