Affordable Access

Ant Colony Optimization Algorithms for Shortest Path Problems

Authors
Publisher
Springer
Publication Date
Keywords
  • Computer Science & Automation (Formerly
  • School Of Automation)
Disciplines
  • Computer Science

Abstract

We propose four variants of recently proposed multi-timescale algorithm in [1] for ant colony optimization and study their application on a multi-stage shortest path problem. We study the performance of the various algorithms in this framework. We observe, that one of the variants consistently outperforms the algorithm [1].

There are no comments yet on this publication. Be the first to share your thoughts.