The Theory, Improvement and Application of Ant Colony Algorithm

Ant Colony Optimization Algorithm (ACO) is a novel kind of simulated evolutionary optimization algorithm, which provides a new method for complicated combinatorial optimization problems. The theory and astringency of ACO are analyzed in this paper. Suggestions are given for the improvement of ACO in selection strategy, pheromone modification and pheromone mutation, so that it can not only easily run into the local optimum and but also converge at the global optimum. The results of application in TSP problems show that it has better performance.