Sciweavers

Share
GECCO
2009
Springer

Parallel shared memory strategies for ant-based optimization algorithms

8 years 11 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the maximum clique problem. Extensive experimental results indicate that the parallel version provides noticeable improvements to the running time while maintaining comparable solution quality to that of the sequential version. Categories and Subject Descriptors G.2.2 [Discrete Mathematics]: Graph Theory, Graph algorithms; I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search, Heuristic methods General Terms Algorithms, Design Keywords Ant-Based Algorithms, Distributed Memory, Shared Memory, OpenMP, MPI, Max Clique
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz
Added 17 Feb 2011
Updated 17 Feb 2011
Type Journal
Year 2009
Where GECCO
Authors Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Rizzo
Comments (0)
books