DocumentCode
2445142
Title
Evolutionary computation with extinction: experiments and analysis
Author
Fogel, Gary B. ; Greenwood, Garrison W. ; Chellapilla, Kumar
Author_Institution
Natural Selection Inc., La Jolla, CA, USA
Volume
2
fYear
2000
fDate
2000
Firstpage
1415
Abstract
Under a species-level abstraction of classical evolutionary programming, the standard tournament selection model is not appropriate. When viewed in this manner, it is more appropriate to consider two modes of life histories: background evolution and extinction. The utility of this approach as an optimization procedure is evaluated on a series of test functions relative to the performance of classical evolutionary programming and fast evolutionary programming. The results indicate that on some smooth, convex landscapes and over noisy, highly multimodal landscapes, extinction evolutionary programming can outperform classical and fast evolutionary programming. On other landscapes, however, extinction evolutionary programming performs considerably worse than classical and fast evolutionary programming. Potential reasons for this variability in performance are indicated
Keywords
evolutionary computation; background evolution; evolutionary computation; experiments; extinction; extinction evolutionary programming; fast evolutionary programming; life histories; multimodal landscapes; optimization; smooth convex landscapes; species-level abstraction; tournament selection model; Earth; Evolutionary computation; Functional programming; Genetic programming; History; Robustness; Testing; Utility programs;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2000. Proceedings of the 2000 Congress on
Conference_Location
La Jolla, CA
Print_ISBN
0-7803-6375-2
Type
conf
DOI
10.1109/CEC.2000.870818
Filename
870818
Link To Document