The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
CROSSOVER OPERATORS IN GENETIC ALGORITHMS: A REVIEW
Open accessAbstract
The performance of Genetic Algorithm (GA) depends on various operators. Crossover operator is one of them. Crossover operators are mainly classified as application dependent crossover operators and application independent crossover operators. Effect of crossover operators in GA is application as well as encoding dependent. This paper will help researchers in selecting appropriate crossover operator for better results. The paper contains description about classical standard crossover operators, binary crossover operators, and application dependant crossover operators. Each crossover operator has its own advantages and disadvantages under various circumstances. This paper reviews the crossover operators proposed and experimented by various researchers.
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
Genetic Algorithms for the Traveling Salesman Problem
Grefenstette, J. J., Gopal, R., Rosmaita, B. J., et al. (1985) · international conference on Genetic algorithms · Cited by 731
Applying adaptive algorithms to epistatic domains
Davis, L. D. (1985) · International Joint Conference on Artificial Intelligence · Cited by 642
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Whitley, L. D., Starkweather, T., & Fuquay, D. (1989) · international conference on Genetic algorithms · Cited by 551
Schedule Optimization Using Genetic Algorithms
Syswerda, G. (1991) · Medical Entomology and Zoology · Cited by 494
Self-adaptive simulated binary crossover for real-parameter optimization
Deb, K., Sindhya, K., & Okabe, T. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277190 · Cited by 338
Multi-parent recombination with simplex crossover in real coded genetic algorithms
Tsutsui, S., Yamamura, M., & Higuchi, T. (1999) · Tokyo Tech Research Repository (Tokyo Institute of Technology) · Cited by 319
Kita, H., Ono, I., & Kobayashi, S. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.782672 · Cited by 122
Designer Genetic Algorithms: Genetic Algorithms in Structure Design.
Louis, S. J., & Rawlins, G. J. E. (1991) · Cited by 118
Orgy in the computer: Multi-parent reproduction in genetic algorithms
Eiben, A. E., van Kemenade, C. H. M., & Kok, J. N. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59496-5_354 · Cited by 95
Depth-dependent crossover for genetic programming
Ito, T., Iba, H., & Sato, S. (2002) · doi:10.1109/icec.1998.700150 · Cited by 43
Cited by
A review on genetic algorithm: past, present, and future
Katoch, S., Chauhan, S. S., & Kumar, V. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10139-6 · Cited by 4,655
Novel designs of blade mixer impellers from the discrete element method and topology optimization
Castro, M. T., & Ocon, J. D. (2024) · Chemical Engineering Journal · doi:10.1016/j.cej.2024.151863 · Cited by 14
Metadata
- Authors
- Walchand College of Engineering, I., A.J., U., P.D., S., & Government College of Engineering, K.
- Venue
- ICTACT Journal on Soft Computing
- Publisher
- ICT Academy
- Published
- 2015-10-01
- Volume
- 6
- Issue
- 1
- Pages
- 1083-1092
- ISSN
- 0976-6561 (ISSN-L)
- 2229-6956
- OpenAlex
- W2376557535
- Cited by
- 363
- References
- 13
- FWCI
- 10.01
- Type
- journal article
- Language
- en
- Open access
- diamond
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: CROSSOVER OPERATORS IN GENETIC ALGORITHMS: A REVIEW. https://app.cochat.ai/papers/10.21917/ijsc.2015.0150
- The paper
- Walchand College of Engineering, I., A.J., U., P.D., S., & Government College of Engineering, K. (2015). CROSSOVER OPERATORS IN GENETIC ALGORITHMS: A REVIEW. ICTACT Journal on Soft Computing. https://doi.org/10.21917/ijsc.2015.0150
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.