Evidence map›Paper›PMID 41002845›Full record

ArticleBiomimetics (Basel, Switzerland)2025

An Improved Greater Cane Rat Algorithm with Adaptive and Global-Guided Mechanisms for Solving Real-World Engineering Problems.

Yepei Chen, Zhangzhi Tian, Kaifan Zhang, Feng Zhao, Aiping Zhao

Abstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing 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

2 citing papers in PubMed.

  1. Article
  2. Article
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

5 authors.

Yepei ChenSchool of Computer Science, Hubei University of Technology, Wuhan 430068, China.ORCID 0000-0002-2877-5065
Zhangzhi TianSchool of Computer Science, Hubei University of Technology, Wuhan 430068, China.
Kaifan ZhangSchool of Computer Science, Hubei University of Technology, Wuhan 430068, China.ORCID 0009-0002-9381-0987
Feng ZhaoNetwork Information Center, Shijiazhuang University, Shijiazhuang 050035, China.
Aiping ZhaoSchool of Journalism & Communication, Shijiazhuang University, Shijiazhuang 050035, China.

Funding

the subject of Human Resources and Social Security in Hebei Province JRSHZ-2025-01126
6 · The paper itself

Abstract

This study presents an improved variant of the greater cane rat algorithm (GCRA), called adaptive and global-guided greater cane rat algorithm (AGG-GCRA), which aims to alleviate some key limitations of the original GCRA regarding convergence speed, solution precision, and stability. GCRA simulates the foraging behavior of the greater cane rat during both mating and non-mating seasons, demonstrating intelligent exploration capabilities. However, the original algorithm still faces challenges such as premature convergence and inadequate local exploitation when applied to complex optimization problems. To address these issues, this paper introduces four key improvements to the GCRA: (1) a global optimum guidance term to enhance the convergence directionality; (2) a flexible parameter adjustment system designed to maintain a dynamic balance between exploration and exploitation; (3) a mechanism for retaining top-quality solutions to ensure the preservation of optimal results.; and (4) a local perturbation mechanism to help escape local optima. To comprehensively evaluate the optimization performance of AGG-GCRA, 20 separate experiments were carried out across 26 standard benchmark functions and six real-world engineering optimization problems, with comparisons made against 11 advanced metaheuristic optimization methods. The findings indicate that AGG-GCRA surpasses the competing algorithms in aspects of convergence rate, solution precision, and robustness. In the stability analysis, AGG-GCRA consistently obtained the global optimal solution in multiple runs for five engineering cases, achieving an average rank of first place and a standard deviation close to zero, highlighting its exceptional global search capabilities and excellent repeatability. Statistical tests, including the Friedman ranking and Wilcoxon signed-rank tests, provide additional validation for the effectiveness and importance of the proposed algorithm. In conclusion, AGG-GCRA provides an efficient and stable intelligent optimization tool for solving various optimization problems.

Indexed as

adaptive and global-guided mechanismsgreater cane rat algorithmsolving optimization problems

Identifiers

PMID41002845
PMCPMC12467549

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.