An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems |
| |
Authors: | Hong Li Li Zhang Yong-Chang Jiao |
| |
Affiliation: | 1. School of Mathematics and Statistics, Xidian University, Xi’an, P. R. China;2. School of Electronic Engineering, Xidian University, Xi’an, P. R. China |
| |
Abstract: | This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn–Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach. |
| |
Keywords: | discrete bilevel programming problem smoothing function constraint-handling technique discrete differential evolution algorithm interactive approach |
|
|