Evidence map›Paper›PMID 42645284›Full record

ArticleBiomimetics (Basel, Switzerland)2026

Prey-Impatience-Driven Sand Cat Swarm Optimization with Perturbation Learning for Global Optimization and Engineering Applications.

Jiawen Wang, Jiayue Cai, Xuefei Xie, Yang Shen, Fanxing Meng, Yanxiu Yu, Dongman Cao

Abstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Jiawen WangSchool of Electronic Engineering and Automation, Dalian University of Engineering, Dalian 116102, China.
Jiayue CaiZhan Tianyou College, Dalian Jiaotong University, Dalian 116102, China.
Xuefei XieZhan Tianyou College, Dalian Jiaotong University, Dalian 116102, China.
Yang ShenZhan Tianyou College, Dalian Jiaotong University, Dalian 116102, China.
Fanxing MengSchool of Electronic Engineering and Automation, Dalian University of Engineering, Dalian 116102, China.
Yanxiu YuSchool of Electronic Engineering and Automation, Dalian University of Engineering, Dalian 116102, China.
Dongman CaoFaculty of Electrical and Control Engineering, Liaoning Technical University, Fuxin 125105, China.

Funding

the General Project of Education Department of Liaoning Province LJ212413198003the General Project of Education Department of Liaoning Province LJKMZ20222044
6 · The paper itself

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.

Indexed as

benchmark test functionsengineering design problemsgood point setimpatience coefficientopposition-based learningrandom reusesand cat swarm optimization

Identifiers

PMID42645284
PMCPMC13509936

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.