The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
A genetic algorithm tutorial
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
Goldberg, D. E., & Deb, K. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50008-2 · Cited by 2,407
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Real-Coded Genetic Algorithms and Interval-Schemata
Eshelman, L. J., & Schaffer, J. D. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50018-0 · Cited by 1,650
Numerical optimization of computer models
(1982) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(82)90117-3 · Cited by 1,624
Reducing bias and inefficiency in the selection algorithm
Baker, J. E. (1987) · international conference on Genetic algorithms · Cited by 1,415
Vent, W. (1975) · Feddes Repertorium · doi:10.1002/fedr.19750860506 · Cited by 1,331
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
Proceedings of the third international conference on Genetic algorithms
Schaffer, J. D. (1989) · international conference on Genetic algorithms · Cited by 1,280
de la Maza, M. (1993) · ACM SIGART Bulletin · doi:10.1145/152941.1064724 · Cited by 1,088
Adaptive Selection Methods for Genetic Algorithms
Baker, J. E. (1985) · international conference on Genetic algorithms · Cited by 1,022
Genetic Algorithms for Real Parameter Optimization
Wright, A. H. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50016-1 · Cited by 998
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
A Survey of Evolution Strategies.
Bäck, T., Hoffmeister, F., & Schwefel, H. (1991) · Cited by 746
A Connectionist Machine for Genetic Hillclimbing
Ackley, D. H. (1987) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-1997-9 · Cited by 731
Distributed Genetic Algorithms
Tanese, R. (1989) · international conference on Genetic algorithms · Cited by 660
A Study of Reproduction in Generational and Steady-State Genetic Algorithms
Syswerda, G. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50009-4 · Cited by 652
Modeling genetic algorithms with Markov chains
Nix, A. E., & Vose, M. D. (1992) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530781 · Cited by 442
How Genetic Algorithms Really Work: Mutation and Hillclimbing.
Mühlenbein, H. (1992) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 365
Fine-Grained Parallel Genetic Algorithms
Manderick, B., & Spiessens, P. (1989) · international conference on Genetic algorithms · Cited by 357
Genetic algorithms in noisy environments
Fitzpatrick, J. M., & Grefenstette, J. J. (1988) · Machine Learning · doi:10.1007/bf00113893 · Cited by 333
Evolution in Time and Space – The Parallel Genetic Algorithm
Mühlenbein, H. (1991) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-050684-5.50023-9 · Cited by 328
Simple Genetic Algorithms and the Minimal, Deceptive Problem
Goldberg, D. E. (1987) · Medical Entomology and Zoology · Cited by 297
How Genetic Algorithms Work: A Critical Look at Implicit Parallelism
Greffenstette, J. J., & Baker, J. E. (1989) · international conference on Genetic algorithms · Cited by 295
Selection in Massively Parallel Genetic Algorithms.
Collins, R. J., & Jefferson, D. R. (1991) · Cited by 232
Goldberg, D. E. (1990) · Complex Systems · Cited by 207
A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint
Antonisse, J. (1989) · international conference on Genetic algorithms · Cited by 155
Whitley, L. D. (1993) · international conference on Genetic algorithms · Cited by 153
Deception Considered Harmful* *With apologies to Edsger Dijkstra (Dijkstra, 1968).
Grefenstette, J. J. (1993) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-094832-4.50011-8 · Cited by 135
An Executable Model of a Simple Genetic Algorithm
Whitley, D. (1993) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-094832-4.50009-x · Cited by 125
Self-citationModeling Simple Genetic Algorithms
Vose, M. D. (1993) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-094832-4.50010-6 · Cited by 92
The theory of virtual alphabets
Goldberg, D. E. (2006) · Springer eBooks · doi:10.1007/bfb0029726 · Cited by 37
Cited by
Review of Deep Learning Algorithms and Architectures
Shrestha, A., & Mahmood, A. (2019) · IEEE Access · doi:10.1109/access.2019.2912200 · Cited by 1,883
“of GA can be executed independently in islands and few members exchanged between the island every so often [81].”
BackgroundSearch‐based software test data generation: a survey
McMinn, P. (2004) · Software Testing, Verification and Reliability · doi:10.1002/stvr.294 · Cited by 1,368
Artificial Intelligence in Supply Chain Management: A Systematic Literature Review
Toorajipour, R., Sohrabpour, V., Nazarpour, A., Oghazi, P., & Fischl, M. (2021) · Journal of Business Research · doi:10.1016/j.jbusres.2020.09.009 · Cited by 1,020
“GAs are often regarded as function optimisers, and the range of problems to which GAs have been applied is quite extensive (Whitley, 1994).”
Search-based software engineering
Harman, M., & Jones, B. F. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00189-6 · Cited by 914
Science Requirements and Detector Concepts for the Electron-Ion Collider
Abdul Khalek, R., Accardi, A., Adam, J., Adamiak, D., Akers, W., Albaladejo, M., Al-bataineh, A., Alexeev, M. G., Ameli, F., Antonioli, P., et al. (2022) · Nuclear Physics A · doi:10.1016/j.nuclphysa.2022.122447 · Cited by 913
Metadata
- Authors
- Whitley, D.
- Venue
- Statistics and Computing
- Published
- 1994-06
- Volume
- 4
- Issue
- 2
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2047094503
- Cited by
- 4,522
- References
- 38
- FWCI
- 25.97
- 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.