A Genetic Algorithm for Solving a Class of Multi-objective Bilevel Programming Problems
Shanfeng Zhang, Mengwei Li
Available Online April 2015.
- https://doi.org/10.2991/amcce-15.2015.117How to use a DOI?
- multi-objective bilevel programming; genetic algorithm; interpolation
- At present, most of the researches on bilevel programming problems are focused on single objective cases. This paper discusses a bilevel programming problem with upper level multi-objective optimization. In order to solve the problem efficiently, we present a genetic algorithm using interpolation. This method does not require solving lower optimization problem frequently. In the proposed algorithm, firstly, the interpolation functions are adopted to approximate lower level solution functions. As a result, the original problem can be approximated by a single-level multi-objective programming. In addition, the corresponding interpolation functions are updated such that these functions can approximate the lower level solution function very well. Finally, the multi-objective programming is solved for obtaining an optimal solution set of the original problem. The simulation on two examples indicates the proposed algorithm is effective and feasible.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Shanfeng Zhang AU - Mengwei Li PY - 2015/04 DA - 2015/04 TI - A Genetic Algorithm for Solving a Class of Multi-objective Bilevel Programming Problems BT - 2015 International Conference on Automation, Mechanical Control and Computational Engineering PB - Atlantis Press SP - 1444 EP - 1447 SN - 1951-6851 UR - https://doi.org/10.2991/amcce-15.2015.117 DO - https://doi.org/10.2991/amcce-15.2015.117 ID - Zhang2015/04 ER -