.png){kind=icon}
Return
Noisy multi-objective optimization algorithm based on Gaussian model and regularity model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2021.101027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nowadays, noisy multi-objective optimization problems (NMOPs) become hot in the field of multi-objective optimization. Noise mostly exists in the solution space and the objective space of an NMOP, and therefore it can affect our judgment of better solutions or not. The regularity model and the probabilistic ranking method are proven that they can reduce the effect of noise in NMOPs to some degree, so in this paper, we combine them together to solve NMOPs better. On the other hand, we combine the Gaussian model with the non-dominated sorting so as to overcome the shortage of the regularity model. Consequently, a new noisy multi-objective optimization algorithm is proposed, denoted as GMRM-NSGA-II in this paper. The population of each generation is divided into two subpopulations adaptively, which are prepared for two different models with different sorting methods. The experimental results show GMRM-NSGA-II performs better on most of test problems including ZDT, DTLZ and WFG test suites with noise compared with other state-of-the-art algorithms.
Keywords:
Noise
Multi-objective optimization
Gaussian model
Probabilistic ranking
Regularity model
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
Cited Papers
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
.png){kind=icon}
PREAI
ShareSave
ShareSave
ShareSave
View more