论文信息 - A Convergence Proof for Ant Colony Algorithm

A Convergence Proof for Ant Colony Algorithm

In this paper, 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.

Long Jin | Jifu Nong | Long Jin | Jifu Nong

[1] W. Gutjahr. A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC , 2003, Probability in the Engineering and Informational Sciences.

[2] Thomas Stützle,et al. A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[3] Marco Dorigo,et al. Ant Colony Optimization and Stochastic Gradient Descent , 2002, Artificial Life.

[4] Marco Dorigo,et al. Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[5] Walter J. Gutjahr,et al. A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

[6] Luca Maria Gambardella,et al. Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[7] Walter J. Gutjahr,et al. ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

[8] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..