A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs

DOI10.1016/J.IPL.2007.08.013MaRDI QIDQ2380048zbMATH OpenOpenAlexFDO

Authors Nattapat Attiratanasunthron, Jittat Fakcharoenphol

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.08.013

zbMATH Keywords

ant colony optimizationanalysis of algorithmsshortest pathsgraph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Recommendations

• Running time analysis of ant colony optimization for shortest path problems
• First steps to the runtime complexity analysis of ant colony optimization
• Ant colony optimization: recent developments in theoretical analysis
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Runtime Analysis of a Simple Ant Colony Optimization Algorithm

Cites work

• scientific article; zbMATH DE number 1249654 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• ACO algorithms with guaranteed convergence to the optimal solution
• Ant colony optimization and the minimum spanning tree problem
• Ant colony optimization theory: a survey
• Ant colony optimization.
• Runtime Analysis of a Simple Ant Colony Optimization Algorithm

Cited in

(11)

• Runtime Analysis of a Simple Ant Colony Optimization Algorithm
• Runtime analysis of the 1-ANT ant colony optimizer
• Runtime analysis of a binary particle swarm optimizer
• Runtime analysis of ant colony optimization with best-so-far reinforcement
• Ant Lion Optimized Lexicographic Model for Shortest Path Identification
• Running time analysis of ant colony optimization for shortest path problems
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• A novel ant colony optimization algorithm for the shortest-path problem in traffic networks
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• A simple ant colony optimizer for stochastic shortest path problems
• Speedup the optimization of maximal closure of a node-weighted directed acyclic graph

Describes a project that uses

Uses Software

• AntNet

This page was built for publication: A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380048)