.png){kind=icon}
Return
Parallel Ant Colony Optimization on Graphics Processing Units
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2012.01.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The purpose of this paper is to propose effective parallelization strategies for the Ant Colony Optimization (ACO) metaheuristic on Graphics Processing Units (GPUs). The Max-Min Ant System (MMAS) algorithm augmented with 3-opt local search is used as a framework for the implementation of the parallel ants and multiple ant colonies general parallelization approaches. The four resulting GPU algorithms are extensively evaluated and compared on both speedup and solution quality on a state-of-the-art Fermi CPU architecture. A rigorous effort is made to keep parallel algorithms true to the original MMAS applied to the Traveling Salesman Problem. We report speedups of up to 23.60 with solution quality similar to the original sequential implementation. With the intent of providing a parallelization framework for ACO on GPUs, a comparative experimental study highlights the performance impact of ACO parameters, CPU technical configuration, memory structures and parallelization granularity. (C) 2012 Elsevier Inc. All rights reserved.
Keywords:
Ant colony optimization
Parallel metaheuristics
GPU
CUDA
MMAS
Parallel ants
Multiple colonies
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSaveNumerical simulation of behavior of red blood cells and cancer cells in complex geometrical domains
PREAI
ShareSaveShareSave
View more