The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Self-adaptive simulated binary crossover for real-parameter optimization
Abstract
Simulated binary crossover (SBX) is a real-parameter recombinationoperator which is commonly used in the evolutionary algorithm (EA) literature. The operatorinvolves a parameter which dictates the spread of offspring solutionsvis-a-vis that of the parent solutions. In all applications of SBX sofar, researchers have kept a fixed value throughout a simulation run. In this paper, we suggest a self-adaptive procedure of updating theparameter so as to allow a smooth navigation over the functionlandscape with iteration. Some basic principles of classicaloptimization literature are utilized for this purpose. The resultingEAs are found to produce remarkable and much better results comparedto the original operator having a fixed value of the parameter. Studieson both single and multiple objective optimization problems are madewith success.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Self-citationA Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
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
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019
Auger, A., & Stützle, T. (2019) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 1,749
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
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Price, K. V., Storn, R., & Lampinen, J. (2005) · Cited by 1,406
Vent, W. (1975) · Feddes Repertorium · doi:10.1002/fedr.19750860506 · Cited by 1,331
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-citation
Cited by
Pymoo: Multi-Objective Optimization in Python
Blank, J., & Deb, K. (2020) · IEEE Access · doi:10.1109/access.2020.2990567 · Cited by 2,344
Self-citationMultiobjective Multifactorial Optimization in Evolutionary Multitasking
Gupta, A., Ong, Y.-S., Feng, L., & Tan, K. C. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2554622 · Cited by 462
CROSSOVER OPERATORS IN GENETIC ALGORITHMS: A REVIEW
Walchand College of Engineering, I., A.J., U., P.D., S., & Government College of Engineering, K. (2015) · ICTACT Journal on Soft Computing · doi:10.21917/ijsc.2015.0150 · Cited by 363
Liang, J., Li, Z.-W., Yue, C.-T., Hu, Z., Cheng, H., Liu, Z.-X., & Guo, W.-F. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac254 · Cited by 23
Metadata
- Authors
- Deb, K., Sindhya, K., & Okabe, T.
- Venue
- Proceedings of the 9th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2007-07-07
- Pages
- 1187-1194
- OpenAlex
- W2103862045
- Cited by
- 338
- References
- 15
- FWCI
- 3.04
- 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: Self-adaptive simulated binary crossover for real-parameter optimization. https://app.cochat.ai/papers/10.1145/1276958.1277190
- The paper
- Deb, K., Sindhya, K., & Okabe, T. (2007). Self-adaptive simulated binary crossover for real-parameter optimization. Proceedings of the 9th annual conference on Genetic and evolutionary computation. https://doi.org/10.1145/1276958.1277190
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.