Lin Wenzhou, He Yinghao, Hu Gang, Zhang Chunqiang
School of Art and Design, Xi'an University of Technology, Xi'an 710054, China.
Department of Applied Mathematics, Xi'an University of Technology, Xi'an 710054, China.
Biomimetics (Basel). 2025 May 21;10(5):343. doi: 10.3390/biomimetics10050343.
In order to solve problems with the original crayfish optimization algorithm (COA), such as reduced diversity, local optimization, and insufficient convergence accuracy, a multi-strategy optimization algorithm for crayfish based on differential evolution, named the ICOA, is proposed. First, the elite chaotic difference strategy is used for population initialization to generate a more uniform crayfish population and increase the quality and diversity of the population. Secondly, the differential evolution strategy and the dimensional variation strategy are introduced to improve the quality of the crayfish population before its iteration and to improve the accuracy of the optimal solution and the local search ability for crayfish at the same time. To enhance the updating approach to crayfish exploration, the Levy flight strategy is adopted. This strategy aims to improve the algorithm's search range and local search capability, prevent premature convergence, and enhance population stability. Finally, the adaptive parameter strategy is introduced to improve the development stage of crayfish, so as to better balance the global search and local mining ability of the algorithm, and to further enhance the optimization ability of the algorithm, and the ability to jump out of the local optimal. In addition, a comparison with the original COA and two sets of optimization algorithms on the CEC2019, CEC2020, and CEC2022 test sets was verified by Wilcoxon rank sum test. The results show that the proposed ICOA has strong competition. At the same time, the performance of ICOA is tested against different high-performance algorithms on 6 engineering optimization examples, 30 high-low-dimension constraint problems and 2 large-scale NP problems. Numerical experiments results show that ICOA has superior performance on a range of engineering problems and exhibits excellent performance in solving complex optimization problems.
为了解决原始小龙虾优化算法(COA)存在的多样性降低、局部优化以及收敛精度不足等问题,提出了一种基于差分进化的小龙虾多策略优化算法,即ICOA。首先,采用精英混沌差分策略进行种群初始化,以生成更均匀的小龙虾种群,提高种群质量和多样性。其次,引入差分进化策略和维度变异策略,在小龙虾种群迭代前提高其质量,同时提高最优解的精度和小龙虾的局部搜索能力。为增强小龙虾探索的更新方式,采用莱维飞行策略。该策略旨在扩大算法的搜索范围和局部搜索能力,防止早熟收敛,增强种群稳定性。最后,引入自适应参数策略来改进小龙虾的发展阶段,以便更好地平衡算法的全局搜索和局部挖掘能力,进一步增强算法的优化能力以及跳出局部最优的能力。此外,通过威尔科克森秩和检验,在CEC2019、CEC2020和CEC2022测试集上与原始COA和两组优化算法进行了比较。结果表明,所提出的ICOA具有很强的竞争力。同时,在6个工程优化实例、30个高低维约束问题和2个大规模NP问题上,针对不同的高性能算法对ICOA的性能进行了测试。数值实验结果表明,ICOA在一系列工程问题上具有优异的性能,在解决复杂优化问题方面表现出色。