Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/25384
Title: A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications
Authors: Sinha A.
Malo P.
Deb K.
Keywords: Bilevel optimization;evolutionary algorithms;Stackelberg games
Issue Date: 2018
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Sinha, A., Malo, P., & Deb, K. (2018). A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications. In IEEE Transactions on Evolutionary Computation (Vol. 22, Issue 2). 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. � 2017 IEEE.
URI: https://www.doi.org/10.1109/TEVC.2017.2712906
http://hdl.handle.net/11718/25384
ISSN: 1089778X
Appears in Collections:Open Access Journal Articles

Files in This Item:
File SizeFormat 
a_review_on_2018.pdf2.33 MBAdobe PDFView/Open


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