Optimization Letters - SI: Recent Advances in Bilevel Optimization and its Applications
Motivation
Bilevel programming is a common approach to model hierarchical optimization problems involving multiple decision stages or agents. In recent years, applications of bilevel programming have permeated the literature of different domains, including transportation, ecology, economics, energy, optimal control, communications, security, and logistics, among others. This persistent growing interest stems from the ability of bilevel programs to capture the nested structure of realistic optimization problems and the interaction between competing agents.
Bilevel programs are known for their general difficulty and typically require novel approaches to be efficiently solved in practice. Due to their inherent complexity, multiple efforts have been devoted in the last two decades to deepen the understanding of these problems and improve the existing theory and computational methods.
Given the notable interest in this topic, this special issue seeks to rapidly disseminate concise high-quality articles to the community on recent advances in bilevel optimization. While a substantial portion of the studies in bilevel optimization focus on problems under adversarial settings, we also encourage submissions exploring other regimes between the problems (e.g., collaborative, indifference). Of particular interest are submissions aiming to bridge bilevel programming with other optimization paradigms such as robust, stochastic, and multi-objective programming. Contributions describing novel applications inspiring new methodological developments are highly encouraged.
Topics
This special issue of Optimization Letters (this opens in a new tab) is open to all areas of bilevel optimization, from theoretical research to practical applications. Submissions related to both exact and heuristic approaches are also welcomed. Topics of interest include, but are not limited to:
- Interdiction games
- Bilevel optimization under uncertainty
- Linear and nonlinear bilevel programming
- Continuous and discrete bilevel programming
- Computational optimization and open-source solvers for bilevel optimization
- Heuristic methods for bilevel optimization
- Multi-objective bilevel optimization
- Optimization algorithms and techniques, including constraint programming, decision diagrams, branch-and-cut, decomposition methods, among others.
- Modeling approaches for bilevel programming and its applications in logistics, scheduling, production, transportation, ecology, energy, humanitarian logistics, healthcare, social sciences, robotics, among others.
Submissions
Manuscripts should be prepared using Springer’s LaTeX macro package (this opens in a new tab) and submitted through the journal's editorial manager https://www.editorialmanager.com/optl (this opens in a new tab).
Please use article type: SI: BilOpt2023
Each manuscript will be peer-reviewed according to the editorial policy of Optimization Letters. Articles should be original, unpublished, and not currently under consideration for publication elsewhere.
Important Dates
Submission Deadline: September 30, 2023 (We encourage early submissions)
Guest Editors
- Jorge A. Sefair, University of Florida
- Jose L. Walteros, University at Buffalo
- Leonardo Lozano, University of Cincinnati
For all information in one page kindly download the PDF below: