Application of an Improved Ant Colony Optimization on Generalized Traveling Salesman Problem

In this paper, we present an improved ant colony optimization (ACO) and we use it to solve the generalized traveling salesman problem (GTSP). We design a novel optimized implementation approach to reduce the processing costs involved with routing of ants in the conventional ACO, and we also improved the performance of the ACO by using individual variation strategy. Simulation results show the speed and convergence of the ACO can be enhanced greatly, and we also get the best results in some instance of GTSP.