.png){kind=icon}
.png){kind=icon}
Return
A similarity-detection-based evolutionary algorithm for large-scale multimodal multi-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101548.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, there has been a surge in the development of evolutionary algorithms tailored for multimodal multi -objective optimization problems (MMOPs). These algorithms aim to find multiple equivalent Pareto optimal solution sets (PSs). However, little work has been done on MMOPs with large-scale decision variables, especially when the Pareto optimal solutions are sparse. These problems pose significant challenges due to the dimension curse, the unknown sparsity, and the unknown number of equivalent PSs. In this paper, we propose an evolutionary algorithm based on similarity detection called SD-MMEA to solve large-scale MMOPs with sparse Pareto-optimal solutions. Specifically, it employs a multi -population independent evolution to explore multiple PSs and distinguishes different PSs by double detection of the similarity between subpopulations. Simultaneously, develop online scoring mechanisms for decision variables to guide the subpopulations to explore in different directions. In addition, during the latter stage of evolution, the decision variables of individuals are further optimized by a double -layer grouping process. The proposed algorithm is compared with six state-of-the-art algorithms. Experimental results show that SD-MMEA has significant advantages in solving large-scale MMOPs with sparse solutions.
Keywords:
Evolutionary algorithm
Large-scale multimodal multi-objective
optimization
Sparse solutions
Similarity detection
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W