Understanding elementary landscapes
Date
2008
Authors
Whitley, L. Darrell
Sutton, Andrew M.
Howe, Adele E.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference item
Citation
Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, 2008: pp.585-592
Statement of Responsibility
L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe
Conference Name
Genetic and Evolutionary Computation Conference (10th : 2008 : Atlanta, Georgia)
GECCO'08
GECCO'08
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.
School/Discipline
School of Computer Science
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2008 ACM