Cited by 3,193Evolutionary Algorithms and ApplicationsMetaheuristic Optimization Algorithms ResearchNeural Networks and Applications

Genetic Algorithms and Machine Learning

Open access
Goldberg, David E., Holland, John H.·1988·Machine Learning

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1023/a:1022602019183

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Gradient-free methods such as Particle Swarm optimization, Genetic Algorithms and Simulated Annealing are more computationally demanding.

    “Gradient-free methods such as the Particle Swarm optimization168, Genetic Algorithms169 and Simulated Annealing170 algorithms are more demanding from a computational point of view”

    From Hardware implementation of memristor-based artificial neural networks (2024) · cites this paper as [169]

    The citation is attached to Genetic Algorithms, so this verdict concerns that method rather than Particle Swarm Optimization or Simulated Annealing. The sections “Genetic algorithms and classifier systems” and “Arguments for the evolutionary metaphor” describe genetic algorithms as parallel and relatively efficient, but do not compare their computational demands with other optimization methods. The claim of greater computational demand cannot be verified from our copy; page numbers are unavailable. (LLM, conf=0.74)

    Experimental — accuracy not yet measured
  • Gradient-free methods are rarely employed for ANN training.

    “and hence, they are rarely employed for ANN training”

    From Hardware implementation of memristor-based artificial neural networks (2024) · cites this paper as [169]

    The sections “Metaphors for learning” and “Genetic algorithms and classifier systems” discuss neural networks and genetic algorithms, but do not say how often gradient-free methods are used to train artificial neural networks. Searches for ANN training, gradients, and backpropagation found no passage addressing that frequency claim; page numbers were not available in our copy. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

1 of the 16 references couldn’t be matched to a known paper.

Research works printed but not linked: 2

  1. [7]7. Grefenstette, J. J. (Ed.). (1987). Genetic Algorithms and Their Applica- tions: Proceedings of the Second International Conference on Genetic Al- gorithms. Cambridge, MA: Lawrence Erlbaum.
  2. [12]12. Waddington, C. H. (1967). Summary discussion. In P. S. Moorhead & M. M Kaplan (Eds.), Mathematical challenges to the neo-Darwinian interpreta- tion of evolution. Philadelphia, PA: Wistar Institute Press.

Cited by

Sorted by citations

Authors
Goldberg, D. E., & Holland, J. H.
Affiliations
  • University of Alabama (US)
  • University of Michigan (US)
Venue
Machine Learning
Published
1988-10
Volume
3
Issue
2-3
Pages
95-99
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W1541288193
Cited by
3,193
References
16
Citations by year
2026: 105 · 2025: 151 · 2024: 160 · 2023: 204 · 2022: 249 · 2021: 342 · 2020: 378 · 2019: 366 · 2018: 265 · 2017: 239 · 2016: 212 · 2015: 145 · 2014: 162 · 2013: 94 · 2012: 29
Type
journal article
Language
en
Open access
Locations
  • Machine Learning (publishedVersion)
  • Deep Blue (University of Michigan) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
Keywords
genetic algorithm

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