Convergence Analysis of a Class of Adaptive Ant Colony Algorithm

This paper presents a class of adaptive ant colony optimization algorithm and proves its convergence properties. The global searching and convergence ability are improved by adaptively changing the pheromone trails evaporation factors and decreasing lower pheromone bound. Markov process analysis is used to prove convergence properties of the algorithms. It is shown that its current solutions of the system converge, with probability one, to an optimal solution of the system.