Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/21862
Title: A review on bilevel optimization: from classical to evolutionary approaches and applications
Other Titles: IEEE Computational Intelligence Society
Authors: Sinha, Ankur
Malo, Pekka
Deb, Kalyanmoy
Keywords: Bilevel optimization;Evolutionary algorithms;Stackelberg games
Issue Date: 2018
Publisher: IEEE
Citation: Sinha, A., Malo, P. & Deb, K. (2017). A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 22(2), 276 - 295. doi: https://doi.org/10.1109/TEVC.2017.2712906
Abstract: 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. ,
URI: http://hdl.handle.net/11718/21862
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
A Review on Bilevel Optimization_2018.pdf
  Restricted Access
A Review on Bilevel Optimization_20182.33 MBAdobe PDFView/Open Request a copy


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.