.png){kind=icon}
Return
Evolutionary dynamic grouping based cooperative co-evolution algorithm for large-scale optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-024-05390-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To effectively address large-scale optimization problems, this paper proposes an evolutionary dynamic grouping (EDG) based cooperative co-evolution (CC) algorithm. In the proposed algorithm, a novel decomposition method is designed to generate the sub-components of decision variables dynamically. Additionally, an evolutionary search method based on the fireworks search strategy is proposed to enhance the searchability of the algorithm. The performance of the proposed algorithm is assessed using two benchmark suites, IEEE CEC'2010 and IEEE CEC'2013, as well as a real-world optimization problem, the 0/1 Knapsack Problem (KP). Experimental results demonstrate that the proposed algorithm achieves competitive results when compared with other state-of-the-art algorithms.
Keywords:
Large-scale optimization
Cooperative co-evolution (CC)
Dynamic grouping
Fireworks search strategy
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
ShareSaveLong-lived Photon Upconversion Phosphorescence in RbCaF3:Mn2+,Yb3+ and the Dynamic Color Separation Effect.png)
iScience
OAAI
iScienceIF0
OAAIShareSaveShareSaveA reference vector adaptive strategy for balancing diversity and convergence in many-objective evolutionary algorithmsAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSave
ShareSaveA novel local search method for LSGO with golden ratio and dynamic search stepSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSave
View more