The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Genetic algorithms
Abstract
this paper are excerpted with permission WHICH WE OBTAINED FOR CRC ARTICLE BUT STILL NEED TO GET FOR COMPUTING SURVEYS from S. Forrest, Science 261:872878, Aug. 13, 1993 (Copyright 1993 American Association for the Advancement of Science) and from [4, 2, 3] NOTE: we also need to acknowledge that this comes from the longer CRC article. erated for many generations, the overall fitness of the population generally improves, and the individuals in the population represent improved "solutions" to whatever problem was posed in the fitness function. Figure 1 shows an example of a genetic algorithm being used to optimize a simple function. There are many ways of implementing this idea, the most prevalent being the strategy introduced by Holland [6, 5, 2] and illustrated in Figure 1. In recent years, "genetic algorithms " have taken many forms, and in some cases bear little resemblance to Holland's original formulation. Researchers have experimented with different types of representations, crossover and mutation operators, special-purpose operators, and different approaches to reproduction and selection. However, all of these methods have a family resemblance in that they take some inspiration from biological evolution and from Holland's original genetic algorithm. Books that describe the theory and practice of genetic algorithms in greater detail include [6, 5, 1, 8, 7, 9]. The genetic algorithm is interesting from a computational standpoint, at least in part, because of the claims that have been made about its effectiveness as a biased sampling algorithm. The classical argument about genetic algorithm performance has three components:
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Induction: Processes of Inference, Learning, and Discovery
Holland, J. H., Holyoak, K. J., Nisbett, R. E., Thagard, P. R., & Smoliar, S. W. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307100 · Cited by 2,305
Genetic Algorithms: Principles of Natural Selection Applied to Computation
Forrest, S. (1993) · Science · doi:10.1126/science.8346439 · Cited by 882
Self-citationIntroduction to Genetic Algorithm
Dutta, P., Pal, S., Kumar, A., & Cengiz, K. (2023) · Artificial Intelligence for Cognitive Modeling · doi:10.1201/9781003216001-5 · Cited by 308
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-citation
Cited by
An Overview of Evolutionary Algorithms in Multiobjective Optimization
Fonseca, C. M., & Fleming, P. J. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.1 · Cited by 2,266
Yuvaraj, T., Devabalaji, K. R., Kumar, J. A., Thanikanti, S. B., & Nwulu, N. I. (2024) · IEEE Access · doi:10.1109/access.2023.3349274 · Cited by 249
Metadata
- Authors
- Forrest, S.
- Venue
- ACM Computing Surveys
- Published
- 1996-03
- Volume
- 28
- Issue
- 1
- Pages
- 77-80
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2294708468
- Cited by
- 355
- References
- 7
- FWCI
- 3.84
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Genetic algorithms. https://app.cochat.ai/papers/10.1145/234313.234350
- The paper
- Forrest, S. (1996). Genetic algorithms. ACM Computing Surveys. https://doi.org/10.1145/234313.234350
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.