A new metric to measure distances between solutions to the Quadratic Assignment Problem

Solutions to the Quadratic Assignment Problem (QAP) can be compared with each other in several ways. In this work a new distance metric for measuring the distance respectively similarity between two solutions will be introduced. Such a metric is useful in measuring the performance of heuristic optimization algorithms and generally in the analysis of the QAP's fitness landscape. The new metric is described, compared to the most commonly used metric and evaluated on a number of problem instances. The correlation between the fitness distance and the solution distance can be improved in several problem instances providing a different and more interesting picture on algorithm performance.

[1]  Fred W. Glover,et al.  Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

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

[3]  Stephan M. Winkler,et al.  Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications , 2009 .

[4]  Tim Jones.  Evolutionary Algorithms, Fitness Landscapes and Search , 1995 .

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

[6]  Ryszard Klempous,et al.  Recent Advances in Intelligent Engineering Systems , 2011, Studies in Computational Intelligence.

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

[8]  L. Darrell Whitley,et al.  A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[9]  Sven Rahmann,et al.  Microarray Layout as Quadratic Assignment Problem , 2006, German Conference on Bioinformatics.

[10]  A. N. Elshafei,et al.  Hospital Layout as a Quadratic Assignment Problem , 1977 .

[11]  D. Fogel.  An evolutionary approach to the traveling salesman problem , 1988, Biological Cybernetics.

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

[13]  Michael Affenzeller,et al.  A Comprehensive Survey on Fitness Landscape Analysis , 2012, Recent Advances in Intelligent Engineering Systems.

[14]  Franz Rothlauf,et al.  Design of Modern Heuristics , 2011, Natural Computing Series.

[15]  M. El-Sharkawi,et al.  Introduction to Evolutionary Computation , 2008 .

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

[17]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[18]  Zvi Drezner,et al.  Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem , 2008, Comput. Oper. Res..