A Mixed-Encoding Genetic Algorithm for Nonlinear Bilevel Programming Problems

For nonlinear bi-level programming problems in which the follower's problem is linear, the paper develops a genetic algorithm based on a mixed encoding technique. At first, each individual consists of two parts, the first part is the leader's variable values using real-encoding, whereas the second one is the sequence number of basic variables of the follower's programming, which are some integers. Then, a new fitness function is given, in which the optimality conditions of linear programming are incorporated into penalty term to guarantee the optimality of the follower's problem is satisfied. At last, based on the characteristic of individuals, new crossover and mutation operators are designed. The numerical results illustrate that the proposed algorithm is efficient and stable.

[1]  Athanasios Migdalas,et al.  A novel approach to Bilevel nonlinear programming , 2007, J. Glob. Optim..

[2]  Jonathan F. Bard,et al.  Practical Bilevel Optimization , 1998 .

[3]  D. Zhu,et al.  A homotopy method for solving bilevel programming problem , 2004 .

[4]  D. White,et al.  A solution method for the linear static Stackelberg problem using penalty functions , 1990 .

[5]  E. Aiyoshi,et al.  A solution method for the static constrained Stackelberg problem via penalty method , 1984 .

[6]  Wang Yu,et al.  A hybrid genetic algorithm for nonlinear bilevel programming , 2002 .

[7]  Patrice Marcotte,et al.  Bilevel programming: A survey , 2005, 4OR.

[8]  Le Dung Muu,et al.  A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems , 2003, J. Glob. Optim..

[9]  Herminia I. Calvete,et al.  A new approach for solving linear bilevel problems using genetic algorithms , 2008, Eur. J. Oper. Res..

[10]  Rajkumar Roy,et al.  Bi-level optimisation using genetic algorithm , 2002, Proceedings 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS 2002).

[11]  E. Aiyoshi,et al.  A new computational method for Stackelberg and min-max problems by use of a penalty method , 1981 .

[12]  Kapil Gupta,et al.  A Tabu Search Based Approach for Solving a Class of Bilevel Programming Problems in Chemical Engineering , 2003, J. Heuristics.

[13]  Yuping Wang,et al.  A Hybrid Genetic Algorithm for Solving a Class of Nonlinear Bilevel Programming Problems , 2006, SEAL.

[14]  Ue-Pyng Wen,et al.  A hybrid neural network approach to bilevel programming problems , 2007, Appl. Math. Lett..

[15]  Ue-Pyng Wen,et al.  Linear Bi-level Programming Problems — A Review , 1991 .

[16]  Yuping Wang,et al.  An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[17]  Patrice Marcotte,et al.  A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience , 2005, Comput. Optim. Appl..

[18]  Xianjia Wang,et al.  A Hybrid Differential Evolution Algorithm for Solving Nonlinear Bilevel Programming with Linear Constraints , 2006, 2006 5th IEEE International Conference on Cognitive Informatics.

[19]  Baoding Liu,et al.  Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms , 1998 .

[20]  Herminia I. Calvete,et al.  On the Quasiconcave Bilevel Programming Problem , 1998 .