Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem

In this paper we perform extensive computational experiments solving quadratic assignment problems using various variants of a hybrid genetic algorithm. We introduce a new tabu search (simple tabu). We compared the modified robust tabu and the simple tabu as improvement algorithms in a hybrid genetic algorithm with other tabu searches (concentric tabu, ring moves, all moves, robust tabu) with superior results. We also tested several modifications of the hybrid genetic algorithm and all of them produced good results.

[1]  George A. Marcoulides,et al.  Modern methods for business research , 1998 .

[2]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[3]  Alfonsas Misevicius,et al.  An improved hybrid genetic algorithm: new results for the quadratic assignment problem , 2004, Knowl. Based Syst..

[4]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[5]  Franz Rendl,et al.  The Quadratic Assignment Problem , 2002 .

[6]  Alfonsas Misevicius.  Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem , 2003, Knowl. Based Syst..

[7]  Zvi Drezner,et al.  A new heuristic for the quadratic assignment problem , 2002, Adv. Decis. Sci..

[8]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[9]  Zvi Drezner,et al.  A Procedure for Transforming Points in Multi-Dimensional Space to a Two-Dimensional Representation , 1993 .

[10]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[11]  Mika Nyströem.  Solving Certain Large Instances of the Quadratic Assignment Problem: Steinberg's Examples , 1999 .

[12]  Jeff T. Linderoth,et al.  Solving large quadratic assignment problems on computational grids , 2002, Math. Program..

[13]  Alfonsas Misevicius,et al.  A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem , 2003, Informatica.

[14]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[15]  Kurt M. Anstreicher,et al.  The Steinberg Wiring Problem , 2004, The Sharpest Cut.

[16]  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).

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

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[20]  Said Salhi,et al.  Heuristic Search Methods , 1998 .

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

[22]  Jorge Pinho de Sousa,et al.  Metaheuristics: Computer Decision-Making , 2010 .

[23]  Z. Drezner,et al.  A distance-based selection of parents in genetic algorithms , 2004 .

[24]  Zvi Drezner,et al.  Gender-Specific Genetic Algorithms* , 2006 .

[25]  Zvi Drezner,et al.  The extended concentric tabu for the quadratic assignment problem , 2005, Eur. J. Oper. Res..

[26]  Zvi Drezner,et al.  A New Genetic Algorithm for the Quadratic Assignment Problem , 2003, INFORMS J. Comput..

[27]  Zvi Drezner,et al.  A distance based rule for removing population members in genetic algorithms , 2005, 4OR.

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[29]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

[30]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

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

[32]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[33]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[34]  Eranda Çela,et al.  The quadratic assignment problem : theory and algorithms , 1999 .

[35]  Jakob Krarup,et al.  A hospital facility layout problem finally solved , 2001, J. Intell. Manuf..

[36]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[37]  Zvi Drezner,et al.  Mapping the convergence of genetic algorithms , 2006, Adv. Decis. Sci..

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

[39]  Zvi Drezner.  Compounded genetic algorithms for the quadratic assignment problem , 2005, Oper. Res. Lett..

[40]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[41]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[42]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .