Abstract
On the one hand side many people admire the often strikingly efficient results of organic evolution. On the other hand side, however, they presuppose mutation and selection to be a rather prodigal and unefficient trial-and-error strategy. Taking into account the parallel processing of a heterogeneous population and sexual propagation with recombination as well as the endogenous adaptation of strategy characteristics, simulated evolution reveals a couple of interesting, sometimes surprising, properties of nature's learning-by-doing algorithm. ‘Survival of the fittest’, often taken as Darwin's view, turns out to be a bad advice. Individual death, forgetting, and even regression show up to be necessary ingredients of the life game. Whether the process should be named gradualistic or punctualistic, is a matter of the observer's point of view. He even may observe ‘long waves’.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ashby, W.R. (1960) Design for a brain. New York: Wiley, 2nd ed.
Montroll, E.W. and Shuler, K.E. (1979) Dynamics of technological evolution: random walk model for the research enterprise. Proc. Natl. Acad. Sci. USA, 76, 6030–6034.
Rechenberg, I. (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Stuttgart: Frommann-Holzboog.
Brooks, S.H. (1958) A discussion of random methods for seeking maxima. Oper. Res., 6, 244–251.
Schumer, M.A. and Steiglitz, K. (1968) Adaptive step size random search. IEEE Trans., AC-13, 270–276.
Rastrigin, L.A. (1965) Sluchainyi poisk v zadachakh optimisatsii mnogoparametricheskikh sistem. Riga: Zinatne.
Bremermann, H.J. (1968) Numerical optimization procedures derived from biological evolution processes. In: Cybernetic problems in bionics. (H.L. Oestreicher and D.R. Moore, eds.), New York: Gordon and Breach.
Box, G.E.P. and Draper, N.R. (1969) Evolutionary operation: A statistical method for process improvement. New York: Wiley.
Nelder, J.A. and Mead, R. (1965) A simplex method for function minimization. Computer Journal, 7, 308–313.
Box, M.J. (1965) A new method of constrained optimization and a comparison with other methods. Computer Journal, 8, 42–52.
Schwefel, H.P. (1981) Numerical optimization of computer models. Chichester: Wiley.
Stanley, S.M. (1981) The new evolutionary timetable. New York: Basic Books.
Meadows, D., Richardson, J. and Bruckmann, G. (1982) Groping in the dark-The first decade of Global Modelling. Chichester: Wiley.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwefel, H.P. (1991). Understanding evolution as a collective strategy for groping in the dark. In: Becker, J.D., Eisele, I., Mündemann, F.W. (eds) Parallelism, Learning, Evolution. WOPPLOT 1989. Lecture Notes in Computer Science, vol 565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55027-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-55027-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55027-3
Online ISBN: 978-3-540-46663-5
eBook Packages: Springer Book Archive