Investigation of Using Large-Scale Swarm Optimizers to Optimize Sub-Problems in Cooperative Co-Evolution

  • Lu, Ming-Yuan; 
  • Yang, Qiang; 
  • Liu, Dong; 
  • Ma, Yuan-Yuan; 
  • Li, Tao; 
  • ... Zhang, Jun
Citations

SCOPUS

0

초록

Cooperative co-evolutionary algorithms (CCEAs) have witnessed giant success in solving large-scale optimization problems (LSOPs). However, most existing CCEAs use low-dimensional EAs to optimize the decomposed sub-problems. Such utilization of low-dimensional EAs may limit the effectiveness of CCEAs because some of the decomposed sub-problems may still be high-dimensional. Since there exist many non-decomposition based large-scale EAs, it is interesting to investigate the optimization effectiveness of CCEAs by using these non-decomposition based large-scale EAs to solve the decomposed sub-problems. To this end, this paper incorporates two state-of-the-art large-scale swarm optimizers into CCEAs with five state-of-the-art decomposition strategies to solve LSOPs. Experiments conducted on the CEC'2010 and CEC'2013 LSOP benchmark sets have shown that the two large-scale swarm optimizers help CCEAs with the five decomposition strategies achieve much better performance than the most widely used low-dimensional EA. © 2023 IEEE.

키워드

Cooperative Co-evolution; Evolutionary Algorithms; High-Dimensional Optimization; Large-Scale Optimization Problems; Large-Scale Swarm Optimizers
제목
Investigation of Using Large-Scale Swarm Optimizers to Optimize Sub-Problems in Cooperative Co-Evolution
저자
Lu, Ming-Yuan; Yang, Qiang; Liu, Dong; Ma, Yuan-Yuan; Li, Tao; Zhang, Jun
DOI
10.1109/SMC53992.2023.10394526
발행일
2023-10
유형
Conference paper
저널명
Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
페이지
5231 ~ 5236