Ant colony optimization and the minimum spanning tree problem

DOI10.1016/j.tcs.2010.02.012zbMath1189.90134OpenAlexW1683332710WikidataQ57200632 ScholiaQ57200632MaRDI QIDQ974104

Carsten Witt, Frank Neumann

Publication date: 27 May 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.012

zbMATH Keywords

combinatorial optimizationant colony optimizationruntime analysis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs ⋮ Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm ⋮ 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 ⋮ Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions ⋮ Runtime analysis of ant colony optimization on dynamic shortest path problems

Cites Work

• Minimum spanning trees made easier via multi-objective optimization
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Runtime analysis of a simple ant colony optimization algorithm
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Ant colony optimization theory: a survey
• Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
• STACS 2005
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ant colony optimization and the minimum spanning tree problem