Skip to content
Open access

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

Aug 2026 · Scientific Reports · Vol 16 · 0 citations · 39 references
Medicine

TL;DR

TAMOPSO, a Two-stage Archive Maintenance-based Multi-Objective Particle Swarm Optimization algorithm, which produces higher-quality approximation sets than the compared mainstream algorithms in most cases.

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.

Read PDF

Similar papers

Sep 2026

A novel multi-population evolutionary algorithm based on two-stage division and diversity enhancement for constrained multi-objective optimization

A novel evolutionary algorithm termed CMOEA-TSD is proposed, which adopts a three-population, two-stage co-evolutionary framework to enhance diversity and coordinate multiple search behaviors and significantly outperforms seven state-of-the-art algorithms.

Wei-Ye Bai, Cun-Yan Liu, Wei Wang · 0 citations
Aug 2026

A Multimodal Multiobjective Particle Swarm Optimization Algorithm Based on Special Crowding Distance and a Modality-Aware Strategy.

A multimodal multiobjective particle swarm optimization (MOPSO) algorithm based on special crowding distance (SCD) and a modality-aware strategy (MMOPSO_SCDMA) that significantly outperforms 11 existing state-of-the-art algorithms across multiple performance metrics.

Liang-Liang Sun, Tian-Hao Fu, Zheng-Hao Song et al. · 0 citations
Open access Aug 2026

A coordinated hybrid initialization and multi-operator framework for swarm-based optimization

An enhanced sand cat swarm algorithm (ESC-SCSA) is developed and comprehensively evaluated through sensitivity analysis, ablation studies, convergence analysis, and statistical significance tests, demonstrating its effectiveness and potential generalization capability across both continuous and discrete optimization pr...

wirawati dewi ahmad, Azuraliza Abu Bakar, Mohd Nor Akmal Khalid · 0 citations
Open access Sep 2026

MCPSO-ALS: A Multi-Swarm Collaborative Particle Swarm Optimization with Adaptive Learning Strategy for Solving Global Optimization Problems

Experimental results demonstrate that the proposed Multi-swarm Collaborative Particle Swarm Optimization with Adaptive Learning Strategy with Adaptive Learning Mechanism exhibits significant advantages in convergence speed, solving accuracy, and comprehensive optimization capabilities compared with several state-of-the...

Zhi-Y. Gao, Xu Yang · 0 citations
Conference Aug 2026

Research on optimization of area coverage strategy based on improved particle swarm algorithm

An improved particle swarm algorithm integrating greedy thought is proposed, aiming at the problems such as multi-constraints, multi-variables, and difficult high-dimensional solutions commonly existing in the optimization of area coverage strategy.

Mingzhe Chen, Bing He, Wei-Jie Kang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.