Runtime Analysis of a Simple Ant Colony Optimization Algorithm

DOI10.1007/11940128_62MaRDI QIDQ5459156zbMATH OpenOpenAlexDBLPWikidataFDO

Authors F. Neumann, Carsten Witt

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_62

Mathematics Subject Classification ID

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

Recommendations

• Runtime analysis of a simple ant colony optimization algorithm
• Runtime analysis of the 1-ANT ant colony optimizer
• 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: recent developments in theoretical analysis

Cited in

(17)

• Runtime analysis of a simple ant colony optimization algorithm
• Runtime analysis of ant colony optimization with best-so-far reinforcement
• On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks
• On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
• A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
• Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
• On the finite-time dynamics of ant colony optimization
• First steps to the runtime complexity analysis of ant colony optimization
• A note on the parameter of evaporation in the ant colony optimization algorithm
• Ant colony optimization: recent developments in theoretical analysis
• Running time analysis of ant colony optimization for shortest path problems
• scientific article; zbMATH DE number 2013445 (Why is no real title available?)
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
• Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
• Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
• Runtime analysis of the 1-ANT ant colony optimizer

This page was built for publication: Runtime Analysis of a Simple Ant Colony Optimization Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459156)