Abstract:
The Crow Search Algorithm (CSA) is a swarm-based metaheuristic algorithm that simulates the intelligent foraging behaviors of crows. While CSA effectively handles global optimization problems, it suffers from certain limitations, such as low search accuracy and a tendency to converge to local optima. To address these shortcomings, researchers have proposed modifications and enhancements to CSA’s search mechanism. One widely explored approach is the structured population mechanism, which maintains diversity during the search process to mitigate premature convergence. The island model, a common structured population method, divides the population into smaller independent sub-populations called islands, each running in parallel. Migration, the primary technique for promoting population diversity, facilitates the exchange of relevant and useful information between islands during iterations. This paper introduces an enhanced variant of CSA, called Enhanced CSA (ECSA), which incorporates the cooperative island model (iECSA) to improve its search capabilities and avoid premature convergence. The proposed iECSA incorporates two enhancements to CSA. Firstly, an adaptive tournament-based selection mechanism is employed to choose the guided solution. Secondly, the basic random movement in CSA is replaced with a modified operator to enhance exploration. The performance of iECSA is evaluated on 53 real-valued mathematical problems, including 23 classical benchmark functions and 30 IEEE-CEC2014 benchmark functions. A sensitivity analysis of key iECSA parameters is conducted to understand their impact on convergence and diversity. The efficacy of iECSA is validated by conducting an extensive evaluation against a comprehensive set of well-established and recently introduced meta-heuristic algorithms, encompassing a total of seventeen different algorithms. Significant differences among these comparative algorithms are established utilizing statistical tests like Wilcoxon’s rank-sum and Friedman’s tests. Experimental results demonstrate that iECSA outperforms the fundamental ECSA algorithm on 82.6% of standard test functions, providing more accurate and reliable outcomes compared to other CSA variants. Furthermore, Extensive experimentation consistently showcases that the iECSA outperforms its comparable algorithms across a diverse set of benchmark functions.
