Evidence map›Paper›PMID 42557351›Full record

ArticleScientific reports2026

A multi-objective particle swarm optimization algorithm with two-stage archive maintenance and auxiliary archive guidance.

Jing Zhang, Yanmin Liu, Yuci Li, Anna Dai, Ling Zhong, Siwan Chen

Abstract read
In one paragraph

Article in Scientific reports, 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

6 authors.

Jing ZhangSchool of Data Science and Information Engineering, Guizhou Minzu University, Guiyang, 550025, China.
Yanmin LiuSchool of Mathematics, Zunyi Normal College, Zunyi, 563002, China. yanmin7813@163.com.
Yuci LiSchool of Data Science and Information Engineering, Guizhou Minzu University, Guiyang, 550025, China.
Anna DaiSchool of Data Science and Information Engineering, Guizhou Minzu University, Guiyang, 550025, China.
Ling ZhongSchool of Data Science and Information Engineering, Guizhou Minzu University, Guiyang, 550025, China.
Siwan ChenSchool of Mathematics and Statistics, Guizhou University, Guiyang, 550025, China.

Funding

Decision Consultation Project of Guizhou Association for Science and Technology QKX2026-ZX-012Guizhou Province Graduate Education Teaching Reform Project 2025YJSJGXX095Major Science and Technology Special Project of Guizhou Provincial Artificial Intelligence Laboratory Qiankehe Platform RSSYS[2025] Major 004
6 · The paper itself

Abstract

In Multi-objective particle swarm optimization (MOPSO), the external archive largely determines how well convergence and diversity are balanced. Ineffective archive maintenance may lead to uneven solution distributions, inaccurate convergence, and premature trapping in local regions.To overcome these limitations, this paper proposes TAMOPSO, a Two-stage Archive Maintenance-based Multi-Objective Particle Swarm Optimization algorithm. In the first stage, adaptive grids with dynamic boundary expansion are used to locate high-density regions. In the second stage, solutions in these regions are evaluated by integrating angle-based diversity assessment and a dual-distance convergence metric, with selection preferences adaptively adjusted according to the evolutionary stage, thereby improving the distribution and Pareto-front coverage of the obtained solution set while controlling archive size. To further enhance particle guidance, a bounded auxiliary archive is introduced to reuse historical high-quality non-dominated solutions discarded during archive maintenance and assist personal best updates. In addition, a stagnation detection-based particle reconstruction strategy is designed, using sparsely distributed elite solutions from the external archive as reconstruction templates to guide stagnant particles back to promising search regions and enhance global exploration. Tests on representative benchmark suites indicate that TAMOPSO produces higher-quality approximation sets than the compared mainstream algorithms in most cases.

Indexed as

Adaptive gridsAuxiliary archiveMulti-objective particle swarm optimizationStagnation detection

Identifiers

PMID42557351
PMCPMC13442859

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.