Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization
Ankur Sinha, Pekka Malo, Kalyanmoy Deb

TL;DR
This paper introduces BLEAQ, an evolutionary algorithm utilizing quadratic approximations to efficiently solve complex single-objective bilevel optimization problems with fewer function evaluations.
Contribution
The paper presents a novel bilevel evolutionary algorithm that hybridizes classical optimization with evolutionary methods, effectively handling complex problems with reduced computational effort.
Findings
Significant performance improvements over benchmarks
Effective on problems with controllable complexities
Reduces function evaluations in solving bilevel problems
Abstract
Bilevel optimization problems are a class of challenging optimization problems, which contain two levels of optimization tasks. In these problems, the optimal solutions to the lower level problem become possible feasible candidates to the upper level problem. Such a requirement makes the optimization problem difficult to solve, and has kept the researchers busy towards devising methodologies, which can efficiently handle the problem. Despite the efforts, there hardly exists any effective methodology, which is capable of handling a complex bilevel problem. In this paper, we introduce bilevel evolutionary algorithm based on quadratic approximations (BLEAQ) of optimal lower level variables with respect to the upper level variables. The approach is capable of handling bilevel problems with different kinds of complexities in relatively smaller number of function evaluations. Ideas from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Smart Parking Systems Research · Optimization and Mathematical Programming
