Towards the improvement of Cuckoo search algorithm

Cuckoo search algorithm via L´evy flights by Xin-She Yang and Saush Deb [1] for optimizing a nonlinear function uses generation of random numbers with symmetric L´evy distribution obtained by Mantegna´s algorithm. However, instead of using the original algorithm, they have used a simplified version to generate L´evy flights during the Cuckoo search algorithm [2]. Also, apaper by MatteoLeccardi [3] describes three algorithms to generate such random numbers and claims that McCulloch´s algorithm is outperforming the other two, namely, Mantegna´s algorithm and rejection algorithm. The idea in this paper is to compare and see if the Cuckoo Search algorithm shows any improvement in the performance in three cases when the simplified version algorithm, Mantegna´s algorithm and McCulloch´s algorithm each of them is included in Cuckoo Search algorithm to generate L´evy flights.