Parallel Ant Colony Optimization for the Quadratic Assignment Problems with Symmetric Multi Processing

Recently symmetric multi processing (SMP) has become available at a reasonable cost. In this paper, we propose several types of parallel ACO algorithms with SMP for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ACO algorithms is promising in solving QAPs.

[1]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[2]  Thomas Stützle,et al.  Iterated Ants: An Experimental Study for the Quadratic Assignment Problem , 2006, ANTS Workshop.

[3]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[4]  Andrew Lewis,et al.  A Parallel Implementation of Ant Colony Optimization , 2002, J. Parallel Distributed Comput..

[5]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[6]  Shigeyoshi Tsutsui,et al.  Solving quadratic assignment problems with the cunning ant system , 2007, 2007 IEEE Congress on Evolutionary Computation.

[7]  E.-G. Talbia,et al.  Parallel Ant Colonies for the quadratic assignment problem , 2001, Future Gener. Comput. Syst..

[8]  Adnan Acan.  An External Partial Permutations Memory for Ant Colony Optimization , 2005, EvoCOP.

[9]  Adnan Acan.  An External Memory Implementation in Ant Colony Optimization , 2004, ANTS Workshop.

[10]  Richard F. Hartl,et al.  Cooperative Ant Colony Optimization on Clusters and Grids , 2004 .

[11]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[12]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[13]  Shigeyoshi Tsutsui.  cAS: Ant Colony Optimization with Cunning Ants , 2006, PPSN.

[14]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.

[15]  Qiang Lv,et al.  A Parallel ACO Approach Based on One Pheromone Matrix , 2006, ANTS Workshop.

[16]  Thomas Sttitzle.  Parallelization Strategies for Ant Colony Optimization , 2006 .

[17]  Gabriele Kotsis,et al.  Parallelization strategies for the ant system , 1998 .

[18]  Thomas Stützle,et al.  Parallel Ant Colony Optimization for the Traveling Salesman Problem , 2006, ANTS Workshop.

[19]  Thomas Stützle,et al.  Parallelization Strategies for Ant Colony Optimization , 1998, PPSN.

[20]  Shigeyoshi Tsutsui,et al.  Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization , 2007, PReMI.