Runtime Analysis of a Simple Ant Colony Optimization Algorithm
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 618-627
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Finite-Time Dynamics of Ant Colony OptimizationMethodology and Computing in Applied Probability, 2006
- Ant colony optimization theory: A surveyTheoretical Computer Science, 2005
- Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem2004
- Ant Colony Optimization and Swarm Intelligence2004
- Evolutionary Algorithms and the Maximum Matching Problem2003
- A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTICProbability in the Engineering and Informational Sciences, 2003
- Modeling the Dynamics of Ant Colony OptimizationEvolutionary Computation, 2002
- On the analysis of the (1+1) evolutionary algorithmTheoretical Computer Science, 2002
- The Metropolis algorithm for graph bisectionDiscrete Applied Mathematics, 1998
- On the Distribution of the Number of Successes in Independent TrialsThe Annals of Mathematical Statistics, 1956