ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Ant Colony Optimization Algorithms for Shortest Path Problems

Kolavali, Sudha Rani and Bhatnagar, Shalabh (2009) Ant Colony Optimization Algorithms for Shortest Path Problems. [Book Chapter]

[img] PDF
lncs.pdf - Published Version
Restricted to Registered users only

Download (178Kb) | Request a copy
Official URL: http://dx.doi.org/10.1007/978-3-642-00393-6_5

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].

Item Type: Book Chapter
Related URLs:
Additional Information: Copyright of this book chapter belongs to Springer.
Keywords: Ant colony optimization;stochastic approximation;multi-stage shortest path problem.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 27 May 2009 12:02
Last Modified: 14 Mar 2017 09:48
URI: http://eprints.iisc.ernet.in/id/eprint/20437

Actions (login required)

View Item View Item