Runtime analysis of ant colony optimization with best-so-far reinforcement
type: Item
instance of: scholarly article
title: Runtime analysis of ant colony optimization with best-so-far reinforcement
zbMATH Open document ID: 1192.68965
author: Walter J. Gutjahr
author: Giovanni Sebastiani
published in: Methodology and Computing in Applied Probability
publication date: 2009-12-14T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 60J20
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5646338
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: stochastic algorithms
zbMATH Keywords: hitting times
zbMATH Keywords: Markov processes
MaRDI profile type: Publication
full work available at URL: s11009-007-9047-1
OpenAlex ID: W1993561093
cites work: Comparing evolutionary algorithms to the (\(1+1\))-EA
cites work: Ant colony optimization theory: a survey
cites work: Q5480099
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: ACO algorithms with guaranteed convergence to the optimal solution
cites work: A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
cites work: On the finite-time dynamics of ant colony optimization
cites work: First steps to the runtime complexity analysis of ant colony optimization
cites work: Q2751596
cites work: Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
cites work: Runtime Analysis of a Simple Ant Colony Optimization Algorithm
cites work: An extended ant colony algorithm and its convergence analysis
cites work: On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
DOI: 10.1007/S11009-007-9047-1
description: scientific article; zbMATH DE number 5646338