4.6 Article

An efficient solution strategy for bilevel multiobjective optimization problems using multiobjective evolutionary algorithm

Journal

SOFT COMPUTING
Volume 25, Issue 13, Pages 8241-8261

Publisher

SPRINGER
DOI: 10.1007/s00500-021-05750-0

Keywords

Bilevel multiobjective optimization; Pareto optimality; Multiobjective evolutionary algorithm; Weighted sum scalarization; Smoothing technique

Funding

  1. Natural Science Basic Research Plan in Shaanxi Province of China [2019JM-503]
  2. National Natural Science Foundation of China [61966030]

Ask authors/readers for more resources

An efficient solution strategy is proposed for bilevel multiobjective optimization problem with the lower-level MOP converted into a single-objective optimization problem. The Karush-Kuhn-Tucker optimality conditions are used to transform the original BLMOP into a single-level MOP with complementarity constraints. An effective smoothing technique is suggested to handle the complementarity constraints, and a decomposition-based constrained multiobjective differential evolution is developed for solving the transformed MOP. The experimental results demonstrate the proposed solution method's favorable convergence and diversity.
An efficient solution strategy is proposed for bilevel multiobjective optimization problem (BLMOP) with multiple objectives at both levels when multiobjective optimization problem (MOP) at the lower level satisfies the convexity and differentiability for the lower-level decision variables. In the proposed strategy, the MOP at the lower level is first converted into a single-objective optimization formulation through adopting adaptive weighted sum scalarization, in which the lower-level weight vector is adjusted adaptively while the iteration progressing. The Karush-Kuhn-Tucker optimality conditions are used to the lower-level single-objective scalarization problem, thus the original BLMOP can be converted into a single-level MOP with complementarity constraints. Then an effective smoothing technique is suggested to cope with the complementarity constraints. In such a way, the BLMOP is finally formalized as a single-level constrained nonlinear MOP. A decomposition-based constrained multiobjective differential evolution is developed to solve this transformed MOP and some instances are tested to illustrate the feasibility and effectiveness of the solution methodology. The experimental results show that the proposed solution method possesses favorite convergence and diversity.

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.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available