A novel enhanced cuckoo search algorithm for global optimization

Abstract

Cuckoo search algorithm (CS) is an excellent nature-inspired algorithm that has been widely introduced to solve complex, multi-dimensional global optimization problems. However, the traditional CS algorithm has a low convergence speed and a poor balance between exploration and exploitation. In other words, the single search strategy of CS may make it easier to trap into local optimum and end in premature convergence. In this paper, we proposed a new variant of CS called Novel Enhanced CS Algorithm (NECSA) to overcome these drawbacks mentioned above inspired by the cuckoos’ behaviors in nature and other excellent search strategies employed in intelligent optimization algorithms. NECSA introduces several enhancement strategies, namely self-evaluation operation and modified greedy selection operation, to improve the searchability of the original CS algorithm. The former is proposed to enhance the exploration ability and ensure population diversity, and the latter is employed to enhance the exploitation ability and increase search efficiency. Besides, we introduced adaptive control parameter settings based on the fitness and iteration number to increase the convergence speed and the accuracy of the search process. The experimental results and analysis on the CEC2014 test have demonstrated the reliable performance of NECSA in comparison with the other five CS algorithm variants.