The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Discrete cuckoo search algorithm for the travelling salesman problem
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
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
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Cuckoo Search via Lévy flights
Yang, X.-S., & Deb, S. (2009) · 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393690 · Cited by 6,185
Self-citationA New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
Self-citationFirefly Algorithms for Multimodal Optimization
Yang, X.-S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04944-6_14 · Cited by 4,075
Self-citation(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Cited by
Monarch butterfly optimization
Wang, G.-G., Deb, S., & Cui, Z. (2019) · Neural Computing and Applications · doi:10.1007/s00521-015-1923-y · Cited by 983
Nature-inspired optimization algorithms: Challenges and open problems
Yang, X.-S. (2020) · Journal of Computational Science · doi:10.1016/j.jocs.2020.101104 · Cited by 429
Self-citationMoth–flame optimization algorithm: variants and applications
Shehab, M., Abualigah, L., Al Hamad, H., Alabool, H., Alshinwan, M., & Khasawneh, A. M. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04570-6 · Cited by 316
Lower bounds on circuit depth of the quantum approximate optimization algorithm
Herrman, R., Ostrowski, J., Humble, T. S., & Siopsis, G. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03001-7 · Cited by 35
Meta-heuristics meet sports: A systematic review from the viewpoint of nature-inspired algorithms
Ariyaratne, M. K. A., & Silva, R. M. (2022) · International Journal of Computer Science in Sport · doi:10.2478/ijcss-2022-0003 · Cited by 19
Metadata
- Authors
- Ouaarab, A., Ahiod, B., & Yang, X.-S.
- Venue
- Neural Computing and Applications
- Published
- 2013-04-11
- Volume
- 24
- Issue
- 7-8
- Pages
- 1659-1669
- ISSN
- 0941-0643 (ISSN-L)
- 1433-3058
- OpenAlex
- W1975671633
- Cited by
- 454
- References
- 34
- FWCI
- 34.23
- 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: Discrete cuckoo search algorithm for the travelling salesman problem. https://app.cochat.ai/papers/10.1007/s00521-013-1402-2
- The paper
- Ouaarab, A., Ahiod, B., & Yang, X.-S. (2014). Discrete cuckoo search algorithm for the travelling salesman problem. Neural Computing and Applications. https://doi.org/10.1007/s00521-013-1402-2
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.
