Elementary landscape decomposition of the quadratic assignment problem

The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP can be written as the sum of three elementary landscapes when the swap neighborhood is used. We present a closed formula for each of the three elementary components and we compute bounds for the autocorrelation coefficient.

[1]  Andrew M. Sutton,et al.  Understanding elementary landscapes , 2008, GECCO '08.

[2]  R. Staden.  A strategy of DNA sequencing employing computer programs. , 1979, Nucleic acids research.

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

[4]  H. Waelbroeck,et al.  Complex Systems and Binary Networks , 1995 .

[5]  Vassilis Zissimopoulos,et al.  On the landscape ruggedness of the quadratic assignment problem , 2001, Theor. Comput. Sci..

[6]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[9]  Eric Angela,et al.  On the landscape ruggedness of the quadratic assignment problem , 2001 .

[10]  Vassilis Zissimopoulos,et al.  On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient , 2000, Discret. Appl. Math..

[11]  B. Drossel.  Biological evolution and statistical physics , 2001, cond-mat/0101409.

[12]  Vassilis Zissimopoulos,et al.  Autocorrelation Coefficient for the Graph Bipartitioning Problem , 1998, Theor. Comput. Sci..

[13]  Andrew M. Sutton,et al.  A polynomial time computation of the exact correlation structure of k-satisfiability landscapes , 2009, GECCO '09.

[14]  Stephanie Forrest,et al.  Genetic algorithms, operators, and DNA fragment assembly , 1995, Machine Learning.

[15]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .