Proceedings of the 2nd International Symposium on Information Processing (ISIP 2009) Huangshan, China, August 2123, 2009 Editors: Fei Yu, Jian Shu, and Guangxue Yue AP Catalog Number: APPROCCS09CN002 ISBN: 9789525726022 (Print), 9789525726039 (CDROM) Page(s): 364367 

First Order Deceptive Problem of Ant Colony Optimization Algorithm Chen Ling , Sun HaiYing, and WangSu 
Full text: PDF 
Abstract 

This paper shows that the first order deceptive problem of ant colony algorithm satisfies value convergence under certain initial pheromone distribution, but does not satisfy solution convergence. We also estimate the expected number of iterations required to reach the optimal solution by ACO on the firstorder deceptive systems taking the nbit trap problem as the test instance. We prove that such expected number of iterations required is O(n.log n), here n is the size of the problem. 

Index Terms 

ant colony optimization, deceptive problems, nbit trap problem 

Copyright @ 2009 ACADEMY PUBLISHER — All rights reserved 