First steps to the runtime complexity analysis of ant colony optimization

DOI10.1016/J.COR.2006.12.017MaRDI QIDQ2475836zbMATH OpenOpenAlexFDO

Authors Walter J. Gutjahr

Publication date 11 March 2008

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2006.12.017

zbMATH Keywords

analysis of algorithmsant colony optimizationcomplexityevolutionary algorithmsruntime analysis

Mathematics Subject Classification ID

Theory of computing (68Q99) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Runtime Analysis of a Simple Ant Colony Optimization Algorithm
• Runtime analysis of a simple ant colony optimization algorithm
• Runtime analysis of the 1-ANT ant colony optimizer
• Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
• Runtime analysis of ant colony optimization with best-so-far reinforcement

Cites work

• A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
• A new rank based version of the ant system. -- A computational study
• ACO algorithms with guaranteed convergence to the optimal solution
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• An extended ant colony algorithm and its convergence analysis
• Ant colony optimization theory: a survey
• Ant colony optimization.
• Combined discrete-event simulation and ant colony optimisation approach for selecting optimal screening policies for diabetic retinopathy
• Markov processes and learning models
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the finite-time dynamics of ant colony optimization
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Runtime Analysis of a Simple Ant Colony Optimization Algorithm
• Stochastic Algorithms: Foundations and Applications

Cited in

(21)

• Runtime analysis of a simple ant colony optimization algorithm
• Runtime analysis of ant colony optimization with best-so-far reinforcement
• On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
• Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years
• Working principles of binary differential evolution
• 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
• Approximation performance of ant colony optimization for the \(\mathrm{TSP}(1,2)\) problem
• Ant colony optimization: recent developments in theoretical analysis
• A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM
• Running time analysis of ant colony optimization for shortest path problems
• The use of tail inequalities on the probable computational time of randomized search heuristics
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Using Markov-chain mixing time estimates for the analysis of ant colony optimization
• Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
• Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
• Runtime Analysis of a Simple Ant Colony Optimization Algorithm
• scientific article; zbMATH DE number 6472050 (Why is no real title available?)
• Runtime analysis of the 1-ANT ant colony optimizer
• Runtime analysis of a binary particle swarm optimizer

This page was built for publication: First steps to the runtime complexity analysis of ant colony optimization

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