Share Email Print

Proceedings Paper

Revisiting Bremermann's genetic algorithm: II. Comparing discrete multiparent recombination to mutation
Author(s): David B. Fogel; Gary B. Fogel
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Hans Bremermann was one of the pioneers of evolutionary computation. Many of his early suggestions for designing evolutionary algorithms anticipated future inventions. One such suggestion included the recombination of more than two parents, both in discrete particles (genes) and by blending. We have revisited Bremermann's original experiments from the early 1960s with linear systems of equations and extended them to include multiple trials that compare the use of mutation alone to the use of multi parent discrete recombination. The results indicate that for linear systems of small dimension, mutation alone outperforms multi parent discrete recombination for any number of parents from 2 to 50. In contrast, for linear systems of larger dimension, mutation alone is outperformed by all multi parent discrete recombination operators, for any number of parents from 2 to 50. The results suggest that it may be insufficient to classify a problem to be of a certain type i.e., amenable to a particular operator, in the absence of knowing the number of dimensions.

Paper Details

Date Published: 21 March 2001
PDF: 9 pages
Proc. SPIE 4390, Applications and Science of Computational Intelligence IV, (21 March 2001); doi: 10.1117/12.421184
Show Author Affiliations
David B. Fogel, Natural Selection, Inc. (United States)
Gary B. Fogel, Natural Selection, Inc. (United States)

Published in SPIE Proceedings Vol. 4390:
Applications and Science of Computational Intelligence IV
Kevin L. Priddy; Paul E. Keller; Peter J. Angeline, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?