A time complexity analysis of ACO for linear functions

Authors:
Zhifeng Hao;Han Huang;Xili Zhang;Kun Tu
Affiliations:
College of Mathematical Science, South China University of Technology, Guangzhou, P.R. China;College of Computer Science and Engineering, South China University of Technology, Guangzhou, P.R. China;College of Mathematical Science, South China University of Technology, Guangzhou, P.R. China;College of Mathematical Science, South China University of Technology, Guangzhou, P.R. China
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 16
Cited 2

Ant algorithms for discrete optimization

Artificial Life
A Graph-based Ant system and its convergence

Future Generation Computer Systems
MAX-MIN Ant system

Future Generation Computer Systems
On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
Erratum to: drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85]

Artificial Intelligence
ACO Algorithm with Additional Reinforcement

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Towards an analytic framework for analysing the computation time of evolutionary algorithms

Artificial Intelligence
Ant Colony Optimization

Ant Colony Optimization
A study of drift analysis for estimating computation time of evolutionary algorithms

Natural Computing: an international journal
A proof of convergence for Ant algorithms

Information Sciences—Informatics and Computer Science: An International Journal
Ant colony optimization theory: a survey

Theoretical Computer Science
A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs

Evolutionary Computation
A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
A short convergence proof for a class of ant colony optimizationalgorithms

IEEE Transactions on Evolutionary Computation
From an individual to a population: an analysis of the firsthitting time of population-based evolutionary algorithms

IEEE Transactions on Evolutionary Computation

A pheromone-rate-based analysis on the convergence time of ACO algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Theory of swarm intelligence

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The time complexity analysis of ant colony optimization (ACO) is one of the open problems in ACO research. There has been little proposed work on this topic recently. In the present paper, two ACO algorithms (ACO I and ACO II) for linear functions with Boolean input are indicated, and their time complexity is estimated based on drift analysis which is a mathematical tool for analyzing evolutionary algorithms. It is proved that the algorithm ACO II can find the optimal solution with a polynomial time complexity. It is a preliminary work about estimating the time complexity of ACO, which should be improved in the future study.