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], Yang and Deb [2, 3], and it is based on the obligate brood parasitic behavior of some cuckoo species together with the Levy flight behavior of some birds and fruit flies. The CS is a population based optimization algorithm and similar to many others 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 solutions; replacement of the host eggs with respect to the quality of the new solutions or Cuckoo eggs produced based randomization via Levy flights globally (exploration); and discovering of some cuckoo eggs by the host birds and replacing according to the quality of the local random walks (exploitation) [2].