Aug 2026· Biomimetics· Vol 11, pp. 567· 0 citations· 47 references
Medicine
TL;DR
The numerical and engineering test results demonstrate that CMSCSO provides high optimization accuracy, strong stability, and good adaptability to complex engineering problems, and can serve as an effective solution method for optimization tasks in structural design, mechanical engineering, and other related fields.
Abstract
Sand Cat Swarm Optimization (SCSO) is a swarm intelligence algorithm characterized by a simple structure and a small number of control parameters. However, when solving complex optimization problems, SCSO suffers from several limitations, including an uneven initial population distribution, excessive dependence on the current best individual during the search process, insufficient local exploitation accuracy, and susceptibility to local optima. To address these limitations, a Collaborative Multi-Strategy Sand Cat Swarm Optimization algorithm (CMSCSO) is proposed. The good point set method is adopted to generate a uniformly distributed initial population. An adaptive random reuse strategy is designed to selectively inherit dimensional information from the best individual according to differences in individual fitness. A prey impatience coefficient is introduced to dynamically adjust the local search intensity according to the distance between the population and the current best solution. In addition, a refractive-mechanism-based opposition-based learning strategy for the worst individuals is incorporated to update low-quality individuals and improve the ability of the algorithm to escape from local optima. CMSCSO was evaluated using the 30-dimensional CEC2017 and 10-dimensional CEC2022 benchmark suites. Its performance was compared with that of SCSO and several recently developed metaheuristic algorithms. The experimental results show that CMSCSO achieved the best mean values on 24 of the 29 CEC2017 benchmark functions and on 10 of the 12 CEC2022 benchmark functions. In the Wilcoxon tests conducted on CEC2017 and CEC2022, CMSCSO achieved 220 and 90 statistically significant wins, respectively. It also ranked first in the Friedman tests for both benchmark suites. For engineering optimization problems, the results obtained from six types of engineering design problems demonstrate that CMSCSO can consistently obtain high-quality feasible solutions that satisfy the specified constraints. In two-dimensional and three-dimensional wireless sensor network coverage optimization problems, coverage rates of 96.30% and 89.54% were achieved. For photovoltaic model parameter identification, CMSCSO achieved the highest identification accuracy. The numerical and engineering test results demonstrate that CMSCSO provides high optimization accuracy, strong stability, and good adaptability to complex engineering problems. It can therefore serve as an effective solution method for optimization tasks in structural design, mechanical engineering, and other related fields.
Experimental results demonstrate that the proposed Multi-swarm Collaborative Particle Swarm Optimization with Adaptive Learning Strategy with Adaptive Learning Mechanism exhibits significant advantages in convergence speed, solving accuracy, and comprehensive optimization capabilities compared with several state-of-the...
An enhanced sand cat swarm algorithm (ESC-SCSA) is developed and comprehensively evaluated through sensitivity analysis, ablation studies, convergence analysis, and statistical significance tests, demonstrating its effectiveness and potential generalization capability across both continuous and discrete optimization pr...
wirawati dewi ahmad, Azuraliza Abu Bakar, Mohd Nor Akmal Khalid· Engineering Research Express· 0 citations
The crayfish optimization algorithm (COA) is competitive in solving continuous optimization problems, but its performance deteriorates in high-dimensional and multimodal environments because random initialization may provide uneven population coverage, exploration relies excessively on the current best solution, and ex...
Bo Jin, Wei-Min Wang· Science and innovation· 0 citations
The Narwhal Optimization Algorithm is a recent swarm metaheuristic that, like most population-based optimisers, is prone to premature convergence, is sensitive to random initialisation, and relies on a rigid, schedule-driven exploration–exploitation balance. This paper develops and rigorously evaluates two enhanced v...
A. Al Tawil, S. Z. Hashim, Hanaa Fathi et al.· Scientific Reports· 0 citations
Traditional particle swarm optimization (PSO) easily falls into premature convergence, while differential evolution (DE) is highly sensitive to fixed control parameters. Existing PSO-DE hybrid frameworks suffer from static population sizes and insufficient cross-population information exchange. This paper proposes PSO-...
Yao-Pei Wang, Yufeng Wang, Ke Liu· Algorithms· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.