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. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search General Terms Theory, Algorithms Keywords Fitness Landscapes, Elementary Landscapes, Quadratic Assignment Problem

• Type: Conference
• Year: 2010
• Where: GECCO
• Authors: J. Francisco Chicano, Gabriel Luque, Enrique Alba
• Keywords: Elementary Landscapes, GECCO 2010, Optimization, Optimization Problems, Quadratic Assignment Problem