Runtime analysis of ant colony optimization on dynamic shortest path problems
type: Item
instance of: scholarly article
title: Runtime analysis of ant colony optimization on dynamic shortest path problems
zbMATH Open document ID: 1303.68122
author: Andrei Lissovoi
author: Carsten Witt
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6376128
zbMATH Keywords: ant colony optimization
zbMATH Keywords: shortest paths
zbMATH Keywords: dynamic problems
zbMATH Keywords: runtime analysis
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.06.035
OpenAlex ID: W2003694457
Wikidata QID: Q57200583
cites work: A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
cites work: Q5306039
cites work: Q4436917
cites work: Optimizing expected path lengths with ant colony optimization using fitness proportional update
cites work: Analyzing evolutionary algorithms. The computer science perspective.
cites work: Ant colony optimization and the minimum spanning tree problem
cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
cites work: Simplified drift analysis for proving lower bounds in evolutionary computation
cites work: Running time analysis of ant colony optimization for shortest path problems
cites work: A simple ant colony optimizer for stochastic shortest path problems
DOI: 10.1016/J.TCS.2014.06.035
description: scientific article; zbMATH DE number 6376128