Towards the improvement of Cuckoo search algorithm

Author

Soneji, H. ; Sanghvi, R.C.

Author_Institution

Dept. of Math., G.H. Patel Coll. of Eng. & Technol., Vallabh Vidyanagar, India

fYear

2012

fDate

Oct. 30 2012-Nov. 2 2012

Firstpage

878

Lastpage

883

Abstract

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.

Keywords

nonlinear functions; nonlinear programming; random number generation; random processes; search problems; Levy flights; Mantegna algorithm; McCulloch algorithm; cuckoo search algorithm; nonlinear function optimization; optimization; random number generation; rejection algorithm; symmetric Levy distribution; Algorithm design and analysis; Benchmark testing; Birds; Optimization; Search problems; Sociology; Vectors; Cuckoo search; L´evy flights; Mantegna´s algorithm; McCulloch´s algorithm; optimization; random number generation;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Communication Technologies (WICT), 2012 World Congress on

Conference_Location

Trivandrum

Print_ISBN

978-1-4673-4806-5

Type

conf

DOI

10.1109/WICT.2012.6409199

Filename

6409199