Results 1  10
of
116
Quasielementary Landscapes and Superpositions of Elementary Landscapes
"... Abstract. 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 spec ..."
Abstract
 Add to MetaCart
Abstract. 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
Understanding Elementary Landscapes
"... The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local search on combinatorial optimization problems. A landscape is elementary when it possesses a unique property that results in ..."
Abstract
 Add to MetaCart
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local search on combinatorial optimization problems. A landscape is elementary when it possesses a unique property that results
Elementary landscape decomposition of the quadratic assignment problem
 In Proceedings of GECCO
, 2010
"... Elementary landscape decomposition of the quadratic assignment problem ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Elementary landscape decomposition of the quadratic assignment problem
Partial Neighborhoods of Elementary Landscapes
"... This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs for the Traveling Salesman Problem, Graph Coloring and MinCut Graph Partitioning. The same model is then used to efficie ..."
Abstract
 Add to MetaCart
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs for the Traveling Salesman Problem, Graph Coloring and MinCut Graph Partitioning. The same model is then used
The Theory of Elementary Landscapes
 Applied Mathematical Letters
, 2002
"... When joined to a stipulated neighborhood digraph, an objective function defined on the solution space of a real combinatorial optimization problem forms a landscape. ..."
Abstract

Cited by 24 (8 self)
 Add to MetaCart
When joined to a stipulated neighborhood digraph, an objective function defined on the solution space of a real combinatorial optimization problem forms a landscape.
Arbitrary elementary landscapes & AR(1) processes
, 2005
"... Neighborhood specification is a dominant consideration in assuring the success of a direct search approach to a difficult combinatorial optimization problem. Previous research has shown the efficacy of imposing an elementary landscape upon the search topology. Barnes et al. [J.W. Barnes, S. Dokov, B ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Neighborhood specification is a dominant consideration in assuring the success of a direct search approach to a difficult combinatorial optimization problem. Previous research has shown the efficacy of imposing an elementary landscape upon the search topology. Barnes et al. [J.W. Barnes, S. Dokov
Elementary landscape decomposition of the 01 unconstrained . . .
, 2011
"... Landscapes’ theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of an especial kind of landscape called elementary landscape. The elementary landscape decomposition of a combinatorial optimization problem is a useful tool for u ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Landscapes’ theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of an especial kind of landscape called elementary landscape. The elementary landscape decomposition of a combinatorial optimization problem is a useful tool
Weakly Symmetric Graphs, Elementary Landscapes And The TSP
 Applied Math. Letters
"... Weakly symmetric graphs are de ned and their construction from symmetric graphs is explained. It is shown that the TSP on a weakly symmetric graph joined with each of a number of well known local search neighbourhoods yields elementary landscapes (in which local minima are superior to the avera ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Weakly symmetric graphs are de ned and their construction from symmetric graphs is explained. It is shown that the TSP on a weakly symmetric graph joined with each of a number of well known local search neighbourhoods yields elementary landscapes (in which local minima are superior
A Note on Distance Matrices Yielding Elementary Landscapes for the TSP
"... Symmetric and antisymmetric distance matrices in the single agent traveling salesman problem (TSP) are not the only distance matrices to generate elementary landscapes for swap and 2opt neighborhoods. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Symmetric and antisymmetric distance matrices in the single agent traveling salesman problem (TSP) are not the only distance matrices to generate elementary landscapes for swap and 2opt neighborhoods.
Results 1  10
of
116