Home > Table of Contents


Proceedings of the 2nd International Symposium on Information Processing (ISIP 2009)

Huangshan, China, August 21-23, 2009

Editors: Fei Yu, Jian Shu, and Guangxue Yue

AP Catalog Number: AP-PROC-CS-09CN002

ISBN: 978-952-5726-02-2 (Print), 978-952-5726-03-9 (CD-ROM)

Page(s): 364-367

First Order Deceptive Problem of Ant Colony Optimization Algorithm

Chen Ling , Sun HaiYing, and WangSu

Full text: PDF


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 first-order deceptive systems taking the n-bit 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, n-bit trap problem

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved