返回
Multi-Objective Particle Swarm Optimization Based on Gaussian Sampling
DOI:10.1109/ACCESS.2020.3038497.png)
摘要
En 中文
This paper proposes a multi-objective particle swarm optimization algorithm based on Gaussian sampling (GS-MOPSO) to locate multiple Pareto optimal solutions for solving multimodal multi-objective problems. In the proposed method, the Gaussian sampling mechanism is used to form multiple neighborhoods by learning from optimal information of particles. And particles search their own neighborhoods to obtain more optimal solutions in the decision space. Moreover, an external archive maintenance strategy is proposed which allows the algorithm to maintain an archive containing better distribution and diversity of solutions. Meanwhile, nine new multimodal multi-objective test problems are designed to evaluate the performance of algorithms. The performance of GS-MOPSO is compared with twelve state-of-the-art multi-objective optimization algorithms on forty test problems. The experimental results show that the proposed algorithm is able to handle the multimodal multi-objective problems in terms of finding more and well-distributed Pareto solutions. In addition, the effectiveness of the proposed algorithm is further demonstrated in a real-world problem.
Keyword:
Maintenance engineering
Pareto optimization
Particle swarm optimization
Optimization
Particle swarm optimization
evolutionary algorithm
multimodal
multi-objective optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
A decomposition-based multi-objective evolutionary algorithm with quality indicator基于分解的带质量指标的多目标进化算法
A self-organized speciation based multi-objective particle swarm optimizer for multimodal multi-objective problems基于自组织形态的多目标粒子群算法求解多模态多目标问题
A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem
SOFT COMPUTING
IF2.5

