Evaluating evolutionary algorithms
Open accessThe DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Whitley, D. (1994) · Statistics and Computing · doi:10.1007/bf00175354 · Cited by 4,522
Self-citationKnapsack Problems: Algorithms and Computer Implementations
Connolly, D., Martello, S., & Toth, P. (1991) · Journal of the Operational Research Society · doi:10.2307/2583458 · Cited by 3,120
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Algorithms for Minimization Without Derivatives
G., D., & Brent, R. P. (1974) · Mathematics of Computation · doi:10.2307/2005713 · Cited by 2,847
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
An Overview of Evolutionary Algorithms for Parameter Optimization
Bäck, T., & Schwefel, H.-P. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.1 · Cited by 2,111
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Numerical optimization of computer models
(1982) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(82)90117-3 · Cited by 1,624
Fundamentals of Computer Algorithms
Horowitz, E., & Sahni, S. K. (1983) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,375
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
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
(1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0029723 · Cited by 1,049
Eshelman, L. J. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50020-3 · Cited by 1,040
Training feedforward neural networks using genetic algorithms
Montana, D. J., & Davis, L. D. (1989) · International Joint Conference on Artificial Intelligence · Cited by 1,006
Schaffer, J. D., Caruana, R. A., Eshelman, L. J., & Das, R. (1989) · international conference on Genetic algorithms · Cited by 896
Proceedings of the fourth international conference on Genetic algorithms
Belew, R. K., & Booker, L. B. (1991) · Cited by 822
Genetic algorithms and neural networks: optimizing connections and connectivity
Whitley, D., Starkweather, T., & Bogart, C. (1990) · Parallel Computing · doi:10.1016/0167-8191(90)90086-o · Cited by 747
Self-citationA 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
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
Brent, R. P. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0371062-9 · Cited by 603
Combinations of genetic algorithms and neural networks: a survey of the state of the art
Schaffer, J. D., Whitley, D., & Eshelman, L. J. (2003) · [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks · doi:10.1109/cogann.1992.273950 · Cited by 570
Self-citationTesting heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
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 387
Relative Building-Block Fitness and the Building-Block Hypothesis
Forrest, S., & Mitchell, M. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50013-1 · Cited by 363
Genetic Algorithms Are NOT Function Optimizers
De Jong, K. A. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50006-4 · Cited by 233
Genetic Algorithms and evolution strategies: Similarities and differences
Hoffmeister, F., & Bäck, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0029787 · Cited by 225
Goldberg, D. E. (1990) · Complex Systems · Cited by 207
An Iterative Method for Finding Stationary Values of a Function of Several Variables
Powell, M. J. D. (1962) · The Computer Journal · doi:10.1093/comjnl/5.2.147 · Cited by 193
Representational issues in genetic optimization
LIEPINS, G. E., & VOSE, M. D. (1990) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139008953717 · Cited by 185
Genetic neural networks on MIMD computers
Radcliffe, N. J. (1992) · ERA · Cited by 54
Evolutionary programming: an introduction and some current directions
Fogel, D. B. (1994) · Statistics and Computing · doi:10.1007/bf00175356 · Cited by 44
Cited by
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
“According to Whitley et al. (1996), we prefer test functions that are non-linear, non-separable, scalable with dimension (cid:1) , and resistant to simple hill-climbing.”
BackgroundHaupt, R. L., & Haupt, S. E. (2003) · Wiley eBooks · doi:10.1002/0471671746 · Cited by 4,246
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
(2005) · Cited by 2,565
García, S., Molina, D., Lozano, M., & Herrera, F. (2009) · Journal of Heuristics · doi:10.1007/s10732-008-9080-4 · Cited by 1,719
Metadata
- Authors
- Whitley, D., Rana, S., Dzubera, J., & Mathias, K. E.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1996-08
- Volume
- 85
- Issue
- 1-2
- Pages
- 245-276
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2094453630
- Cited by
- 406
- References
- 44
- FWCI
- 4.81
- Type
- journal article
- Language
- en
- Open access
- bronze
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.