Runtime Analysis of a Simple Ant Colony Optimization Algorithm
From MaRDI portal
Publication:5459156
DOI10.1007/11940128_62zbMath1135.68538DBLPconf/isaac/NeumannW06OpenAlexW2614370452WikidataQ57200671 ScholiaQ57200671MaRDI QIDQ5459156
Publication date: 24 April 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11940128_62
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
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 ⋮ Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ First steps to the runtime complexity analysis of ant colony optimization ⋮ Runtime analysis of ant colony optimization with best-so-far reinforcement
This page was built for publication: Runtime Analysis of a Simple Ant Colony Optimization Algorithm
