返回
An Efficient Dynamic Resource Allocation Framework for Evolutionary Bilevel Optimization
DOI:10.1109/TCYB.2024.3492075.png)
摘要
En 中文
Bilevel optimization problems (BLOPs) are characterized by an interactive hierarchical structure, where the upper level seeks to optimize its strategy while simultaneously considering the response of the lower level. Evolutionary algorithms are commonly used to solve complex bilevel problems in practical scenarios, but they face significant resource consumption challenges due to the nested structure imposed by the implicit lower-level optimality condition. This challenge becomes even more pronounced as problem dimensions increase. Although recent methods have enhanced bilevel convergence through task-level knowledge sharing, further efficiency improvements are still hindered by redundant lower-level iterations that consume excessive resources while generating unpromising solutions. To overcome this challenge, this article proposes an efficient dynamic resource allocation framework for evolutionary bilevel optimization, named DRC-BLEA. Compared to existing approaches, DRC-BLEA introduces a novel competitive quasi-parallel paradigm, in which multiple lower-level optimization tasks, derived from different upper-level individuals, compete for resources. A continuously updated selection probability is used to prioritize execution opportunities to promising tasks. Additionally, a cooperation mechanism is integrated within the competitive framework to further enhance efficiency and prevent premature convergence. Experimental results compared with chosen state-of-the-art algorithms demonstrate the effectiveness of the proposed method. Specifically, DRC-BLEA achieves competitive accuracy across diverse problem sets and real-world scenarios, while significantly reducing the number of function evaluations and overall running time.
Keyword:
Optimization
Iron
Resource management
Linear programming
Dynamic scheduling
Machine learning
Convergence
Computational modeling
Accuracy
Vectors
Bilevel optimization
evolutionary computation
quasi-parallel competition
resource allocation
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
A new co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization一种新的基于协同进化分解的双层组合优化算法
APPLIED INTELLIGENCE
IF3.5
Population Evolvability: Dynamic Fitness Landscape Analysis for Population-Based Metaheuristic Algorithms种群可进化性: 基于种群的元启发式算法的动态适应性景观分析
A nested particle swarm algorithm based on sphere mutation to solve bi-level optimization
SOFT COMPUTING
IF2.5

