Runtime analysis of a simple ant colony optimization algorithm
type: Item
instance of: scholarly article
title: Runtime analysis of a simple ant colony optimization algorithm
zbMATH Open document ID: 1190.68049
author: F. Neumann
author: Carsten Witt
published in: Algorithmica
publication date: 2009-06-22T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5566991
zbMATH Keywords: randomized search heuristics
zbMATH Keywords: ant colony optimization
zbMATH Keywords: runtime analysis
MaRDI profile type: Publication
full work available at URL: s00453-007-9134-2
OpenAlex ID: W2011904305
Wikidata QID: Q57200652
cites work: Ant colony optimization theory: a survey
cites work: Q5480099
cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Q5538132
cites work: Q5624436
cites work: Q4418669
cites work: On the distribution of the number of successes in independent trials
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: The Metropolis algorithm for graph bisection
cites work: Automata, Languages and Programming
cites work: STACS 2005
DBLP publication ID: journals/algorithmica/NeumannW09
DOI: 10.1007/S00453-007-9134-2
description: scientific article; zbMATH DE number 5566991