Abstract
Genetic algorithms are believed by some to be very efficient optimization and adaptation tools. So far, the efficacy of genetic algorithms has been described by empirical results, and yet theoretical approaches are far behind. This paper aims at raising fundamental theoretical questions about the utility of genetic algorithms. These questions originate from various existing theories and the no-free-lunch theorem, a theory that compares all possible optimization procedure with respect to an equal distribution of all possible objective functions. While these questions are open at least in part, they all indicate that genetic algorithms yield worse performance than any other (deterministic) optimization algorithm. Consequently, future research should answer the question of whether the real world (or another application domain) imposes a non-equal distribution for which genetic algorithms yield advantageous performance, or whether genetic algorithms should apply operators in a deterministic fashion.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Altenberg. The Schema Theorem and the Price's Theorem, Foundations of Genetic Algorithms 3, 23–49, 1995.
T. Bäck and H.-P. Schwefel. An Overview of Evolutionary Algorithms for Parameter Optimization. Evolutionary Computation. 1(1):1–23, 1993.
D. Cliff, P. Husbands, and I. Harvey. Evolving Visually Guided Robots. In: J.-A. Meyer, H.L. Roitblat, and S.W. Wilson, eds., From Animals to Animats II: Proceedings of the Fourth International Conference on Simulation of Adaptive Behavior, MIT Press, Cambridge, MA, 374–383, 1992.
K.A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. Thesis, University of Michigan, 1975.
D. Floreano, and F. Mondada. Evolution of Homing Navigation in a Real Mobile Robot. IEEE Transactions on Systems, Man, and Cybernetics-Part B. 26(3):396–407, 1996.
D.B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Learning Intelligence, IEEE Press, NJ, 1995.
L.J. Fogel. “Autonomous Automata”, Industrial Research. 4:14–19, 1962.
D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.
J.J. Grefenstette and J.E. Baker. How Genetic Algorithms Work: A Critical Look at Implicit Parallelism. In: Proceedings of the International Conference on Genetic Algorithms ICGA3, 20–27, 1989.
S. Huber, H. Mallot, and H. Bülthoff. Evolution of the Sensorimotor Control in an Autonomous Agent. In: P. Maes, M. Mataric, J.-A. Meyer, J. Pollack, and S.W. Wilson, eds., From Animals to Animats 4: Proceedings of the Fourth International Conference on Simulation of Adaptive Behavior, MIT Press, Cambridge, MA, 449–457, 1996.
H. Mühlenbein and D. Schlierkamp-Voosen. Predictive Models for the Breeder Genetic Algorithm I. Evolutionary Computation. 1(1):25–50, 1993.
H. Mühlenbein and D. Schlierkamp-Voosen. The Science of Breeding and its Application to the Breeder Genetic Algorithm. Evolutionary Computation. 1(4):335–360, 1993.
S. Nolfi and D. Parisi. Learning to Adapt to Changing Environments in Evolving Neural Networks, Technical Report 95-15, Institute of Psychology, National Research Council, Rome, Italy., 1995.
I. Rechenberg. Evolutionsstrategie. Frommann-Holzboog, Stuttgart, 1973.
R. Salomon. Increasing Adaptivity through Evolution Strategies. In: P. Maes, M. Mataric, J.-A. Meyer, J. Pollack, and S.W. Wilson, eds., From Animals to Animats 4: Proceedings of the Fourth International Conference on Simulation of Adaptive Behavior. MIT Press, Cambridge, MA, 411–420, 1996.
R. Salomon. Reevaluating Genetic Algorithm Performance under Coordinate Rotation of Benchmark Functions; A survey of some theoretical and practical aspects of genetic algorithms. BioSystems. 39(3):263–278, 1996.
R. Salomon. The Influence of Different Coding Schemes on the Computational Complexity of Genetic Algorithms in Function Optimization. In: H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, (eds.), Proceedings of The Fourth International Conference on Parallel Problem Solving from Nature (PPSN IV). Springer-Verlag, Berlin, 227–235, 1996.
H.-P. Schwefel. Evolution and Optimum Seeking. John Wiley and Sons, NY, 1995.
M. Srinivas and L. Patnaik. Genetic Algorithms: A Survey. Computer. IEEE Press, 17–26, 1994.
M.D. Vose. Generalizing the notion of schema in genetic algorithms. Artificial Intelligence. 385–396, 1991.
D. Wolpert and W. Macready. No Free Lunch Theorems for Search. Technical Report 95-02-010, Santa Fe Institute, NM, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salomon, R. (1997). Raising theoretical questions about the utility of genetic algorithms. In: Angeline, P.J., Reynolds, R.G., McDonnell, J.R., Eberhart, R. (eds) Evolutionary Programming VI. EP 1997. Lecture Notes in Computer Science, vol 1213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014818
Download citation
DOI: https://doi.org/10.1007/BFb0014818
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62788-3
Online ISBN: 978-3-540-68518-0
eBook Packages: Springer Book Archive