Correlation of Problem Hardness and Fitness Landscapes in the Quadratic Assignment Problem

Estimating hardness based on intrinsic characteristics of problem instances plays an important role in algorithm selection and parameter tuning. We have compiled an extensive study of different fitness landscape and problem specific measures for the quadratic assignment problem to predict and correlate problem instance hardness for several different algorithms. We combine different fitness landscape measures that provide a generally applicably problem characterization independent of problem class with problem specific measures that have been defined for the quadratic assignment problem specifically. These measures are used to create separate and combined regression models for several different hardness measures of several different metaheuristic algorithms and are compared against each other.

[1]  J. W. Gavett,et al.  The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[2]  Anil K. Bera,et al.  Efficient tests for normality, homoscedasticity and serial independence of regression residuals , 1980 .

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

[4]  Rainer E. Burkard,et al.  Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme , 1977, Math. Methods Oper. Res..

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[7]  J. Hintze,et al.  Violin plots : A box plot-density trace synergism , 1998 .

[8]  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.

[9]  Julian Francis Miller,et al.  Information Characteristics and the Structure of Landscapes , 2000, Evolutionary Computation.

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

[11]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[12]  Michael Affenzeller,et al.  A new metric to measure distances between solutions to the Quadratic Assignment Problem , 2011, 3rd IEEE International Symposium on Logistics and Industrial Informatics.

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

[14]  Michael Affenzeller,et al.  Structural Analysis of Vehicle Routing Problems using General Fitness Landscape Analysis and Problem Specific Measures , 2012 .

[15]  Jie Chen,et al.  Problem difficulty analysis for particle swarm optimization: deception and modality , 2009, GEC '09.

[16]  E. Weinberger,et al.  Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.

[17]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Perhaps Not a Free Lunch but at Least a Free Appetizer Perhaps Not a Free Lunch but at Least a Free Appetizer , 2022 .

[18]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[19]  Elizabeth Ferreira Gouvea Goldbarg,et al.  Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach , 2002, Discret. Appl. Math..

[20]  Wim Hordijk,et al.  A Measure of Landscapes , 1996, Evolutionary Computation.

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

[22]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[23]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

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

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

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

[27]  Enrique Alba,et al.  Elementary landscape decomposition of the quadratic assignment problem , 2010, GECCO '10.

[28]  Kazuhiro Ohkura,et al.  Estimating the Degree of Neutrality in Fitness Landscapes by the Nei’s Standard Genetic Distance – An Application to Evolutionary Robotics – , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[29]  Michael Affenzeller,et al.  Generic hardness estimation using fitness and parameter landscapes applied to robust taboo search and the quadratic assignment problem , 2012, GECCO '12.

[30]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[31]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

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

[33]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[34]  Christian M. Reidys,et al.  Neutrality in fitness landscapes , 2001, Appl. Math. Comput..

[35]  David H. Wolpert,et al.  What makes an optimization problem hard? , 1995, Complex..

[36]  A. H. Land,et al.  A Problem of Assignment with Inter-Related Costs , 1963 .

[37]  Peter F. Stadler,et al.  Linear Operators on Correlated Landscapes , 1994 .

[38]  L. Barnett.  Ruggedness and neutrality—the NKp family of fitness landscapes , 1998 .

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

[40]  David W. Corne,et al.  Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem , 2002, HIS.

[41]  Kate Smith-Miles,et al.  Measuring instance difficulty for combinatorial optimization problems , 2012, Comput. Oper. Res..

[42]  Christoph Adami,et al.  Artificial life VI : proceedings of the sixth International Conference on Artificial Life , 1998 .

[43]  Riccardo Poli,et al.  Decomposition of fitness functions in random heuristic search , 2007, FOGA'07.

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

[45]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

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

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

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

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

[51]  Peter F. Stadler,et al.  Algebraic Theory of Recombination Spaces , 1997, Evolutionary Computation.

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