Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 1,176

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

An introduction to genetic algorithms

Deb, Kalyanmoy·1999·Sadhana
DOI 10.1007/bf02823145
Open this paper in CoChat — free account

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.

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

Integrity signals

Registry

Crossref · 10.1007/bf02823145

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 2 references

Research works printed but not linked: 39

  1. Bäck T, Fogel D, Michalewicz Z (eds) 1997Handbook of evolutionary computation. (New York: Inst. Phys. Publ. and Oxford Univ. Press)
  2. Box M J 1965 A new method of constrained optimization and a comparison with other methods.Comput. J. 8: 42–52 · DOI · Paper page
  3. Chaturvedi D, Deb K, Chakrabarty S K 1995 Structural optimization using real-coded genetic algorithms. In:Proceedings of the Symposium on Genetic Algorithms (eds) P K Roy, S D Mehta (Dehra Dun: Siva Offset Press) pp 73–82
  4. Davis L 1991Handbook of genetic algorithms (New York: Van Nostrand Reinhold)
  5. Dawkins R 1976The selfish gene (New York: Oxford University Press)
  6. Dawkins R 1986The blind watchmaker (New York: Penguin).
  7. Deb K 1989Genetic algorithms in multimodal function optimization. Master’s thesis (TCGA Report No. 89002), Tuscaloosa, University of Alabama
  8. Deb K 1995Optimization for engineering design: Algorithms and examples (Delhi: Prentice-Hall)
  9. Deb K, Agrawal R B 1995 Simulated binary crossover for continuous search space.Complex Syst. 9: 115–148
  10. Deb K, Goldberg D E 1989 An investigation of niche and species formation in genetic function optimizationProceedings of the Third International Conference on Genetic Algorithms, pp. 42–50
  11. Deb K, Goyal M 1999 A robust optimization procedure for mechanical component design based on genetic adaptive search.ASME J. Mech. Design · DOI
  12. Deb K, Kumar A 1995 Real-coded genetic algorithms with simulated binary crossover: Studies on multimodal and multiobjective problems.Complex Syst. 9: 431–454
  13. Deb K, Pratihar D K, Ghosh A 1998 Learning to avoid moving obstracles optimally for mobile robots using a genetic-fuzzy approach.Parallel Problem Solving from Nature, (eds) A E Eiben, T Bäck, M Schoenauer, H-P Schweftel, 5: 583–592 · doi:10.1007/bfb0056900
  14. Eldredge N 1989Macro-evolutionary dynamics: Species, niches, and adaptive peaks (New York: McGraw-Hill)
  15. Eshelman L, Schaffer J D 1993 Real-coded genetic algorithms and interval-schemata.Foundations of Genetic Algorithms (ed.) L D Whitley, 2: 187–202 · DOI · Paper page
  16. Fonseca C M, Fleming P J 1993 Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. InProceedings of the Fifth International Conference on Genetic Algorithms (ed.) S Forrest, pp 416–423
  17. Gen M, Cheng R 1997Genetic algorithms and engineering design (New York: Wiley)
  18. Goldberg D E 1989Genetic algorithms in search, optimization, and machine learning (New York: Addison-Wesley)
  19. Goldberg D E, Deb K 1991 A comparison of selection schemes used in genetic algorithms. InFoundations of genetic algorithms (ed.) G J E Rawlins (San Mateo, CA: Morgan Kaufmann) pp 69–93
  20. Goldberg D E, Deb K, Horn J 1992 Massive multimodality, deception, and genetic algorithms. InParallel Problem Solving from Nature (eds) R Manner, B Manderick (Berlin: Springer-Verlag) 2: 37–46
  21. Goldberg D E, Richardson J 1987 Genetic algorithms with sharing for multimodal function optimization.Proceedings of the Second International Conference on Genetic Algorithms (ed.) J J Grefenstette, pp 41–49
  22. Goldberg D E, Smith R 1987 Nonstationary function optimization using genetic algorithms with dominance and diploidy. InProceedings of the Second International Conference on Genetic Algorithms (ed.) J J Grefenstette (Mahwah, NJ: Lawrence Erlbaum) pp 59–68
  23. Herrera F, Verdegay J L (eds) 1996Genetic algorithms and soft computing (Heidelberg: Physica-Verlag)
  24. Holland J H 1975Adaptation in natural and artificial systems (Ann Arbor: Univ. of Michigan Press)
  25. Karr C 1991Design of an adaptive fuzzy logic controller using a genetic algorithm. InProceedings of the Fourth International Conference on Genetic Algorithms (eds) R K Belew, L B Booker (San Mateo, CA: Morgan Kaufmann) pp 450–457
  26. McClelland J L, Rumelhart D E 1988Parallel distributed processing (Cambridge: MIT Press) vol. 1 and 2
  27. Michalewicz Z 1992Genetic algorithms + data structures = evolution programs (Berlin: Springer-Verlag) · DOI · Paper page
  28. Miller G F, Todd P M, Hedge S U 1989 Designing neural networks using genetic algorithms.Proceedings of the Third International Conference on Genetic Algorithms (ed.) J D Schaffer (San Mateo, CA: Morgan Kaufmann) pp 379–384
  29. Mitchell M 1996Introduction to genetic algorithms (Ann Arbor, MI: Univ. of Michigan Press) (also New Delhi: Prentice-Hall)
  30. Reklaitis G V, Ravindran A, Ragsdell K M 1983Engineering optimization methods and applications (New York: John Wiley and Sons)
  31. Rudolph G 1994 Convergence analysis of canonical genetic algorithms.IEEE Trans. Neural Network NN-5: 96–101 · DOI · Paper page
  32. Sandgren E, Jensen E 1990 Topological design of structural components using genetic optimization methods.Proceedings of the 1990 Winter Annual Meeting of the ASME, AMD-115: 31–43
  33. Spears W M, De Jong K A 1991 An analysis of multi-point crossover. InFoundations of genetic algorithms (ed.) C J E Rawlins pp 310–315 (San Mateo, CA: Morgan Kaufmann)
  34. Srinivas N 1994Multiobjective optimization using nondominated sorting in genetic algorithms. Masters thesis, Indian Institute of Technology, Kanpur
  35. Srinivas N, Deb K 1995 Multiobjective function optimization using nondominated sorting genetic algorithms.Evolutionary Comput. 2: pp 221–248 · DOI · Paper page
  36. Starkweather T, McDaniel S, Mathias K, Whitley D, Whitley C 1991 A comparison of genetic scheduling operators. InProceedings of the Fourth International Conference on Genetic Algorithms (eds) R Belew, L B Booker (San Mateo, CA: Morgan Kaufmann) pp 69–76
  37. Vose M D 1990 Generalizing the notion of schema in genetic algorithms.Artif. Intell. 50: 385–396 · DOI
  38. Winter G, Périaux J, Galan M, Cuesta P (eds) 1996Genetic algorithms in engineering and computer science (Chichester: Wiley)
  39. Whitley D 1992 An executable model of a simple genetic algorithm. InFoundations of genetic algorithms, vol. 2 pp 45–62 · DOI

Cited by

See all 1,176

Metadata

Authors
Deb, K.
Venue
Sadhana
Publisher
Springer Science and Business Media LLC
Published
1999-08
Volume
24
Issue
4-5
Pages
293-315
ISSN
  • 0256-2499 (ISSN-L)
  • 0973-7677
DOI
10.1007/bf02823145
OpenAlex
W1979356488
Cited by
1,176
References
2
FWCI
1.63
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)

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: An introduction to genetic algorithms. https://app.cochat.ai/papers/10.1007/bf02823145
The paper
Deb, K. (1999). An introduction to genetic algorithms. Sadhana. https://doi.org/10.1007/bf02823145

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.