Understanding elementary landscapes

Authors:
Darrell Whitley;Andrew M. Sutton;Adele E. Howe
Affiliations:
Colorado State University, Fort Collins, CO, USA;Colorado State University, Fort Collins, CO, USA;Colorado State University, Fort Collins, CO, USA
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 4
Cited 11

Neutrality in fitness landscapes

Applied Mathematics and Computation
Algebraic theory of recombination spaces

Evolutionary Computation
Understanding algorithm performance on an oversubscribed scheduling application

Journal of Artificial Intelligence Research
When gravity fails: local search topology

Journal of Artificial Intelligence Research

A Theoretical Analysis of the k-Satisfiability Search Space

SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Elementary landscape decomposition of the quadratic assignment problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Elementary bit string mutation landscapes

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Exact computation of the expectation curves of the bit-flip mutation using landscapes theory

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Elementary landscape decomposition of the test suite minimization problem

SSBSE'11 Proceedings of the Third international conference on Search based software engineering
A methodology to find the elementary landscape decomposition of combinatorial optimization problems

Evolutionary Computation
Search based software engineering: techniques, taxonomy, tutorial

Empirical Software Engineering and Verification
Exact computation of the fitness-distance correlation for pseudoboolean functions with one global optimum

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Quasi-elementary landscapes and superpositions of elementary landscapes

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Problem understanding through landscape theory

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 a relative smoothness and decomposability to its structure. In this paper we explain elementary landscapes in terms of the expected value of solution components which are transformed in the process of moving from an incumbent solution to a neighboring solution. We introduce new results about the properties of elementary landscapes and discuss the practical implications for search algorithms.