The DOI matches its Crossref record; 97 of the 97 references it cites were found in a registry or an index.
A Gentle Introduction to Memetic Algorithms
Abstract
'A Gentle Introduction to Memetic Algorithms' published in 'Handbook of Metaheuristics'
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Axelrod, R., & Hamilton, W. D. (1981) · Science · doi:10.1126/science.7466396 · Cited by 20,065
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
(1976) · Cited by 10,423
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Development and validation of a genetic algorithm for flexible docking 1 1Edited by F. E. Cohen
Jones, G., Willett, P., Glen, R. C., Leach, A. R., & Taylor, R. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0897 · Cited by 6,763
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Cited by
Fesanghary, M., Mahdavi, M., Minary-Jolandan, M., & Alizadeh, Y. (2008) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2008.02.006 · Cited by 327
Cruz-Ramírez, M., Hervás-Martínez, C., Fernández, J. C., Briceño, J., & de la Mata, M. (2013) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2013.02.004 · Cited by 79
Finding low autocorrelation binary sequences with memetic algorithms
Gallardo, J. E., Cotta, C., & Fernández, A. J. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.03.005 · Cited by 59
Self-citation
Metadata
- Authors
- Moscato, P., & Cotta, C.
- Venue
- International Series in Operations Research & Management Science
- Publisher
- Kluwer Academic Publishers
- Published
- 2006-02-02
- Pages
- 105-144
- OpenAlex
- W27366642
- Cited by
- 457
- References
- 97
- FWCI
- 43.35
- Type
- book chapter
- 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: A Gentle Introduction to Memetic Algorithms. https://app.cochat.ai/papers/10.1007/0-306-48056-5_5
- The paper
- Moscato, P., & Cotta, C. (2006). A Gentle Introduction to Memetic Algorithms. International Series in Operations Research & Management Science. https://doi.org/10.1007/0-306-48056-5_5
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.
