Investigation of Using Large-Scale Swarm Optimizers to Optimize Sub-Problems in Cooperative Co-Evolution
- Authors
- Lu, Ming-Yuan; Yang, Qiang; Liu, Dong; Ma, Yuan-Yuan; Li, Tao; Zhang, Jun
- Issue Date
- Oct-2023
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Cooperative Co-evolution; Evolutionary Algorithms; High-Dimensional Optimization; Large-Scale Optimization Problems; Large-Scale Swarm Optimizers
- Citation
- 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp 5231 - 5236
- Pages
- 6
- Indexed
- SCOPUS
- Journal Title
- 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)
- Start Page
- 5231
- End Page
- 5236
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118450
- DOI
- 10.1109/SMC53992.2023.10394526
- ISSN
- 1062-922X
- Abstract
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.