.png){kind=icon}
Return
Graph-Based Deep Decomposition for Overlapping Large-Scale Optimization Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TSMC.2022.3212045.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Decomposition methods play a critical role in cooperative co-evolutionary algorithms (CCEAs) for solving large-scale optimization problems. Although some well-performing decomposition methods have been designed based on the interactions among variables (IaV), their grouping accuracy is still limited due to the poor performance on the overlapping problems and the computational roundoff errors of IaV in the implementation. To deal with these limitations, a graph-based deep decomposition (GDD) method is proposed to obtain more accurate grouping results, especially for the overlapping problems. On the one hand, the GDD mines the IaV information and obtains the minimum vertex separator of the interaction graph of variables, so as to group variables deeply and recursively. On the other hand, the GDD has the ability of fault tolerance to deal with the computational roundoff errors of IaV and can improve the grouping accuracy. For better experimental studies of overlapping problems, a novel overlapping function generator is designed with the random and complicate overlap type, and two new metrics are proposed to evaluate the grouping accuracy. Comprehensive experiments show that GDD can greatly improve the grouping accuracy and help CCEAs perform better than other existing algorithms, especially on the overlapping problems. In addition, the GDD is highly fault tolerant and can divide problems accurately even on the inaccurate IaV.
Keywords:
Cooperative co-evolutionary algorithms (CCEAs)
decomposition methods
evolutionary computation
large-scale optimization problems (LSOPs)
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
Stable Insulin Preparation for Implanted Insulin Pumps: Laboratory and Animal Trials.png)
Diabetes
DiabetesIF0
PREAI
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more