Surrogate-assisted cooperative coevolutionary optimization with a new grouping strategy for large-scale expensive problems

Large-scale expensive optimization problems (LSEOPs) often face significant challenges because of both the expensive objective evaluation and dimensional curse. A few surrogate-assisted evolutionary algorithms (SAEAs) have been proposed for addressing LSEOPs in the cooperative coevolutionary framework. However, good methods are still expected for finding better solutions for LSEOPs in a limited budget. Thus, in this approach, we introduced a new grouping technology to enhance the chances of grouping correlational variables into the same sub-problems. Then the search strategy is modified on the competitive swarm optimizer and two different approaches are proposed for infill sampling in two stages, respectively. We conducted experiments using the CEC’2013 test suite and compared our results to four outstanding approaches for LSEOPs. The results reflect that our proposed algorithm achieves better experimental results when dealing with expensive LSOPs.

Authors

Institutions

Publication Details

Journal
Complex & Intelligent Systems
Published
2025-11-05
DOI
https://doi.org/10.1007/s40747-025-02139-6
Citations
1
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Surrogate-assisted cooperative coevolutionary optimization with a new grouping strategy for large-scale expensive problems

Pengyun Zhang, Guochen Zhang, Pei‐Wei Tsai, Chaoli Sun et al.
1 citations
Complex & Intelligent Systems
Advanced Multi-Objective Optimization Algorithms
1.50
article

Surrogate-assisted cooperative coevolutionary optimization with a new grouping strategy for large-scale expensive problems

Pengyun Zhang, Guochen Zhang, Pei‐Wei Tsai, Chaoli Sun, Lu Wang
article en
1 citations

Abstract

Large-scale expensive optimization problems (LSEOPs) often face significant challenges because of both the expensive objective evaluation and dimensional curse. A few surrogate-assisted evolutionary algorithms (SAEAs) have been proposed for addressing LSEOPs in the cooperative coevolutionary framework. However, good methods are still expected for finding better solutions for LSEOPs in a limited budget. Thus, in this approach, we introduced a new grouping technology to enhance the chances of grouping correlational variables into the same sub-problems. Then the search strategy is modified on the competitive swarm optimizer and two different approaches are proposed for infill sampling in two stages, respectively. We conducted experiments using the CEC’2013 test suite and compared our results to four outstanding approaches for LSEOPs. The results reflect that our proposed algorithm achieves better experimental results when dealing with expensive LSOPs.

Complex & Intelligent SystemsVol. 12(1)
Taiyuan University of Science and Technology (CN), Swinburne University of Technology (AU)
National Natural Science Foundation of China, Natural Science Foundation of Shanxi Province, Shanxi Provincial Key Research and Development Project
Openalex Percentile: Top 12%
Advanced Multi-Objective Optimization Algorithms
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.