TY - GEN
T1 - Convergence of ant colony optimization on first-order deceptive systems
AU - Chen, Yixin
AU - Sun, Haiying
PY - 2008
Y1 - 2008
N2 - Deceptive problems have been considered difficult for ant colony optimization (ACO) and it was believed that ACO will fail to converge to global optima of deceptive problems. This paper presents a convergence analysis of ACO on deceptive systems. This paper proves, for the first time, that ACO can achieve reachability convergence but not asymptotic convergence for a class of first order deceptive systems (FODS) without assuming a minimum pheromone at each iteration. Experimental results confirm the analysis.
AB - Deceptive problems have been considered difficult for ant colony optimization (ACO) and it was believed that ACO will fail to converge to global optima of deceptive problems. This paper presents a convergence analysis of ACO on deceptive systems. This paper proves, for the first time, that ACO can achieve reachability convergence but not asymptotic convergence for a class of first order deceptive systems (FODS) without assuming a minimum pheromone at each iteration. Experimental results confirm the analysis.
UR - https://www.scopus.com/pages/publications/57949084699
U2 - 10.1109/GRC.2008.4664719
DO - 10.1109/GRC.2008.4664719
M3 - Conference contribution
AN - SCOPUS:57949084699
SN - 9781424425129
T3 - 2008 IEEE International Conference on Granular Computing, GRC 2008
SP - 158
EP - 163
BT - 2008 IEEE International Conference on Granular Computing, GRC 2008
T2 - 2008 IEEE International Conference on Granular Computing, GRC 2008
Y2 - 26 August 2008 through 28 August 2008
ER -