ListarLCC - Artículos por tema "Elementary landscapes"
Mostrando ítems 1-4 de 4
-
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 ... -
Autocorrelation Measures for the Quadratic Assignment Problem
In this article we provide an exact expression for computing the autocorrelation coefficient $\xi$ and the autocorrelation length $\ell$ of any arbitrary instance of the Quadratic Assignment Problem (QAP) in polynomial ... -
Elementary landscape decomposition of the frequency assignment problem
Chicano-García, José-Francisco
; Whitley, L. Darrell; Alba-Torres, Enrique; Luna, Francisco (2014-09-30)
The Frequency Assignment Problem (FAP) is an important problem that arises in the design of radio networks, when a channel has to be assigned to each transceiver of the network. This problem is a generalization of the graph ... -
The component model for elementary landscapes and partial neighborhoods
Whitley, L. Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano-García, José-Francisco (2014-09-29)
Local search algorithms exploit moves on an adjacency graph of the search space. An “elementary landscape” exists if the objective function f is an eigenfunction of the Laplacian of the graph induced by the neighborhood ...