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. (C) 2002 Elsevier Science (USA)
| Original language | English |
|---|---|
| Pages (from-to) | 1421-1432 |
| Number of pages | 12 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | 62 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - Sept 2002 |