dc.contributor.author | Sinha, Ankur | |
dc.contributor.author | Malo, Pekka | |
dc.contributor.author | Deb, Kalyanmoy | |
dc.date.accessioned | 2019-05-15T22:40:54Z | |
dc.date.available | 2019-05-15T22:40:54Z | |
dc.date.issued | 2018 | |
dc.identifier.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 | en_US |
dc.identifier.uri | http://hdl.handle.net/11718/21862 | |
dc.description.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.
, | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Bilevel optimization | en_US |
dc.subject | Evolutionary algorithms | en_US |
dc.subject | Stackelberg games | en_US |
dc.title | A review on bilevel optimization: from classical to evolutionary approaches and applications | en_US |
dc.title.alternative | IEEE Computational Intelligence Society | en_US |
dc.type | Article | en_US |