Work

Elementary landscape decomposition of the quadratic assignment problem

Year: 2010

Type: conference-paper

Abstract: 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.

Source: Genetic and Evolutionary Computation Conference (GECCO)

DOI: 10.1145/1830483.1830745

Authors: Francisco Chicano, Gabriel Luque, Enrique Alba

Institution: Universidad de Málaga

Language: English

Topic: Metaheuristic Optimization Algorithms Research

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1983516902

FWCI: 1.815

Cites: 15

Cited by: 14

Related to: 10