Sequential and parallel path-relinking algorithms for the quadratic assignment problem

The quadratic assignment problem, a classical combinatorial optimization problem, has garnered much attention due to its many applications and solution complexity. This research represents the first use of parallelization for path relinking within the QAP setting. We used a simple form of path relinking to focus on the parallel implementation's elements and to determine their impact when used with a method of this type. Our computational results demonstrate highly attractive outcomes despite the procedure's simplicity and show in particular the value of a well-designed parallelization process in this context.

[1]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

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

[4]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[5]  Thomas Stützle,et al.  ACO algorithms for the quadratic assignment problem , 1999 .

[6]  Teodor Gabriel Crainic,et al.  Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-heuristics , 2006, IEEE Wireless Communications.

[7]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[8]  Alfonsas Misevicius,et al.  A Tabu Search Algorithm for the Quadratic Assignment Problem , 2005, Comput. Optim. Appl..

[9]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[10]  Corso Elvezia.  Ant Colonies for the QAP , 1997 .

[11]  Teodor Gabriel Crainic,et al.  Parallel Strategies for Meta-Heuristics , 2003, Handbook of Metaheuristics.

[12]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[13]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[14]  Fred W. Glover,et al.  Surrogate Constraints , 1968, Oper. Res..

[15]  V. Deineko,et al.  The Quadratic Assignment Problem: Theory and Algorithms , 1998 .

[16]  Enrique Alba,et al.  A survey of parallel distributed genetic algorithms , 1999, Complex..

[17]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[18]  César Rego,et al.  RAMP: A New Metaheuristic Framework for Combinatorial Optimization , 2005 .

[19]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[20]  Bahram Alidaee,et al.  Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (Operations Research/Computer Science Interfaces Series) , 2005 .