The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Genetic Algorithms: Principles of Natural Selection Applied to Computation
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
An Evolutionary Approach to Norms
Axelrod, R. (1986) · American Political Science Review · doi:10.1017/s0003055400185016 · Cited by 2,205
An Overview of Evolutionary Algorithms for Parameter Optimization
Bäck, T., & Schwefel, H.-P. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.1 · Cited by 2,111
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Genetic Algorithms and Random Keys for Sequencing and Optimization
Bean, J. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.154 · Cited by 1,543
Induction: Processes Of Inference
Holland, J. H., Holyoak, K. J., Nisbett, R. E., & Thagard, P. (1986) · The MIT Press eBooks · doi:10.7551/mitpress/3729.001.0001 · Cited by 1,534
The immune system, adaptation, and machine learning
Farmer, J. D., Packard, N. H., & Perelson, A. S. (1986) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(86)90240-x · Cited by 1,087
A Closed Set of Normal Orthogonal Functions
Walsh, J. L. (1923) · American Journal of Mathematics · doi:10.2307/2387224 · Cited by 967
Co-evolving parasites improve simulated evolution as an optimization procedure
Hillis, W. D. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90076-2 · Cited by 780
Artificial evolution for computer graphics
Sims, K. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122752 · Cited by 741
Evolutionary Operation: A Method for Increasing Industrial Productivity
Box, G. E. P. (1957) · Applied Statistics · doi:10.2307/2985505 · Cited by 576
Artificial evolution for computer graphics
Sims, K. (1991) · ACM SIGGRAPH Computer Graphics · doi:10.1145/127719.122752 · Cited by 435
Classifier systems and the animat problem
Wilson, S. W. (1987) · Machine Learning · doi:10.1007/bf00058679 · Cited by 285
Dynamic Parameter Encoding for genetic algorithms
Schraudolph, N. N., & Belew, R. K. (1992) · Machine Learning · doi:10.1007/bf00993252 · Cited by 250
What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
Forrest, S., & Mitchell, M. (1994) · Machine Learning · doi:10.1007/bf00993046 · Cited by 217
Self-citationRepresentational issues in genetic optimization
LIEPINS, G. E., & VOSE, M. D. (1990) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139008953717 · Cited by 185
Genetic Algorithms and Robotics
Davidor, Y. (1991) · World Scientific series in robotics and intelligent systems · doi:10.1142/1111 · Cited by 168
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
Forrest, S., & Mitchell, M. (1993) · Machine Learning · doi:10.1023/a:1022626114466 · Cited by 114
Self-citation
Cited by
The atomic simulation environment—a Python library for working with atoms
Hjorth Larsen, A., Jørgen Mortensen, J., Blomqvist, J., Castelli, I. E., Christensen, R., Dułak, M., Friis, J., Groves, M. N., Hammer, B., Hargus, C., et al. (2017) · Journal of Physics: Condensed Matter · doi:10.1088/1361-648x/aa680e · Cited by 4,464
Mathews, D. H., Sabina, J., Zuker, M., & Turner, D. H. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1999.2700 · Cited by 3,795
Distilling Free-Form Natural Laws from Experimental Data
Schmidt, M., & Lipson, H. (2009) · Science · doi:10.1126/science.1165893 · Cited by 2,890
Stemmer, W. P. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.22.10747 · Cited by 1,284
GenProg: A Generic Method for Automatic Software Repair
Le Goues, C., Nguyen, T., Forrest, S., & Weimer, W. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.104 · Cited by 1,085
Self-citation
Metadata
- Authors
- Forrest, S.
- Venue
- Science
- Published
- 1993-08-13
- Volume
- 261
- Issue
- 5123
- Pages
- 872-878
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2122689321
- Cited by
- 882
- References
- 18
- FWCI
- 34.07
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.