Share Email Print
cover

Proceedings Paper

Theoretical developments in evolutionary computation
Author(s): David B. Fogel
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Recent developments in the theory of evolutionary computation offer evidence and proof that overturns several conventionally held beliefs. In particular, the no free lunch theorem and other related theorems show that there can be no best evolutionary algorithm, and that no particular variation operator or selection mechanism provides a general advantage over another choice. Furthermore, the fundamental nature of the notion of schema processing is called into question by recent theory that shows that the schema theorem does not hold when schema fitness is stochastic. Moreover, the analysis that underlies schema theory, namely the k- armed bandit analysis, does not generate a sampling plan that yields an optimal allocation of trials, as has been suggested in the literature for almost 25 years. The importance of these new findings is discussed in the context of future progress in the field of evolutionary computation.

Paper Details

Date Published: 1 November 1999
PDF: 11 pages
Proc. SPIE 3812, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation II, (1 November 1999); doi: 10.1117/12.367683
Show Author Affiliations
David B. Fogel, Natural Selection, Inc. (United States)


Published in SPIE Proceedings Vol. 3812:
Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation II
Bruno Bosacchi; David B. Fogel; James C. Bezdek, Editor(s)

© SPIE. Terms of Use
Back to Top