DocumentCode
3416777
Title
Peak analysis for characterizing evolutionary behavior
Author
Pfaffmann, Jeffrey O.
Author_Institution
Dept. of Comput. Sci., Lafayette Coll., Easton, PA
fYear
2009
fDate
March 3 2009-April 2 2009
Firstpage
155
Lastpage
162
Abstract
Evolutionary algorithms (EAs) use a simplified abstraction of biological evolution to interact with a fitness landscape over multiple generations. The traditional approach to exploring evolutionary motivated search relies on performance comparisons of competing designs for a common problem domain. This approach has been useful in developing an intuition of when one mechanism is superior to another. However, this intuition has developed in the absence of a clear understanding of how fitness landscape topology impacts the search process in high-dimensional space, due to the lack of high-dimensional visualization tools. Proposed is a behavior measure derived from a known set of all problem domain optima, which is used as system of landmarks. Using these landmarks, evolutionary system progress can be tracked in the problem domain and characterized with an information theoretic metric. Thus, this technique provides an intuition that takes into account the problem domain topology, allowing the behavior of different algorithm configurations to be compared as they interact with a given topology.
Keywords
evolutionary computation; information theory; biological evolution; domain topology; evolutionary algorithms; fitness landscape topology; information theory; peak analysis; Biological information theory; Convergence; Entropy; Evolution (biology); Evolutionary computation; Genetic algorithms; Genetic programming; Stochastic processes; Topology; Visualization;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Life, 2009. ALife '09. IEEE Symposium on
Conference_Location
Nashville, TN
Print_ISBN
978-1-4244-2763-5
Type
conf
DOI
10.1109/ALIFE.2009.4937707
Filename
4937707
Link To Document