Cuckoo catfish optimizer: a new meta-heuristic optimization algorithm

Abstract

A new meta-heuristic algorithm, Cuckoo Catfish Optimizer (CCO), is proposed for numerical optimization problems. It simulates the search, predation, and parasitic behavior observed in cichlids. Early iterations of the algorithm focus on executing a multidimensional enveloping search strategy and a compressed space strategy, combined with an auxiliary search strategy to efectively limit the escape space of cichlids. This phase ensures extensive exploration of the solution space. In the intermediate stage of iteration, the algorithm uses a transition strategy to promote a smooth transition from exploration to exploitation, endowing the algorithm with both a certain degree of exploration capability and exploitation capability. In later stages, the algorithm uses chaotic predation mechanisms to create disturbances around cichlids to improve the exploitation of optimal solutions. Throughout the entire optimization process, the guidance, parasitism, and death mechanisms of individuals are integrated, allowing individuals to adjust their positions in real-time and improve the overall convergence accuracy. This paper rigorously evaluates the performance of CCO through 23 classic test functions and three CEC test suites. The experimental results show that compared with 11 famous algorithms and 10 novel improved algorithms, CCO can obtain the optimal solution in 91.52% of the test functions, demonstrating its excellent ability in solving various numerical optimization problems. Additionally, through the successful application to 6 mechanical optimization problems, 3 photovoltaic cell parameter optimization problems, and 1 path opti- mization problem, the competitiveness of CCO in solving real-world problems is verified and highlighted. The CCO source code can be downloaded here: https://ww2.mathworks.cn/matlabcentral/fileexchange/176828-cuckoo-catfish-optimizer-a-new-meta-heuristic-optimization