The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Adapting Operator Settings in Genetic Algorithms
Abstract
In the majority of genetic algorithm implementations, the operator settings are fixed throughout a given run. However, it has been argued that these settings should vary over the course of a genetic algorithm run—so as to account for changes in the ability of the operators to produce children of increased fitness. This paper describes an investigation into this question. The effect upon genetic algorithm performance of two adaptation methods upon both well-studied theoretical problems and a hard problem from operations research, the flowshop sequencing problem, are therefore examined. The results obtained indicate that the applicability of operator adaptation is dependent upon three basic assumptions being satisfied by the problem being tackled.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Cited by
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization
Qin, A. K., Huang, V. L., & Suganthan, P. N. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.927706 · Cited by 3,614
Differential evolution algorithm with ensemble of parameters and mutation strategies
Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.024 · Cited by 1,362
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Parameter Control in Evolutionary Algorithms: Trends and Challenges
Karafotias, G., Hoogendoorn, M., & Eiben, A. E. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2308294 · Cited by 516
Large-Scale Evolution of Image Classifiers
Real, E., Moore, S., Selle, A. P., Saxena, S., Suematsu, Y. I. L., Tan, J., Le, Q. V., & Kurakin, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.01041 · Cited by 466
Metadata
- Authors
- Tuson, A., & Ross, P.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 1998-06
- Volume
- 6
- Issue
- 2
- Pages
- 161-184
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2145737320
- Cited by
- 175
- References
- 2
- FWCI
- 5.25
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adapting Operator Settings in Genetic Algorithms. https://app.cochat.ai/papers/10.1162/evco.1998.6.2.161
- The paper
- Tuson, A., & Ross, P. (1998). Adapting Operator Settings in Genetic Algorithms. Evolutionary Computation. https://doi.org/10.1162/evco.1998.6.2.161
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.