Dimension-Selected Orthogonal Particle Swarm Optimization for High-Dimensional Problems

Citations

SCOPUS

0

초록

Particle swarm optimization (PSO) is a widely used population-based optimization algorithm, but it often suffers from premature convergence when solving complex optimization problems. Orthogonal experimental design (OED) has shown potential in improving the exploration capability of PSO; however, its application to high-dimensional optimization requires large orthogonal arrays, resulting in excessive fitness evaluations and reduced efficiency. To address this issue, this paper proposes a dimension-selected orthogonal particle swarm optimization (DSOPSO) algorithm. The proposed method employs a ReliefFbased dimension importance estimation strategy and a kneepoint-based dimension selection mechanism to identify informative dimensions for orthogonal search adaptively. By performing OED only on the selected dimensions, DSOPSO reduces the number of dimensions involved in OED while preserving the search effectiveness of orthogonal recombination. Experimental results on the CEC2017 benchmark suite demonstrate that the proposed algorithm achieves competitive optimization performance and reduces the number of dimensions involved in OED on highdimensional optimization problems.

키워드

function optimizationorthogonal experimental designParticle swarm optimization
제목
Dimension-Selected Orthogonal Particle Swarm Optimization for High-Dimensional Problems
저자
Xing, ZhiZhang, HuanJin, Hu
DOI
10.1109/ICUFN69619.2026.11628605
발행일
2026-08
유형
Conference paper
저널명
International Conference on Ubiquitous and Future Networks, ICUFN
페이지
1280 ~ 1283