Evidence map›Paper›PMID 42511427›Full record

ArticleEntropy (Basel, Switzerland)2026

A Dynamic Optimization Algorithm Based on Energy Level Collaboration Mechanism.

Quan Tang, Yazhi Yang, Jing Liu

Abstract read
In one paragraph

Article in Entropy (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

3 authors.

Quan TangSchool of Computer Engineering, Chengdu Technological University, Chengdu 611730, China.
Yazhi YangSchool of Computer Engineering, Chengdu Technological University, Chengdu 611730, China.
Jing LiuSchool of Computer Engineering, Chengdu Technological University, Chengdu 611730, China.

Funding

Chengdu Technological University Talent Project 2025RC103Chengdu Technological University Talent Project 2026RC001
6 · The paper itself

Abstract

Complex multimodal optimization problems are widespread in machine learning, engineering design, and data science, where multiple local optima often trap conventional algorithms. Balancing global exploration and local exploitation remains a fundamental challenge for population-based optimization algorithms when solving such problems. This paper proposes a dynamic search framework optimization algorithm based on an energy level collaboration mechanism, termed DSF-ELC. The algorithm introduces two synergistic strategies. First, a population dynamic reorganization strategy adaptively adjusts particle migration between two fitness-stratified subpopulations based on real-time diversity measurements, effectively balancing exploration and exploitation. Second, a comprehensive learning strategy enables each dimension of inferior solutions to learn from the corresponding dimension of superior solutions in a randomized manner, thereby enhancing search capability on complex multimodal functions. The two strategies work synergistically to achieve an adaptive exploration-exploitation balance. Experimental validation on the CEC 2017 benchmark suite demonstrates that DSF-ELC achieves superior solution accuracy and stability compared to six representative algorithms on the vast majority of functions. Wilcoxon signed-rank tests, box plot visualization, and convergence curve analysis further validate the effectiveness of the proposed strategies. The results indicate that DSF-ELC has significant advantages and broad application prospects for complex multimodal optimization problems.

Indexed as

adaptive migrationcomprehensive learningglobal exploration capabilitymulti-population strategyoptimization problems

Identifiers

PMID42511427
PMCPMC13408028

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.