Evolutionary multi-objective optimization (EMO) algorithms have been extensively applied to find multiple near Pareto-optimal solutions over the past 15 years or so. However, EMO algorithms for solving bilevel multi-objective optimization problems have not received adequate attention yet. These problems appear in many applications in practice and involve two levels, each comprising of multiple conflicting objectives. These problems require every feasible upper-level solution to satisfy optimality of a lower-level optimization problem, thereby making them difficult to solve. In this paper, we discuss a recently proposed bilevel EMO procedure and show its working principle on a couple of test problems and on a business decision-making problem. This paper should motivate other EMO researchers to engage more into this important optimization task of practical importance. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Deb, K., & Sinha, A. (2009). An evolutionary approach for bilevel multi-objective problems. In Communications in Computer and Information Science (Vol. 35, pp. 17–24). Springer Verlag. https://doi.org/10.1007/978-3-642-02298-2_3
Mendeley helps you to discover research relevant for your work.