Abstract
Evolutionary computation uses computational models of evolutionary processes as key elements in the design and implementation of computerbased problem solving systems. In this paper we provide an overview of evolutionary computation, and describe several evolutionary algorithms that are currently of interest. Important similarities and differences are noted, which lead to a discussion of important issues that need to be resolved, and items for future research.
Chapter PDF
Similar content being viewed by others
Keywords
- Genetic Algorithm
- Evolutionary Algorithm
- Naval Research Laboratory
- Recombination Operator
- Adaptive Representation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Atmar, W. (1992) The philosophical errors that plague both evolutionary theory and simulated evolutionary programming. Proceedings of the First Annual Conference on Evolutionary Programming, 27–34. San Diego, CA: Evolutionary Programming Society.
Bäck, T., Hoffmeister, F., & Schwefel, H.-P. (1991) A survey of evolution strategies. Proceedings of the Fourth International Conference on Genetic Algorithms, 2–9. La Jolla, CA: Morgan Kaufmann.
Bäck, T., & Schwefel, H.-P. (1993) An overview of evolutionary algorithms for parameter optimization. Submitted to the Journal of Evolutionary Computation.
Belew, R. K., & Booker, L. B. (eds.) (1991) Proceedings of the Fourth International Conference on Genetic Algorithms. La Jolla, CA: Morgan Kaufmann.
Booker, L. B. (1992) Recombination distributions for genetic algorithms. Proceedings of the Foundations of Genetic Algorithms Workshop. Vail, CO: Morgan Kaufmann.
Box, G. E. P. (1957) Evolutionary operation: a method of increasing industrial productivity. Applied Statistics, Vol. 6, 81–101.
Davis, L. (1989) Adapting operator probabilities in genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, 60–69. La Jolla, CA: Morgan Kaufmann.
de Garis, H. (1990) Genetic programming: modular evolution for darwin machines. Proceedings of the 1990 International Joint Conference on Neural Networks, 194–197. Washington, DC: Lawrence Erlbaum.
De Jong, K. A. (1975) An analysis of the behavior of a class of genetic adaptive systems. Doctoral Thesis, Department of Computer and Communication Sciences. University of Michigan, Ann Arbor.
Jong, K. & Spears, W. (1991) Learning concept classification rules using genetic algorithms. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 651–656. Sydney, Australia: Morgan Kaufmann.
De Jong, K. A. (1992) Are genetic algorithms function optimizers? Proceedings of the Second International Conference on Parallel Problem Solving from Nature.
Eshelman, L. J., & Schaffer, J. D. (1991) Preventing premature convergence in genetic algorithms by preventing incest Proceedings of the Fourth International Conference on Genetic Algorithms, 115–122. La Jolla, CA: Morgan Kaufmann.
Fbgel, L. J., Owens, A. J., & Walsh, M. J. (1966) Artificial Intelligence Through Simulated Evolution. New York: Wiley Publishing.
Fogel, D. B. (1992) An analysis of evolutionary programming. Proceedings of the First Annual Conference on Evolutionary Programming, 43–51. La Jolla, CA: Evolutionary Programming Society.
Fogel, D. B., & Atmar, J. W. (eds.) (1992) Proceedings of the First Annual Conference on Evolutionary Programming. La Jolla, CA: Evolutionary Programming Society
Fraser, A. S. (1957) Simulation of genetic systems by automatic digital computers. Australian Journal of Biological Science, 10, 484–491.
Fujiko, C., & Dickinson, J. (1987) Using the genetic algorithm to generate LISP source code to solve the prisoner's dilemma. Proceedings of the Second International Conference on Genetic Algorithms, 236–240. Cambridge, MA: Lawrence Erlbaum.
Goldberg, D. E. (1989a) Sizing populations for serial and parallel genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, 70–79. Fairfax, VA: Morgan Kaufmann.
Goldberg, D. E. (1989b) Genetic Algorithms in Search, Optimization & Machine Learning. Reading, MA: Addison-Wesley.
Goldberg, D. E., Deb, K., & Korb, B. (1991) Don't worry, be messy. Proceedings of the Fourth International Conference on Genetic Algorithms, 24–30. La Jolla, CA: Morgan Kaufmann.
Grefenstette, J. G., and Baker, J. E. (1989) How genetic algorithms work: a critical look at implicit parallelism. Proceedings of the Third International Conference on Genetic Algorithms, 20–27. Fairfax, VA: Morgan Kaufmann.
Grefenstette, John J. (1989) A system for learning control strategies with genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, 183–190. Fairfax, VA: Morgan Kaufmann.
Grefenstette, J. G. (1992) Deception considered harmful. Proceedings of the Foundations of Genetic Algorithms Workshop. Vail, CO: Morgan Kaufmann.
Harp, S. A., Samad, T., & Guha, A. (1991) Towards the genetic synthesis of neural networks. Proceedings of the Fourth International Conference on Genetic Algorithms, 360–369. La Jolla, CA: Morgan Kaufmann.
Holland, J. H. (1975) Adaptation in Natural and Artificial Systems. Ann Arbor, Michigan: The University of Michigan Press.
Holland, J. (1986) Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In R. Michalski, J. Carbonell, T. Mitchell (eds.), Machine Learning: An Artificial Intelligence Approach. Los Altos: Morgan Kaufmann.
Janikow, C. (1991) Inductive learning of decision rules from attribute-based examples: A knowledge-intensive genetic algorithm approach. TR91-030, The University of North Carolina at Chapel Hill, Dept. of Computer Science, Chapel Hill, NC.
Koza, J. R. (1991) Evolving a computer program to generate random numbers using the genetic programming paradigm. Proceedings of the Fourth International Conference on Genetic Algorithms, 37–44. La Jolla, CA: Morgan Kaufmann.
Lipsitch, M. (1991) Adaptation on rugged landscapes generated by iterated local interactions of neighboring genes. Proceedings of the Fourth International Conference on Genetic Algorithms, 128–135. La Jolla, CA: Morgan Kaufmann.
Manderick, B., de Weger, M., & Spiessens, P. (1991) The genetic algorithm and the structure of the fitness landscape. Proceedings of the Fourth International Conference on Genetic Algorithms, 143–149. La Jolla, CA: Morgan Kaufmann.
Männer, R., & Manderick, B. (1992) Proceedings of the Second International Conference on Parallel Problem Solving from Nature, Amsterdam: North Holland.
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) The distributed breeder genetic algorithm. Submitted to the Journal of Evolutionary Computation.
Rechenberg, I. (1973) Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Frommann-Holzboog, Stuttgart.
Schaffer, J. D., Eshelman, L. J. (1991) On crossover as an evolutionarily viable strategy. Proceedings of the Fourth International Conference on Genetic Algorithms, 61–68. La Jolla, CA: Morgan Kaufmann.
Schaffer, J. D. & Morishima, A. (1987) An adaptive crossover distribution mechanisms for genetic algorithms. Proceedings of the Second International Conference on Genetic Algorithms, 36–40. Cambridge, MA: Lawrence Erlbaum.
Schraudolph, N. N., & Belew, R. K. (1992) Dynamic parameter encoding for genetic algorithms. Machine Learning Journal, Volume 9, Number 1, 9–22.
Schwefel, H.-P. (1981) Numerical Optimization of Computer Models. New York: John Wiley & Sons.
Shaefer, C. G. (1987) The ARGOT strategy: adaptive representation genetic optimizer technique. Proceedings of the Second International Conference on Genetic Algorithms, 50–58. Cambridge, MA: Lawrence Erlbaum.
Smith, S. (1983) Flexible learning of problem solving heuristics through adaptive search. Proceedings of the Eighth International Joint Conference on Artificial Intelligence, 422–425. Karlsruche, Germany: William Kaufmann.
Spears, W. M., and De Jong, K. A. (1991) On the virtues of uniform crossover. Proceedings of the Fourth International Conference on Genetic Algorithms, 230–236. La Jolla, CA: Morgan Kaufmann.
Spears, W. M. (1992a) Crossover or mutation? Proceedings of the Foundations of Genetic Algorithms Workshop, Vail, Colorado: Morgan Kaufmann.
Spears, W. M. (1992b) Adapting crossover in a genetic algorithm. Naval Research Laboratory AI Center Report AIC-92-025. Washington, DC 20375 USA.
Vose, M. D., & Liepins, G. E. (1991) Schema disruption. Proceedings of the Fourth International Conference on Genetic Algorithms, 237–242. La Jolla, CA: Morgan Kaufmann.
Whitley, D. (1989) The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. Proceedings of the Third International Conference on Genetic Algorithms, 116–121. Fairfax, VA: Morgan Kaufmann.
Whitley, D., Starkweather, T., & Fuquay, D. (1989) Scheduling problems and traveling salesmen: the genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms, 133–140. Fairfax, VA: Morgan Kaufmann.
Whitley, D., Mathias, K., & Fitzhorn, P. (1991) Delta coding: an iterative search strategy for genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms, 77–84. La Jolla, CA: Morgan Kaufmann.
Whitley, D. (ed.) (1992) Proceedings of the Foundations of Genetic Algorithms Workshop. Vail, CO: Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spears, W.M., De Jong, K.A., Bäck, T., Fogel, D.B., de Garis, H. (1993). An overview of evolutionary computation. In: Brazdil, P.B. (eds) Machine Learning: ECML-93. ECML 1993. Lecture Notes in Computer Science, vol 667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56602-3_163
Download citation
DOI: https://doi.org/10.1007/3-540-56602-3_163
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56602-1
Online ISBN: 978-3-540-47597-2
eBook Packages: Springer Book Archive