期刊
IEEE ACCESS
卷 8, 期 -, 页码 189527-189545出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.3031002
关键词
Particle swarm optimization; Convergence; Euclidean distance; Benchmark testing; Linear programming; Pareto optimization; Many-objective optimization; particle swarm optimization; leader selection
资金
- CONACyT [2016-01-1920]
- SEP-Cinvestav [4]
Many existing Multi-objective Particle Swarm Optimizers (MOPSOs) may encounter difficulties for a set of good approximated solutions when solving problems with more than three objectives. One possible reason is that the diluted selection pressure causes MOPSOs to fail to generate a set of good approximated Pareto solutions. In this paper, a new approach called the Hybrid Global Leader Selection Strategy (HGLSS) is proposed to deal with many-objective problems more effectively. HGLSS provides two global leader selection mechanisms: one for exploration and one for exploitation. Each particle (solution) can choose one of these two leader selection schemes to identify its global best leader. An external archive is adopted for maintaining the diversity of the found solutions and it contains the final solution reported at the end of the run. The update of the external archive is based on both Pareto dominance and density estimation. The performance of the proposed approach is compared with respect to nine state-of-the-art multi-objective metaheuristics in solving several benchmark problems. Our results indicate that the proposed algorithm generally outperforms the others in terms of Modified Inverted Generational Distance (IGD(+;)) indicator.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据