A Convergence Proof for Ant Colony Algorithm

A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. Based on the two different conditions, some convergence properties for Ant Colony System (ACS) are presented. The global searching and convergence ability are improved by adaptively changing the lower pheromone bound. It is shown that ACS is guaranteed to find an optimal solution with probability 1.