Runtime analysis of the 1-ANT ant colony optimizer
DOI10.1016/J.TCS.2010.12.030zbMATH Open1219.68143DBLPjournals/tcs/DoerrNSW11OpenAlexW2111142076WikidataQ57200622 ScholiaQ57200622MaRDI QIDQ633703FDOQ633703
Authors: Benjamin Doerr, F. Neumann, Dirk Sudholt, Carsten Witt 
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
Recommendations
- Runtime Analysis of a Simple Ant Colony Optimization Algorithm
- Runtime analysis of a simple ant colony optimization algorithm
- First steps to the runtime complexity analysis of ant colony optimization
- Runtime analysis of ant colony optimization with best-so-far reinforcement
- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)
Cites Work
- Ant colony optimization.
- Ant colony optimization theory: a survey
- STACS 2005
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Ant colony optimization and the minimum spanning tree problem
Cited In (14)
- A note on the parameter of evaporation in the ant colony optimization algorithm
- Runtime Analysis of a Simple Ant Colony Optimization Algorithm
- Working principles of binary differential evolution
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- Title not available (Why is that?)
- Runtime analysis of a simple ant colony optimization algorithm
- Runtime analysis of ant colony optimization with best-so-far reinforcement
- Choosing the right algorithm with hints from complexity theory
- Running time analysis of ant colony optimization for shortest path problems
- First steps to the runtime complexity analysis of ant colony optimization
- A simple ant colony optimizer for stochastic shortest path problems
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
- Performance analysis of randomised search heuristics operating with a fixed budget
- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
This page was built for publication: Runtime analysis of the 1-ANT ant colony optimizer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633703)
