article · Artificial Intelligence Review
Abstract Optimization algorithms play a crucial role in solving complex challenges across various fields, including engineering, finance, and data science. This study introduces a novel hybrid optimization algorithm, the Hybrid Crayfish Optimization Algorithm with Differential Evolution (HCOADE), which addresses the limitations of premature convergence and inadequate exploitation in the traditional Crayfish Optimization Algorithm (COA). By integrating COA with Differential Evolution (DE) strategies, HCOADE leverages DE’s mutation and crossover mechanisms to enhance global optimization performance. The COA, inspired by the foraging and social behaviors of crayfish, provides a flexible framework for exploring the solution space, while DE’s robust strategies effectively exploit this space. To evaluate HCOADE’s performance, extensive experiments are conducted using 34 benchmark functions from CEC 2014 and CEC 2017, as well as six engineering design problems. The results are compared with ten leading optimization algorithms, including classical COA, Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Moth-flame Optimization (MFO), Salp Swarm Algorithm (SSA), Reptile Search Algorithm (RSA), Sine Cosine Algorithm (SCA), Constriction Coefficient-Based Particle Swarm Optimization Gravitational Search Algorithm (CPSOGSA), and Biogeography-based Optimization (BBO). The average rankings and results from the Wilcoxon Rank Sum Test provide a comprehensive comparison of HCOADE’s performance, clearly demonstrating its superiority. Furthermore, HCOADE’s performance is assessed on the CEC 2020 and CEC 2022 test suites, further confirming its effectiveness. A comparative analysis against notable winners from the CEC competitions, including LSHADEcnEpSin, LSHADESPACMA, and CMA-ES, using the CEC-2017 test suite, revealed superior results for HCOADE. This study underscores the advantages of integrating DE strategies with COA and offers valuable insights for addressing complex global optimization problems.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1007/s10462-024-11069-7
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.