Genetic Algorithms: Principles of Natural Selection Applied to Computation
- 13 August 1993
- journal article
- research article
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 261 (5123) , 872-878
- https://doi.org/10.1126/science.8346439
Abstract
A genetic algorithm is a form of evolution that occurs on a computer. Genetic algorithms are a search method that can be used for both solving problems and modeling evolutionary systems. With various mapping techniques and an appropriate measure of fitness, a genetic algorithm can be tailored to evolve a solution for many types of problems, including optimization of a function or determination of the proper order of a sequence. Mathematical analysis has begun to explain how genetic algorithms work and how best to use them. Recently, genetic algorithms have been used to model several natural evolutionary systems, including immune systems.Keywords
This publication has 20 references indexed in Scilit:
- Using Genetic Algorithms to Explore Pattern Recognition in the Immune SystemEvolutionary Computation, 1993
- Searching for Diverse, Cooperative Populations with Genetic AlgorithmsEvolutionary Computation, 1993
- An Overview of Evolutionary Algorithms for Parameter OptimizationEvolutionary Computation, 1993
- Recombination dynamics and the fitness landscapePhysica D: Nonlinear Phenomena, 1992
- Artificial evolution for computer graphicsACM SIGGRAPH Computer Graphics, 1991
- Co-evolving parasites improve simulated evolution as an optimization procedurePhysica D: Nonlinear Phenomena, 1990
- Representational issues in genetic optimizationJournal of Experimental & Theoretical Artificial Intelligence, 1990
- Outline for a Logical Theory of Adaptive SystemsJournal of the ACM, 1962
- Evolutionary Operation: A Method for Increasing Industrial ProductivityJournal of the Royal Statistical Society Series C: Applied Statistics, 1957
- A Closed Set of Normal Orthogonal FunctionsAmerican Journal of Mathematics, 1923