A Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems

A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure of the search space. Many problems are not elementary; however, the objective function of a combinatorial optimization problem can always be expressed as a superposition of multiple elementary landscapes if the underlying neighborhood used is symmetric. This paper presents theoretical results that provide the foundation for algebraic methods that can be used to decompose the objective function of an arbitrary combinatorial optimization problem into a sum of subfunctions, where each subfunction is an elementary landscape. Many steps of this process can be automated, and indeed a software tool could be developed that assists the researcher in finding a landscape decomposition. This methodology is then used to show that the subset sum problem is a superposition of two elementary landscapes, and to show that the quadratic assignment problem is a superposition of three elementary landscapes.

[1]  Andrew M. Sutton,et al.  Partial neighborhoods of elementary landscapes , 2009, GECCO '09.

[2]  Rami Bahsoon,et al.  Applying Elementary Landscape Analysis to Search-Based Software Engineering , 2010, 2nd International Symposium on Search Based Software Engineering.

[3]  L. Darrell Whitley,et al.  A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.

[4]  Alex A. Freitas,et al.  Evolutionary Computation , 2002 .

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

[6]  J. Barnes,et al.  A Note on Distance Matrices Yielding Elementary Landscapes for the TSP , 2002 .

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

[8]  Andrew M. Sutton,et al.  Directed Plateau Search for MAX-k-SAT , 2010, SOCS.

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

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

[11]  Peter F. Stadler,et al.  Laplacian Eigenvectors of Graphs , 2007 .

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

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

[14]  P. Stadler.  Fitness Landscapes , 1993 .

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

[16]  Enrique Alba,et al.  Autocorrelation measures for the quadratic assignment problem , 2012, Appl. Math. Lett..

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

[18]  Christian M. Reidys,et al.  Combinatorial Landscapes , 2002, SIAM Rev..

[19]  Andrew M. Sutton,et al.  Fitness Function Distributions over Generalized Search Neighborhoods in the q-ary Hypercube , 2013, Evolutionary Computation.

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

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

[22]  P. Stadler.  Landscapes and their correlation functions , 1996 .

[23]  Peter F. Stadler,et al.  Correlation length, isotropy and meta-stable states , 1997 .

[24]  Enrique Alba,et al.  Elementary landscape decomposition of the frequency assignment problem , 2011, Theor. Comput. Sci..

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