A Hybrid Genetic Algorithm for Solving Nonlinear Bilevel Programming Problems Based on the Simplex Method

In this paper, a hybrid genetic algorithm is proposed for solving nonlinear bilevel programming problems (BLPPs). In order to improve the feasibility of the individuals, for each fixed leader-level variable x, the follower's problem is solved to get its optimal solution y. Then, based on the simplex method, a new crossover operator is designed, in which the best individuals generated so far are employed to yield a good direction of evolvement. Furthermore, a penalty method is developed to deal with the leader-level constraints, in which the penalty parameter can be adjusted by considering the status of the individuals in the population. At last, when the follower's problem has more than one optimal solutions for a fixed x, a selection scheme is given by solving a constructed single-level programming problem. The simulation on 20 benchmark problems demonstrates the effectiveness of the proposed algorithm.

[1]  Pierre Hansen,et al.  New Branch-and-Bound Rules for Linear Bilevel Programming , 1989, SIAM J. Sci. Comput..

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

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

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

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

[6]  Mahyar A. Amouzegar.  A global optimization method for nonlinear bilevel programming problems , 1999, IEEE Trans. Syst. Man Cybern. Part B.

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

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

[9]  Tetsuyuki Takahama,et al.  Constrained optimization by applying the /spl alpha/ constrained method to the nonlinear simplex method with mutations , 2005, IEEE Transactions on Evolutionary Computation.

[10]  S. R. Hejazia,et al.  Linear bilevel programming solution by genetic algorithm , 2002 .

[11]  Jirí Vladimír Outrata,et al.  On the numerical solution of a class of Stackelberg problems , 1990, ZOR Methods Model. Oper. Res..

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