Runtime analysis of a simple ant colony optimization algorithm

DOI10.1007/s00453-007-9134-2zbMath1190.68049OpenAlexW2011904305WikidataQ57200652 ScholiaQ57200652MaRDI QIDQ1022344

Frank Neumann, Carsten Witt

Publication date: 22 June 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9134-2

zbMATH Keywords

ant colony optimizationruntime analysisrandomized search heuristics

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (16)

Towards a runtime comparison of natural and artificial evolution ⋮ Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems ⋮ Runtime analysis of discrete particle swarm optimization applied to shortest paths computation ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ Analysis of an iterated local search algorithm for vertex cover in sparse random graphs ⋮ Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ Runtime analysis of the 1-ANT ant colony optimizer ⋮ A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem ⋮ Energy efficient ant colony algorithms for data aggregation in wireless sensor networks ⋮ A cross layer optimization modeling for a periodic WSN application ⋮ Working principles of binary differential evolution ⋮ Ant colony optimization and the minimum spanning tree problem ⋮ Runtime analysis of a binary particle swarm optimizer ⋮ Stochastic optimization with adaptive restart: a framework for integrated local and global learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• On the distribution of the number of successes in independent trials
• The Metropolis algorithm for graph bisection
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the finite-time dynamics of ant colony optimization
• Ant colony optimization theory: a survey
• A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
• STACS 2005
• Automata, Languages and Programming

This page was built for publication: Runtime analysis of a simple ant colony optimization algorithm