COMPARISON OF CROSSOVER OPERATORS FOR THE QUADRATIC ASSIGNMENT PROBLEM

Crossover (i.e. solution recombination) operators play very important role by constructing competitive genetic algorithms (GAs). In this paper, the basic conceptual features and specific characteristics of various crossover operators in the context of the quadratic assignment problem (QAP) are discussed. The results of experimental comparison of more than 10 different crossover operators for the QAP are presented. The results obtained demonstrate high efficiency of the crossovers with relatively low degree of disruption, namely, the swap path crossover (SPX), the cohesive crossover (COHX), the one point crossover (OPX). Another promising operator is so-called multiple parent crossover (MPX) operator based on special type of recombination of several solutions-parents. The results from the experiments show that MPX operator enables to achieve better solutions than other operators tested.

[1]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

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

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

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

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

[6]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

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

[8]  Fred Glover,et al.  Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..

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

[10]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[11]  Colin R. Reeves,et al.  Genetic Algorithms—Principles and Perspectives , 2002, Operations Research/Computer Science Interfaces Series.

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

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

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

[15]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[16]  É. Taillard,et al.  Adaptive memories for the Quadratic Assignment Problems , 1997 .

[17]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[18]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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

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

[21]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[22]  Alexander P. Topchy,et al.  COMBINED GENETIC AND LOCAL SEARCH ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM , 2000 .

[23]  Patrick D. Surry,et al.  Fitness Variance of Formae and Performance Prediction , 1994, FOGA.

[24]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

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

[26]  Ric,et al.  Adaptive Memories for the Quadratic Assignment Problem , 1997 .

[27]  L. Darrell Whitley,et al.  A Hybrid Genetic Algorithm for the Quadratic Assignment Problem , 2000, GECCO.

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