Chaotic Cuckoo Search Algorithm for High-dimensional Functions

Abstract

Given that the basic cuckoo search algorithm is vulnerable to local optimum and unsatisfactory calculation precision, chaotic operator (CO), employed as local algorism to optimize elitist individuals in the population, can effectively enhance the properties of cuckoo search (CS) algorithm. Tested by 15 benchmark high-dimensional functions, the experiment result indicates that chaotic cuckoo search (CCS) algorithm can increase the calculation precision and step up the convergent speed with improved robustness, which can be applied to other engineering optimization problems.