Multiple chaotic cuckoo search algorithm

Abstract

Cuckoo search algorithm (CSA) is a nature-inspired metaheuristic based on the obligate brood parasitic behavior of cuckoo species, and it has shown promising performance in solving optimization problems. Chaotic mechanisms have been incorporated into CSA to utilize the dynamic properties of chaos, aiming to further improve its search performance. However, in the previously proposed chaotic cuckoo search algorithms (CCSA), only one chaotic map is utilized in a single search iteration which limited the exploitation ability of the search. In this study, we consider to utilize multiple chaotic maps simultaneously to perform the local search within the neighborhood of the global best solution found by CSA. To realize this, three kinds of multiple chaotic cuckoo search algorithms (MCCSA) are proposed by incorporating several chaotic maps into the chaotic local search parallelly, randomly or selectively. The performance of MCCSA is verified based on 48 widely used benchmark optimization functions. Experimental results reveal that MCCSAs generally perform better than CCSAs, and the MCCSA-P which parallelly utilizes chaotic maps performs the best among all 16 compared variants of CSAs.