Cited by 4,655Metaheuristic Optimization Algorithms ResearchEvolutionary Algorithms and ApplicationsAntenna Design and Optimization

A review on genetic algorithm: past, present, and future

Open access
Katoch, Sourabh, Chauhan, Sumit Singh, Kumar, Vijay·2021·Multimedia Tools and Applications

Abstract

In this paper, the analysis of recent advances in genetic algorithms is discussed. The genetic algorithms of great interest in research community are selected for analysis. This review will help the new and demanding researchers to provide the wider vision of genetic algorithms. The well-known algorithms and their implementation are presented with their pros and cons. The genetic operators and their usages are discussed with the aim of facilitating new researchers. The different research domains involved in genetic algorithms are covered. The future research directions in the area of genetic operators, fitness function and hybrid algorithms are discussed. This structured review will be helpful for research and graduate teaching.

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.1007/s11042-020-10139-6

Cites

231 of 231 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?

  • Genetic algorithms can solve both constrained and unconstrained optimization problems based on a natural selection process.

    “GA, derived from a study of a biological system, can solve both constrained and unconstrained optimization problems based on a natural selection process [164,165].”

    From Vibration Analysis for Machine Monitoring and Diagnosis: A Systematic Review (2021) · cites this paper as [165]

    The Introduction (page unavailable) describes GAs as inspired by biological evolution and explains fitness-based selection. The Applications > Operation management section describes GAs addressing problems with design constraints, but the paper’s discussion does not establish the separate claim that GAs solve unconstrained optimization problems; that wording appears only in a reference title. (LLM, conf=0.82)

    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

Research works printed but not linked: 9

  1. [19]Burdsall B, Giraud-Carrier C (1997) Evolving fuzzy prototypes for efficient data clustering," in second international ICSC symposium on fuzzy logic and applications. Zurich, Switzerland, pp. 217-223.
  2. [56]Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: formulation, discussion and generalization. In: ICGA, pp 416–423. Morgan Kaufmann
  3. [66]Goldberg D Lingle R Alleles, loci and the traveling salesman problem Proceedings of the 1st international conference on genetic algorithms and their applications, vol. 1985 1985 USA Los Angeles 154 159
  4. [88]Jebari K Selection methods for genetic algorithms. Abdelmalek Essaâdi University International Journal of Emerging Sciences 2013 3 4 333 344
  5. [122]Leng LT Guided genetic algorithm 1999 Doctoral Dissertation University of Essex
  6. [129]Lucasius CB Kateman G Applications of genetic algorithms in chemometrics Proceedings of the 3rd international conference on genetic algorithms 1989 Los Altos, CA, USA Morgan Kaufmann 170 176
  7. [141]T. Murata and M. Gen (2000) Cellular genetic algorithm for multi-objective optimization, in Proceedings of the Fourth Asian Fuzzy System Symposium, pp. 538–542
  8. [144]Ono I Kobayashi S Back T A real-coded genetic algorithm for functional optimization using unimodal normal distribution crossover Proceedings of the 7th international conference on genetic algorithms, ICGA-7 1997 East Lansing, MI, USA Morgan Kaufmann 246 253
  9. [167]Richter JN Peak D Fuzzy evolutionary cellular automata, in international conference on artificial neural networks in engineering 2002 Saint Louis USA

Cited by

Sorted by citations

Authors
Katoch, S., Chauhan, S. S., & Kumar, V.
Affiliations
National Institute of Technology Hamirpur (BD)
Corresponding author
Kumar, Vijay
Venue
Multimedia Tools and Applications
Published
2020-10-31
Volume
80
Issue
5
Pages
8091-8126
ISSN
  • 1380-7501 (ISSN-L)
  • 1573-7721
OpenAlex
W3094704314
Cited by
4,655
References
231
Citations by year
2026: 596 · 2025: 1098 · 2024: 1173 · 2023: 1039 · 2022: 596 · 2021: 151 · 2020: 1 · 2019: 1
FWCI
175.83
Type
journal article
Language
en
Open access
Locations
  • Multimedia Tools and Applications (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
  • Physical Sciences › Engineering › Aerospace Engineering › Antenna Design and Optimization
Keywords
genetic algorithm, genetic operators, fitness function, hybrid algorithm, evolutionary computation, future research directions

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