Ant Colony Optimization Algorithms for Shortest Path Problems

DOI10.1007/978-3-642-00393-6_5MaRDI QIDQ3616975zbMATH OpenOpenAlexFDO

Authors Sudha Rani Kolavali, Shalabh Bhatnagar

Publication date 26 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00393-6_5

zbMATH Keywords

ant colony optimizationmulti-stage shortest path problemstochastic approximation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Running time analysis of ant colony optimization for shortest path problems
• The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
• A simple ant colony optimizer for stochastic shortest path problems
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• scientific article; zbMATH DE number 2159380

Cites work

• Ant colony optimization theory: a survey
• Ant colony optimization.

Cited in

(4)

• A simple ant colony optimizer for stochastic shortest path problems
• Running time analysis of ant colony optimization for shortest path problems
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• Ant Lion Optimized Lexicographic Model for Shortest Path Identification

Describes a project that uses

Uses Software

• AntHocNet

This page was built for publication: Ant Colony Optimization Algorithms for Shortest Path Problems

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