¹College of Computer, Hunan Science & Technology Economy Trade Vocation College, Hengyang, China
²College of Information Science and Engineering, Hunan University, Changsha, China
³Logistics Information Dept., Hunan Vocational College of Modern Logistics, Changsha, China
³College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing, China

---

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.

Index Terms—chaos, cuckoo search, lévy flight, highdimensional function, optimization

[PDF]

Cite: Aijia Ouyang, Guo Pan, Guangxue Yue, and Jiayi Du, "Chaotic Cuckoo Search Algorithm for Highdimensional Functions," Journal of Computers vol. 9, no. 5, pp. 1282-1290, 2014.