ArticleBiomimetics (Basel, Switzerland)2025
An Improved Bionic Artificial Lemming Algorithm for Global Optimization and Cloud Task-Scheduling Problems.
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 4 papers.
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.
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.
Who cites it
4 citing papers in PubMed.
- Research on UAV Path Planning Based on Enhanced Artificial Lemming Algorithm.Biomimetics (Basel, Switzerland) · 2026Article
- Intelligent Control of Magnetic Ball Suspension Systems via a Novel Hyperbolic Tangent PID Controller Tuned by the Artificial Lemming Algorithm.Biomimetics (Basel, Switzerland) · 2026Article
- An Improved Artificial Lemming Algorithm Integrating Non-Uniform Mutation and Q-Learning Adaptation for Underwater Manipulator Controller Tuning.Biomimetics (Basel, Switzerland) · 2026Article
- EODE-PFA: A Multi-Strategy Enhanced Pathfinder Algorithm for Engineering Optimization and Feature Selection.Biomimetics (Basel, Switzerland) · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The artificial lemming algorithm has gradually emerged because of its unique structural design and efficient optimization performance and has been widely recognized by academic circles. However, in the face of more complex and challenging optimization and scheduling problems, it also exposed some obvious shortcomings. For example, the dispersion of the initial individual set in the algorithm is low, which leads to the low accuracy of the optimal solution. In addition, the exploitation ability of the algorithm is relatively weak, which leads to a slow convergence speed. Fortunately, this paper proposes an improved artificial lemming algorithm. Based on the in-depth analysis of the original algorithm, aiming at addressing the shortcomings of the original algorithm, some innovative mechanisms are introduced. In order to verify the effectiveness of the improved algorithm, a large number of experiments are carried out through global optimization test problems. The experimental results show that the performance of the algorithm has been obviously improved, and the accuracy and convergence speed of the solution are obviously better than the original algorithm and some baseline algorithms. In addition, this paper also applies the improved artificial travel algorithm to the cloud scheduling problem. These experimental results further verify the feasibility and effectiveness of this method in practical application and provide strong support for its application in a wider range of fields.
Indexed as
Identifiers
What Socratic holds
Registered trials
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 Socratic graph.