Selective pressure in evolutionary algorithms: a characterization of selection mechanisms
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Due to its independence of the actual search space and its impact on the exploration-exploitation tradeoff, selection is an important operator in any kind of evolutionary algorithm. All important selection operators are discussed and quantitatively compared with respect to their selective pressure. The comparison clarifies that only a few really different and useful selection operators exist: proportional selection (in combination with a scaling method), linear ranking, tournament selection, and (/spl mu/,/spl lambda/)-selection (respectively (/spl mu/+/spl lambda/)-selection). Their selective pressure increases in the order as they are listed here. The theoretical results are confirmed by an experimental investigation using a genetic algorithm with different selection methods on a simple unimodal objective function.>
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
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
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
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
Messy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
Adaptive Selection Methods for Genetic Algorithms
Baker, J. E. (1985) · international conference on Genetic algorithms · Cited by 1,022
Foundations of genetic algorithms. 2
Booker, L. B. (1994) · Biosystems · doi:10.1016/0303-2647(94)90009-4 · Cited by 1,018
Whitley, L. D. (1989) · international conference on Genetic algorithms · Cited by 992
Introduction to Combinatorial Mathematics.
Moon, J. W., Dantzig, G., & Liu, C. L. (1971) · The American Mathematical Monthly · doi:10.2307/2317652 · Cited by 606
Numerical Optimization of Computer Models
(1982) · Discrete Applied Mathematics · doi:10.1016/0166-218x(82)90059-2 · Cited by 413
How Genetic Algorithms Work: A Critical Look at Implicit Parallelism
Greffenstette, J. J., & Baker, J. E. (1989) · international conference on Genetic algorithms · Cited by 368
Mathematics and its applications
Lax, P. D. (1986) · The Mathematical Intelligencer · doi:10.1007/bf03026113 · Cited by 307
Evolving artificial intelligence
Fogel, D. B. (1992) · Cited by 286
Goldberg, D. E. (1990) · Complex Systems · Cited by 207
Extended Selection Mechanisms in Genetic Algorithms.
Bäck, T., & Hoffmeister, F. (1991) · Cited by 207
de la Maza, M., & Tidor, B. (1993) · international conference on Genetic algorithms · Cited by 69
CONTINUOUS EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
Fogel, G. B., & Fogel, D. B. (1995) · Cybernetics & Systems · doi:10.1080/01969729508927488 · Cited by 54
Cited by
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Borg: An Auto-Adaptive Many-Objective Evolutionary Computing Framework
Hadka, D., & Reed, P. (2013) · Evolutionary Computation · doi:10.1162/evco_a_00075 · Cited by 717
A Comparison of Selection Schemes Used in Evolutionary Algorithms
Blickle, T., & Thiele, L. (1996) · Evolutionary Computation · doi:10.1162/evco.1996.4.4.361 · Cited by 590
Genetic Algorithm Based Approach for Autonomous Mobile Robot Path Planning
Lamini, C., Benhlima, S., & Elbekri, A. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.01.113 · Cited by 478
Metadata
- Authors
- Back, T.
- Venue
- Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence
- Publisher
- IEEE
- Published
- 2002-12-17
- Pages
- 57-62
- OpenAlex
- W2159000073
- Cited by
- 376
- References
- 21
- FWCI
- 16.85
- Type
- conference paper
- 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.