.png){kind=icon}
.png){kind=icon}
Return
A full variate Gaussian model-based RM-MEDA without clustering process
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-017-0667-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A regularity model-based multi-objective estimation of distribution algorithm (RM-MEDA) is an excellent multi-objective estimation of distribution algorithm proposed in recent years. However, the performance of RM-MEDA is seriously affected by its clustering process. In order to avoid the influence of the clustering process, this paper presents a novel full variate Gaussian model-based (FGM-based) RM-MEDA without clustering process, named FRM-MEDA. In FRM-MEDA, the clustering process is removed from the original algorithm and the full variate Gaussian model (FGM) is introduced to keep the population diversity and make up the loss of the performance caused by removing the clustering process. Meanwhile, the introduction of FGM makes the FRM-MEDA faster and more stable when solving all the test instances. In addition, variable variance of FGM is presented to enhance the exploring ability of FRM-MEDA. The experiments demonstrate that the proposed algorithm significantly outperforms the RM-MEDA without clustering process and the RM-MEDA with K equal to AVE(K).
Keywords:
Estimation of distribution algorithm
Multi-objective optimization
Number of clusters
Full variate Gaussian model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.1K
Citations:
5.6K