The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An adaptive Cuckoo search algorithm for optimisation
Open accessAbstract
Cuckoo search is one of many nature-inspired algorithms used extensively to solve optimisation problems in different fields of engineering. It is a very effective in solving global optimisation because it is able to maintain balance between local and global random walks using switching parameter. The switching parameter for the original Cuckoo search algorithm is fixed at 25% and not enough studies have been done to assess the impact of dynamic switching parameter on the performance of Cuckoo search algorithm. This paper’s contribution is the development of three new Cuckoo search algorithms based on dynamically increasing switching parameters. The three new Cuckoo search algorithms are validated on ten mathematical test functions and their results compared to those of Cuckoo search algorithms with constant and dynamically decreasing switching parameters respectively. Finally, the simulations in this study indicate that, the Cuckoo search algorithm with exponentially increasing switching parameter outperformed the other Cuckoo search algorithms.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
A 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
Nature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
Nature-Inspired Optimization Algorithms
(2014) · Nature-Inspired Optimization Algorithms · doi:10.1016/b978-0-12-416743-8.00016-6 · Cited by 705
Kefayat, M., Lashkar Ara, A., & Nabavi Niaki, S. A. (2015) · Energy Conversion and Management · doi:10.1016/j.enconman.2014.12.037 · Cited by 401
Particle Swarm Optimization: Technique, System and Challenges
Palupi Rini, D., Mariyam Shamsuddin, S., & Sophiyati Yuhaniz, S. (2011) · International Journal of Computer Applications · doi:10.5120/1810-2331 · Cited by 390
A Collective Neurodynamic Approach to Constrained Global Optimization
Yan, Z., Fan, J., & Wang, J. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2524619 · Cited by 165
Empirical Review of Standard Benchmark Functions Using Evolutionary Global Optimization
Dieterich, J. M., & Hartke, B. (2012) · Applied Mathematics · doi:10.4236/am.2012.330215 · Cited by 132
Proximity Without Consensus in Online Multiagent Optimization
Koppel, A., Sadler, B. M., & Ribeiro, A. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2686368 · Cited by 73
Metadata
- Authors
- Mareli, M., & Twala, B.
- Venue
- Applied Computing and Informatics
- Publisher
- Emerald
- Published
- 2018-07
- Volume
- 14
- Issue
- 2
- Pages
- 107-115
- ISSN
- 2210-8327 (ISSN-L)
- OpenAlex
- W2753354457
- Cited by
- 347
- References
- 16
- FWCI
- 15.91
- 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: An adaptive Cuckoo search algorithm for optimisation. https://app.cochat.ai/papers/10.1016/j.aci.2017.09.001
- The paper
- Mareli, M., & Twala, B. (2018). An adaptive Cuckoo search algorithm for optimisation. Applied Computing and Informatics. https://doi.org/10.1016/j.aci.2017.09.001
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.