A Hybrid Genetic Algorithm for the Quadratic Assignment Problem

A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the results obtained through the application of each of these algorithms separately. The QAP is a NP-hard problem and instances of size n> > 15 are still considered intractable. The results of our experiments suggest that CHC combined with TS (CHC+TS), and a TS with elitist backtracking algorithm are able to obtain good near optimal solutions within 0.75% of the best-known solutions. CHC+TS produces the best-known solution in 12 of the 16 QAPLIB problems tested, where n ranges from 10 to 256.

[1]  M. Resende Greedy Randomized Adaptive Search Procedures (grasp) , 1995 .

[2]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

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

[4]  Fred Glover,et al.  Genetic algorithms and scatter search: unsuspected potentials , 1994 .

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

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

[7]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[8]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[9]  B. Freisleben,et al.  A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Bernd Freisleben,et al.  A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.

[11]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

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

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

[14]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[15]  Panos M. Pardalos,et al.  Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem , 1997, SIAM J. Optim..

[16]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[17]  Sigeru Omatu,et al.  Efficient Genetic Algorithms Using Simple Genes Exchange Local Search Policy for the Quadratic Assignment Problem , 2000, Comput. Optim. Appl..

[18]  L. Darrell Whitley,et al.  A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.

[19]  Bernd Freisleben,et al.  New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.

[20]  R. Battiti,et al.  Simulated annealing and Tabu search in the long run: A comparison on QAP tasks☆ , 1994 .

[21]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

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

[23]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

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

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

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

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

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

[29]  Maurício Resende A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming , 1996 .

[30]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[31]  W. Punch,et al.  An approach to solving combinatorial optimization problems using a population of reinforcement learning agents , 1999 .

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