The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Analysing mutation schemes for real-parameter genetic algorithms
Abstract
Mutation is an important operator in genetic algorithms (GAs), as it ensures maintenance of diversity in evolving populations of GAs. Real-parameter GAs (RGAs) handle real-valued variables directly without going to a binary string representation of variables. Although RGAs were first suggested in early ‘90s, the mutation operator is still implemented variable-wise – in a manner that is independent to each variable. In this paper, we investigate the effect of five different mutation schemes for RGAs using two different mutation operators – polynomial and Gaussian mutation operators. Based on extensive simulation studies, it is observed that amutation clock implementation is computationally quick and also efficient in finding a solution close to the optimum on four different problems used in this study for both mutation operators. Moreover, parametric studies with their associated parameters reveal suitable working ranges of the parameters. Interestingly, both mutation operators with their respective optimal parameter settings are found to possess a similar inherent probability of offspring creation, a matter that is believed to be the reason for their superior working. This study signifies that the long suggested mutation clock operator should be considered as a valuable mutation operator for RGAs.
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 in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
Self-citationNo 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
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Self-citationReal-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
Schaffer, J. D., Caruana, R. A., Eshelman, L. J., & Das, R. (1989) · international conference on Genetic algorithms · Cited by 896
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
Pymoo: Multi-Objective Optimization in Python
Blank, J., & Deb, K. (2020) · IEEE Access · doi:10.1109/access.2020.2990567 · Cited by 2,344
Self-citation
Metadata
- Authors
- Deb, K., & Deb, A.
- Venue
- International Journal of Artificial Intelligence and Soft Computing
- Publisher
- Inderscience Publishers
- Published
- 2014
- Volume
- 4
- Issue
- 1
- Pages
- 1
- ISSN
- 1755-4950 (ISSN-L)
- 1755-4969
- OpenAlex
- W2114934447
- Cited by
- 283
- References
- 13
- FWCI
- 11.22
- 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: Analysing mutation schemes for real-parameter genetic algorithms. https://app.cochat.ai/papers/10.1504/ijaisc.2014.059280
- The paper
- Deb, K., & Deb, A. (2014). Analysing mutation schemes for real-parameter genetic algorithms. International Journal of Artificial Intelligence and Soft Computing. https://doi.org/10.1504/ijaisc.2014.059280
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.