.png){kind=icon}
Return
Accelerating Bilevel Optimization With Hierarchical Many-Threaded Parallel Differential Evolution
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2025.3560217.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Bilevel optimization is encountered in many relevant real-world applications. The main feature of this type of problem is that an upper-level optimization problem is constrained by a nested lower-level optimization problem. Because of this nested structure, bilevel problems (BLPs) are usually computationally expensive to solve. Differential evolution (DE) has demonstrated promising results in solving BLPs of relatively small scales. As the problem scale increases, the decision space becomes intrinsically larger, requiring a growing number of function evaluations for the method to work properly. In this context, heavy parallelization and high-performance computing techniques are indispensable to enable the resolution of more complex and challenging optimization problems. Hence, we propose a hierarchical many-threaded parallel DE approach for BLPs, where both levels are parallelized. The computational experiments demonstrate that the parallel implementation achieved runtime speeds ranging from 44 to 2559 times faster than the sequential version on a well-known scalable SMD benchmark test problem when executed on an NVIDIA A100 GPU. The findings indicate that the algorithm’s convergence is strongly influenced by the number of both upper- and lower-level generations. Moreover, the success of experiments with large-scale problems is closely linked to the choice of small population sizes.
Keywords:
Bilevel optimization
differential evolution (DE)
heterogeneous computing
hierarchical decomposition
GP-GPU
many-threaded parallelism
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
View more organizations
Cited Papers
A new co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSave
ShareSaveA nested particle swarm algorithm based on sphere mutation to solve bi-level optimizationSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveCo-evolutionary algorithms to solve hierarchized Steiner tree problems in telecommunication networks
PREAI
ShareSave View more