Evidence map›Paper›PMID 42345679›Full record

ArticleBiomimetics (Basel, Switzerland)2026

Reverse Mutation for Optimization Learning Artificial Lemming Algorithm and Its Application in Engineering.

Mingbin Tang, Yejun Zheng, Lianbao Li, Li Cao, Zihao Cheng

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

5 authors.

Mingbin TangEngineering Technology Department, Shanghai Caoyang Vocational School, Shanghai 200333, China.
Yejun ZhengEngineering Technology Department, Shanghai Caoyang Vocational School, Shanghai 200333, China.
Lianbao LiEngineering Technology Department, Shanghai Caoyang Vocational School, Shanghai 200333, China.
Li CaoSchool of Electronic and Electrical Engineering, Wenzhou University of Technology, Wenzhou 325035, China.
Zihao ChengCollege of Control Science and Engineering, Zhejiang University, Hangzhou 310027, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Complex engineering optimization problems often exhibit high-dimensional, multi-constraint, and nonlinear characteristics. Traditional deterministic optimization methods rely on gradient information and have limited optimization ranges, making it difficult to meet the requirements of efficient and accurate solutions. Intelligent optimization algorithms have become the core means of solving such problems. Aiming at the limitations of the standard artificial lemming algorithm (ALA), such as insufficient population diversity, premature convergence, weak local exploitation ability, and slow convergence speed, which make it difficult to meet the requirements of solving complex engineering optimization problems, this paper proposes a reverse mutation for optimization learning artificial lemming algorithm (RMALA). Based on the ALA algorithm, the algorithm integrates three strategies: Cauchy mutation, the improved salp swarm algorithm (ISSA), and reverse mutation for optimization learning. The Cauchy mutation is used to maintain population diversity and avoid premature convergence of the algorithm. The improved salp swarm algorithm enhances the local exploitation ability of the algorithm and improves the optimization accuracy. Reverse mutation for optimization learning guides the population toward the global optimal solution region and accelerates the convergence speed. The significant experimental results show that in the CEC2017 and CEC2022 standard test sets, as well as the three classic engineering constrained optimization problems of welded beams, cantilever beams, and pressure vessels, RMALA's optimization accuracy is improved by more than 30% compared to the original ALA, and its convergence speed is improved by more than 25%. Its stability and robustness are better than those of five new swarm intelligence algorithms proposed in recent years. It can efficiently solve complex high-dimensional, nonlinear constrained optimization problems and has high significant engineering application value and academic innovation.

Indexed as

artificial lemming algorithmCauchy mutationengineering optimizationimproved salp swarm algorithmreverse mutation for optimization learning

Identifiers

PMID42345679
PMCPMC13296455

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.