4.7 Article

A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications

Journal

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
Volume 22, Issue 2, Pages 276-295

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2017.2712906

Keywords

Bilevel optimization; evolutionary algorithms; Stackelberg games

Funding

  1. Liikesivistysrahasto
  2. Helsinki School of Economics Foundation
  3. NSF Beacon Center [DBI-0939454]

Ask authors/readers for more resources

Bilevel optimization is defined as a mathematical program, where an optimization problem contains another optimization problem as a constraint. These problems have received significant attention from the mathematical programming community. Only limited work exists on bilevel problems using evolutionary computation techniques; however, recently there has been an increasing interest due to the proliferation of practical applications and the potential of evolutionary algorithms in tackling these problems. This paper provides a comprehensive review on bilevel optimization from the basic principles to solution strategies; both classical and evolutionary. A number of potential application problems are also discussed. To offer the readers insights on the prominent developments in the field of bilevel optimization, we have performed an automated text-analysis of an extended list of papers published on bilevel optimization to date. This paper should motivate evolutionary computation researchers to pay more attention to this practical yet challenging area.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available