.png){kind=icon}
.png){kind=icon}
Return
Applying graph-based differential grouping for multiobjective large-scale optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2019.100626.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An increasing number of multiobjective large-scale optimization problems (MOLSOPs) are emerging. Optimization based on variable grouping and cooperative coevolution is a good way to address MOLSOPs, but few attempts have been made to decompose the variables in MOLSOPs. In this paper, we propose multiobjective graph-based differential grouping with shift (mogDG-shift) to decompose the large number of variables in an MOLSOP. We analyze the variable properties, then detect the interactions among variables, and finally group the variables based on their properties and interactions. We modify the decision variable analyses (DVA) in the multiobjective evolutionary algorithm based on decision variable analyses (MOEA/DVA), extend graph-based differential grouping (gDG) to MOLSOPs, and test the method on many MOLSOPs. The experimental results show that mogDG-shift can achieve 100% grouping accuracy for LSMOP and DTLZ as well as almost all WFG instances, which are much better than DVA. We further combine mogDG-shift with two representative multiobjective evolutionary algorithms: the multiobjective evolutionary algorithm based on decomposition (MOEA/D) and the non-dominated sorting genetic algorithm II (NSGA-II). Compared with the original algorithms, the algorithms combined with mogDG-shift show improved optimization performance.
Keywords:
Differential grouping
Graph-based differential grouping
Multiobjective optimization
Large-scale optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W
Organization
View more organizations