Subscribe Now Subscribe Today
Science Alert
 
FOLLOW US:     Facebook     Twitter
Blue
   
Curve Top
Information Technology Journal
  Year: 2009 | Volume: 8 | Issue: 3 | Page No.: 354-359
DOI: 10.3923/itj.2009.354.359
Convergence and Runtime of an Ant Colony Optimization Model
X. Yu and T. Zhang

Abstract:
This study considered a model of an Ant Colony Optimization (ACO) algorithm for the general combinatorial optimization problem. The model proved that it can converge to one of the optima if only this optimum is allowed to update the pheromone model and that it can not converge to any of the optima if two or more optima are allowed. The iteration complexity of the model can be computed easily. And then a lower bound of time complexity of a real ACO algorithm for the general combinatorial optimization problem can be obtained.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Research on the Particle-Ant Colony Algorithm in Web Services Composition Problem
  •    Traffic free routing using Path Load Factor in Wireless Sensor Networks
  •    Combined Swarm Intelligence Routing Protocol for MANET
  •    A Hybrid CDMA Multiuser Detector with Ant Colony Optimization and Code Filtering System
How to cite this article:

X. Yu and T. Zhang, 2009. Convergence and Runtime of an Ant Colony Optimization Model. Information Technology Journal, 8: 354-359.

DOI: 10.3923/itj.2009.354.359

URL: https://scialert.net/abstract/?doi=itj.2009.354.359

 
COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

       

       

Curve Bottom