2017 | OriginalPaper | Chapter
10. Cuckoo Search Optimization
Abstract
In this chapter, a metaheuristic method so-called cuckoo search (CS) algorithm is utilized to determine optimum design of structures for both discrete and continuous variables. This algorithm is recently developed by Yang [1] and Yang and Deb [2, 3], and it is based on the obligate brood parasitic behavior of some cuckoo species together with the Lévy flight behavior of some birds and fruit flies. The CS is a population-based optimization algorithm and, similar to many other metaheuristic algorithms, starts with a random initial population which is taken as host nests or eggs. The CS algorithm essentially works with three components: Selection of the best by keeping the best nests or solutionsReplacement of the host eggs with respect to the quality of the new solutions or cuckoo eggs produced based randomization via Lévy flights globally (exploration)Discovering of some cuckoo eggs by the host birds and replacing according to the quality of the local random walks (exploitation) [2]
