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

DOI10.1016/J.IPL.2007.08.013zbMATH Open1184.68659OpenAlexW2093094460MaRDI QIDQ2380048FDOQ2380048

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

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

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)

Cites Work

• Title not available (Why is that?)
• Ant colony optimization.
• Ant colony optimization theory: a survey
• Title not available (Why is that?)
• Runtime Analysis of a Simple Ant Colony Optimization Algorithm
• Ant colony optimization and the minimum spanning tree problem
• ACO algorithms with guaranteed convergence to the optimal solution

Cited In (11)

• Runtime Analysis of a Simple Ant Colony Optimization Algorithm
• Runtime analysis of the 1-ANT ant colony optimizer
• Ant Lion Optimized Lexicographic Model for Shortest Path Identification
• Runtime analysis of a binary particle swarm optimizer
• Runtime analysis of ant colony optimization with best-so-far reinforcement
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• Running time analysis of ant colony optimization for shortest path problems
• 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

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)