TBI-Preprint 07-01-001
Download:
[PDF]
Titel:
Saddles and Barrier in Landscapes of Generalized Search Operators
Author(s):
Christoph Flamm,
Ivo L. Hofacker,
Bärbel M. R. Stadler,
Peter F. Stadler
Appeared in:
LNCS 4436/2007, pp. 194-212 (2007)
Abstract:
Barrier trees are a convenient way of representing the structure of complex
combinatorial landscapes over graphs. Here we generalize the concept of
barrier trees to landscapes defined over general multi-parent search
operators based on a suitable notion of topological connectedness that
depends explicitly on the search operator. We show that in the case of
recombination spaces, path-connectedness coincides with connectedness as
defined by the mutation operator alone. In contrast, topological
connectedness is more general and depends on the details of the
recombination operators as well. Barrier trees can be meaningfully defined
for both concepts of connectedness.
Keywords:
Recombination,
Genetic Algorithm,
Fitness Landscape,
Barrier Tree,
Generalized Topology,
Connectedness,
Path Connectedness
Return to 2007 working papers list.
Last modified: 2007-08-22 12:26:24 xtof