Understanding elementary landscapes

L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationGECCO'08
Subtitle of host publicationProceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008
PublisherAssociation for Computing Machinery
Pages585-592
Number of pages8
ISBN (Print)9781605581309
DOIs
StatePublished - 2008
Event10th Annual Genetic and Evolutionary Computation Conference, GECCO 2008 - Atlanta, GA, United States
Duration: Jul 12 2008Jul 16 2008

Publication series

NameGECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Other

Other10th Annual Genetic and Evolutionary Computation Conference, GECCO 2008
CountryUnited States
CityAtlanta, GA
Period7/12/087/16/08

Keywords

  • Combinatorial optimization
  • Local search

Fingerprint Dive into the research topics of 'Understanding elementary landscapes'. Together they form a unique fingerprint.

Cite this