A Parallel Implementation of Ant Colony Optimization

Loading...
Thumbnail Image
File version
Author(s)
Randall, M
Lewis, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2002
Size
245252 bytes
21731 bytes
File type(s)
application/pdf
text/plain
Location
License
Abstract

Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of parallelization opportunities. In this paper, several parallel decomposition strategies are examined. These techniques are applied to a specific problem, namely the travelling salesman problem, with encouraging speedup and efficiency results.

Journal Title
Journal of Parallel and Distributed Computing
Conference Title
Book Title
Edition
Volume
62
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2002 Elsevier. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.
Item Access Status
Note
Access the data
Related item(s)
Subject
Distributed computing and systems software
Persistent link to this record
Citation
Collections