The cuckoo search (CS) algorithm is a population-based algorithm, and its convergence is usually higher, even for potentially higher-dimensional problems. The algorithm is stable and robust, and has been applied in various applications. This chapter introduces the fundamentals of the standard cuckoo search algorithm with detailed descriptions of the main steps. Some demo codes in both Matlab and C++ are provided. Discussions of the efficient generation of L'evy flights are also given with examples.
Discussion(0)
No comments yet. Be the first to comment.