Towards the Improvement of Cuckoo Search Algorithm

Abstract

Cuckoo search algorithm via Lévy flights by Xin-She Yang and Saush Deb [1] for optimizing a nonlinear function uses generation of random numbers with symmetric Lévy distribution obtained by Mantegna’s algorithm. However, instead of using the original algorithm, itssimplified version is used to generate Lévy flights during the Cuckoo Search algorithm [2].A paper by MatteoLeccardi [3] describes three algorithms,namely, Mantegna’s algorithm, rejection algorithmand McCulloch’s algorithm to generate such random numbers and claims thatMcCulloch’s algorithm outperforms the other two. The idea in this paper is to compare the performance of Mantegna’s algorithm, its simplified version, and McCulloch’s algorithm when each of them is incorporated in Cuckoo search algorithm to generate Lévy flights [4].Moreover, a term similar to the Local Best component of PSO is added in updating the population while implementing the CS algorithm using simplified version of Mantegna’s algorithm and the results are analyzed. Some other implementation oriented changes are also incorporated and their effect is studied.