The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Cuckoo search: recent advances and applications
Open accessAbstract
Cuckoo search (CS) is a relatively new algorithm, developed by Yang and Deb in 2009, and the same has been found to be efficient in solving global optimization problems. In this paper, we review the fundamental ideas of cuckoo search and the latest developments as well as its applications. We analyze the algorithm and gain insight into its search mechanisms and find out why it is efficient. We also discuss the essence of algorithms and its link to self-organizing systems, and finally, we propose some important topics for further research.
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
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
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-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-citationKennedy, J. (2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_630 · Cited by 2,989
Firefly algorithm, stochastic test functions and design optimisation
Yang, X. S. (2010) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2010.032124 · Cited by 2,729
Self-citationCuckoo search algorithm: a metaheuristic approach to solve structural optimization problems
Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2013) · Engineering with Computers · doi:10.1007/s00366-011-0241-y · Cited by 2,257
Self-citationEngineering Optimization: An Introduction with Metaheuristic Applications
Yang, X. (2010) · Wiley eBooks · doi:10.1002/9780470640425 · Cited by 1,248
Self-citationBat algorithm: a novel approach for global engineering optimization
Yang, X., & Gandomi, A. H. (2012) · Middlesex University Research Repository (Middlesex University Of London) · Cited by 1,057
Self-citation
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
Self-citationA survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Metaheuristic research: a comprehensive survey
Hussain, K., Mohd Salleh, M. N., Cheng, S., & Shi, Y. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9605-z · Cited by 864
Wang, G.-G., Deb, S., & Coelho, L. D. S. (2015) · 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI) · doi:10.1109/iscbi.2015.8 · Cited by 672
Self-citationBio inspired computing – A review of algorithms and scope of applications
Kar, A. K. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.04.018 · Cited by 578
Metadata
- Authors
- Yang, X.-S., & Deb, S.
- Venue
- Neural Computing and Applications
- Published
- 2013-03-09
- Volume
- 24
- Issue
- 1
- Pages
- 169-174
- ISSN
- 0941-0643 (ISSN-L)
- 1433-3058
- OpenAlex
- W1970204203
- Cited by
- 1,066
- References
- 23
- FWCI
- 61.10
- Type
- journal article
- Language
- en
- Open access
- green
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: Cuckoo search: recent advances and applications. https://app.cochat.ai/papers/10.1007/s00521-013-1367-1
- The paper
- Yang, X.-S., & Deb, S. (2014). Cuckoo search: recent advances and applications. Neural Computing and Applications. https://doi.org/10.1007/s00521-013-1367-1
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.