A Novel Two-Phase Cooperative Co-evolution Framework for Large-Scale Global Optimization with Complex Overlapping

Cooperative Co-evolution, by decomposing the problem space, is a key approach for large-scale global optimization. While it outperforms non-decomposition algorithms when subspaces are disjoint, overlapping variables complicate decomposition and degrade performance. To address this, we propose a novel two-phase cooperative co-evolution framework for complex overlapping problems, incorporating an effective method for decomposing overlapping problems based on their mathematical properties. We also introduce a customizable benchmark to extend existing ones for experimentation. Extensive experiments show that our framework significantly outperforms existing algorithms, revealing the characteristics of overlapping problems and the strengths of cooperative co-evolution and non-decomposition algorithms. The work is open-source at: https://github.com/GMC-DRL/HCC.

Authors

Institutions

Publication Details

Journal
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Published
2025-07-14
DOI
https://doi.org/10.1145/3712255.3726560
Citations
1
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.89

Funders

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

A Novel Two-Phase Cooperative Co-evolution Framework for Large-Scale Global Optimization with Complex Overlapping

Yue‐Jiao Gong, Zeyuan Ma, Wenjie Qiu, Hongshu Guo
1 citations
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Metaheuristic Optimization Algorithms Research
0.89
article

A Novel Two-Phase Cooperative Co-evolution Framework for Large-Scale Global Optimization with Complex Overlapping

Yue‐Jiao Gong, Zeyuan Ma, Wenjie Qiu, Hongshu Guo
article en
1 citations

Abstract

Cooperative Co-evolution, by decomposing the problem space, is a key approach for large-scale global optimization. While it outperforms non-decomposition algorithms when subspaces are disjoint, overlapping variables complicate decomposition and degrade performance. To address this, we propose a novel two-phase cooperative co-evolution framework for complex overlapping problems, incorporating an effective method for decomposing overlapping problems based on their mathematical properties. We also introduce a customizable benchmark to extend existing ones for experimentation. Extensive experiments show that our framework significantly outperforms existing algorithms, revealing the characteristics of overlapping problems and the strengths of cooperative co-evolution and non-decomposition algorithms. The work is open-source at: https://github.com/GMC-DRL/HCC.

Proceedings of the Genetic and Evolutionary Computation Conference Companion
South China University of Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province
Openalex Percentile: Top 23%
Metaheuristic Optimization Algorithms Research
0.89
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.