Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem,

There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The problems that are not elementary landscapes can be decomposed in a sum of elementary ones. This sum is called the elementary landscape decomposition of the problem. In this paper, we provide the elementary landscape decomposition for the Hamiltonian Path Optimization Problem under two different neighborhoods.

[1]  Andrew M. Sutton,et al.  Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time , 2012, Theor. Comput. Sci..

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

[3]  Doug Hains,et al.  Second order partial derivatives for NK-landscapes , 2013, GECCO '13.

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

[5]  L. Darrell Whitley,et al.  Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT , 2012, GECCO '12.

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

[7]  Enrique Alba,et al.  A Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems , 2011, Evolutionary Computation.

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

[9]  Doug Hains,et al.  Hyperplane initialized local search for MAXSAT , 2013, GECCO '13.

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

[11]  Lov K. Grover.  Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..

[12]  Enrique Alba,et al.  Exact computation of the expectation curves of the bit-flip mutation using landscapes theory , 2011, GECCO '11.

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

[14]  Enrique Alba,et al.  Exact Computation of the Fitness-Distance Correlation for Pseudoboolean Functions with One Global Optimum , 2012, EvoCOP.

[15]  R. Agarwala,et al.  A fast and scalable radiation hybrid map construction and integration strategy. , 2000, Genome research.

[16]  Jens Gottlieb,et al.  Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

[17]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[18]  Andrew M. Sutton,et al.  Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis , 2011, GECCO '11.