The DOI matches its Crossref record.
Selective pressure in evolutionary algorithms: a characterization of selection mechanisms
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.
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
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
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. https://app.cochat.ai/papers/10.1109/icec.1994.350042
- The paper
- Back, T. (2002). Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence. https://doi.org/10.1109/icec.1994.350042
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.
