The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Open accessAbstract
Self-adaptation is an essential feature of natural evolution. However, in the context of function optimization, self-adaptation features of evolutionary search algorithms have been explored mainly with evolution strategy (ES) and evolutionary programming (EP). In this paper, we demonstrate the self-adaptive feature of real-parameter genetic algorithms (GAs) using a simulated binary crossover (SBX) operator and without any mutation operator. The connection between the working of self-adaptive ESs and real-parameter GAs with the SBX operator is also discussed. Thereafter, the self-adaptive behavior of real-parameter GAs is demonstrated on a number of test problems commonly used in the ES literature. The remarkable similarity in the working principle of real-parameter GAs and self-adaptive ESs shown in this study suggests the need for emphasizing further studies on self-adaptive GAs.
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
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Continuous Univariate Distributions.
Omori, Y., Johnson, N. L., Kotz, S., & Balakrishnan, N. (1995) · Journal of the American Statistical Association · doi:10.2307/2291547 · Cited by 9,084
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Self-citationEvolutionsstrategie : 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
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
Vent, W. (1975) · Feddes Repertorium · doi:10.1002/fedr.19750860506 · Cited by 1,331
A combined genetic adaptive search (GeneAS) for engineering design
Deb, K., & Goyal, M. K. (1996) · Cited by 1,229
Self-citationMessy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
Self-citation
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
Knowles, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851274 · Cited by 1,254
A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization
Deb, K., Anand, A., & Joshi, D. (2002) · Evolutionary Computation · doi:10.1162/106365602760972767 · Cited by 614
Self-citationParameter Setting in Evolutionary Algorithms
(2007) · Studies in Computational Intelligence · doi:10.1007/978-3-540-69432-8 · Cited by 422
Metadata
- Authors
- Deb, K., & Beyer, H.-G.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2001-06
- Volume
- 9
- Issue
- 2
- Pages
- 197-221
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2161392888
- Cited by
- 437
- References
- 32
- FWCI
- 9.39
- Type
- journal article
- Language
- en
- Open access
- green
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: Self-Adaptive Genetic Algorithms with Simulated Binary Crossover. https://app.cochat.ai/papers/10.1162/106365601750190406
- The paper
- Deb, K., & Beyer, H.-G. (2001). Self-Adaptive Genetic Algorithms with Simulated Binary Crossover. Evolutionary Computation. https://doi.org/10.1162/106365601750190406
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.
