Cooperative Evolutionary Optimization for Large-Scale Problems

Cooperative evolutionary optimisation has emerged as a powerful paradigm for addressing large-scale optimisation problems characterised by thousands or even millions of decision variables. At its core, this approach divides a high-dimensional problem into smaller, more tractable subcomponents, which are then evolved in parallel or in an interleaved manner. By exploiting variable interactions through careful decomposition schemes, cooperative frameworks can dramatically reduce computational complexity and mitigate the curse of dimensionality. These methods find application in diverse domains, from tuning parameters in deep neural networks and designing resilient supply chains to scheduling complex cloud workflows and optimising aerodynamic shapes. Recent advances have focused on adaptive decomposition, dynamic group learning and targeted modification of bottleneck variables, enhancing convergence speed and solution quality. Moreover, hybrid strategies that combine population-based metaheuristics with machine-learning models or surrogate approximations have extended the reach of cooperative coevolution to real-time and resource-constrained settings. The global significance of these techniques lies in their capacity to deliver near-optimal solutions for grand challenges in engineering, logistics and scientific computing, where traditional monolithic algorithms falter.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Cooperative Evolutionary Optimization for Large-Scale Problems publication trend

The graph below shows the total number of articles in cooperative evolutionary optimization for large-scale problems across all publications each year (not limited to Nature Index journals).

Technical terms

Cooperative coevolution: A framework that decomposes a high-dimensional problem into subcomponents optimised by separate evolutionary processes that share information.

Variable decomposition: The process of partitioning decision variables into groups based on their interactions or separability properties.

Differential grouping: A technique for detecting dependencies among variables by analysing differences in function evaluations under perturbations.

Particle swarm optimisation: A population-based metaheuristic in which candidate solutions (particles) move through the search space by learning from individual and collective experience.

Bottleneck dimension: A variable or subset of variables whose optimisation significantly restricts overall solution quality and convergence speed.

References

1. Dual Differential Grouping: A More General Decomposition Method for Large-Scale Optimization. IEEE Transactions on Cybernetics (2023).
2. Dynamic Group Learning Distributed Particle Swarm Optimization for Large-Scale Optimization and Its Application in Cloud Workflow Scheduling. IEEE Transactions on Cybernetics (2019).
3. Adaptive Granularity Learning Distributed Particle Swarm Optimization for Large-Scale Optimization. IEEE Transactions on Cybernetics (2021).
4. Gene Targeting Differential Evolution: A Simple and Efficient Method for Large-Scale Optimization. IEEE Transactions on Evolutionary Computation (2022).