# Cuckoo Search: Recent Advances and Applications

arXiv: https://arxiv.org/abs/1408.5316 · HTML: https://mlsanity.com/paper/1408.5316/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Aug 2014.

## Built on by (most cited first, 3 of 3)

- [Performance assessment and exhaustive listing of 500+ nature inspired metaheuristic algorithms](https://mlsanity.com/paper/2212.09479/) (2022)
- [Biclustering Algorithms Based on Metaheuristics: A Review](https://mlsanity.com/paper/2203.16241/) (2022)
- [Optimizing Readability Using Genetic Algorithms](https://mlsanity.com/paper/2301.00374/) (2023)

## Abstract (arXiv)

Cuckoo search (CS) is a relatively new algorithm, developed by Yang and Deb in 2009, and CS is 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.