Understanding elementary landscapes | Zendy

Darrell Whitley | Zendy; Andrew M. Sutton | Zendy; Adele E. Howe | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Understanding elementary landscapes

Author(s) -

Darrell Whitley,

Andrew M. Sutton,

Adele E. Howe

Publication year - 2008

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/1389095.1389208

Subject(s) - formalism (music) , smoothness , computer science , construct (python library) , mathematical optimization , set (abstract data type) , topology (electrical circuits) , theoretical computer science , mathematics , combinatorics , art , mathematical analysis , musical , visual arts , programming language

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.L. Darrell Whitley, Andrew M. Sutton, Adele E. How

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research