Abstract
The development of genetic algorithms has been hampered by the lack of theory describing their behaviour, particularly on complex fitness landscapes. Here we propose a method for visualising and analysing the progress of a search algorithm on some hard optimisation problems using barrier trees. A barrier tree is a representation of the search space as a tree where the leaves of the tree represent local optima and nodes of the tree show the fittest saddle points between subtrees. The depth of the leaves and nodes corresponds to the fitness of the local optima and saddle points. Each configuration in search space can be mapped to a position on the tree depending on which optima are accessible without ever decreasing the fitness below its starting value. Having computed a barrier tree we can easily visualise how any search algorithm explores the search space.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hallam, J., Prügel-Bennett, A. (2003). Barrier Trees For Search Analysis. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive