Runtime analysis of ant colony optimization with best-so-far reinforcement

DOI10.1007/s11009-007-9047-1zbMath1192.68965OpenAlexW1993561093MaRDI QIDQ1042538

Giovanni Sebastiani, Walter J. Gutjahr

Publication date: 14 December 2009

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-007-9047-1

zbMATH Keywords

combinatorial optimizationMarkov processesanalysis of algorithmshitting timesstochastic algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Randomized algorithms (68W20)

Related Items

Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems ⋮ Approximation performance of ant colony optimization for the TSP(1,2) problem ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ 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 ⋮ When to use bit-wise neutrality ⋮ Runtime analysis of a binary particle swarm optimizer ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years

Cites Work

• An extended ant colony algorithm and its convergence analysis
• ACO algorithms with guaranteed convergence to the optimal solution
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
• On the finite-time dynamics of ant colony optimization
• First steps to the runtime complexity analysis of ant colony optimization
• Comparing evolutionary algorithms to the (\(1+1\))-EA
• Ant colony optimization theory: a survey
• A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
• Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
• Runtime Analysis of a Simple Ant Colony Optimization Algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: Runtime analysis of ant colony optimization with best-so-far reinforcement