Value-convergence Time Estimation of the First Order ACO on Deceptive Problems

Author

Chen, Ling ; Sun, Hai Ying ; Wang, Shu

Author_Institution

Dept. of Comput. Sci., Yangzhou Univ., Yangzhou, China

Volume

2

fYear

2009

fDate

7-8 Nov. 2009

Firstpage

250

Lastpage

254

Abstract

This paper presents a first attempt towards the value-convergence time complexity analysis of colony optimization (ACO) on the first-order deceptive systems taking the n-bit trap problem as the test instance under consideration. We prove that time complexity of MMAS, which is an ACO with limitations of the pheromone on each edge, on n-bit trap problem is O(n²m.log n), here n is the size of the problem and m is the number of artificial ants. Our experimental results confirm the correctness of our analysis.

Keywords

computational complexity; optimisation; MMAS time complexity; ant colony optimization; deceptive problems; n-bit trap problem; value-convergence analysis; value-convergence time complexity analysis; Ant colony optimization; Artificial intelligence; Computational intelligence; Computer science; Constraint optimization; Convergence; Design optimization; Runtime; State estimation; System testing; Deceptive Problems; ant colony optimization; n-bit trap problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-3835-8

Electronic_ISBN

978-0-7695-3816-7

Type

conf

DOI

10.1109/AICI.2009.370

Filename

5375950