Runtime analysis of the 1-ANT ant colony optimizer

DOI10.1016/j.tcs.2010.12.030zbMath1219.68143OpenAlexW2111142076WikidataQ57200622 ScholiaQ57200622MaRDI QIDQ633703

Benjamin Doerr, Carsten Witt, Dirk Sudholt, Frank Neumann

Publication date: 29 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.030

zbMATH Keywords

ant colony optimizationruntime analysisparameter dependence analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ Choosing the right algorithm with hints from complexity theory ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ Performance analysis of randomised search heuristics operating with a fixed budget ⋮ Working principles of binary differential evolution

Cites Work

• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Ant colony optimization and the minimum spanning tree problem
• Runtime analysis of a simple ant colony optimization algorithm
• Runtime analysis of ant colony optimization with best-so-far reinforcement
• On the analysis of the \((1+1)\) evolutionary algorithm
• A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
• First steps to the runtime complexity analysis of ant colony optimization
• Ant colony optimization theory: a survey
• A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item