DocumentCode
1600305
Title
Towards Termination Criteria of Ant Colony Optimization
Author
Lv, Qiang ; Xia, Xiaoyan
Author_Institution
Suzhou Univ., Suzhou
Volume
5
fYear
2007
Firstpage
276
Lastpage
282
Abstract
Ant colony optimization (ACO for short) has been proved a successful meta-heuristic by a huge of empirical studies. This paper discusses the termination criteria of ACO and therefore provides research ideas to other meta-heuristics. A general discussion about four types of termination criteria has been firstly discussed in this article. Then some measures of convergence based on pheromone have been introduced. And a new termination criterion based on Bayesian approach is presented. Finally a new convergence proof for a class of ACO algorithms is presented.
Keywords
Bayes methods; combinatorial mathematics; convergence; optimisation; Bayesian approach; ant colony optimization; convergence; meta-heuristics; termination criteria; Algorithm design and analysis; Ant colony optimization; Bayesian methods; Computer science; Convergence; Information processing; Physics computing; Space exploration; Stochastic processes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location
Haikou
Print_ISBN
978-0-7695-2875-5
Type
conf
DOI
10.1109/ICNC.2007.782
Filename
4344852
Link To Document