A GENETIC ALGORITHM BASED ON OPTIMALITY CONDITIONS FOR NONLINEAR BILEVEL PROGRAMMING PROBLEMS

다국어 초록 (Multilingual Abstract)

For a class of nonlinear bilevel programming problems in which the follower's problem is linear, the paper develops a genetic algorithm based on the optimality conditions of linear programming. At first,we denote an individual by selecting a base of the follower's linear programming, and use the optimality conditions given in the simplex method to denote the follower's solution functions.
Then, the follower's problem and variables are replaced by these optimality conditions and the solution functions, which makes the original bilevel programming become a single-level one only including the leader's variables. At last, the single-level problem is solved by using some classical optimization techniques, and its objective value is regarded as the fitness of the individual.
The numerical results illustrate that the proposed algorithm is efficient and stable.

참고문헌 (Reference)

1 H. V. Stackelberg, "The Theory of the Market Economy" Oxford Univ. Press 1952

2 B. D. Liu, "Stackelberg-Nash equilibrium for mutilevel programming with multiple followers using genetic algorithms" (36) : 79-89, 1998

3 Xiaobo Zhu, "Qian Yu and Xianjia Wang, A hybrid differential evolution algorithm for solving nonlinear bilevel programming with linear constraints" 126-131, 2006

4 J. F. Bard, "Practical Bilevel Optimization" Kluwer Academic Publishers 1998

5 H. I. Calvete, "On the quasiconcave bilevel programming problem" (98) : 613-622, 1998

6 Ue-Pyng Wen, "Linear bi-Level programming problems–A review" (42) : 125-133, 1991

7 B. Colson, "Bilevel programming: A survey" (3) : 87-107, 2005

8 V. Oduguwa, "Bi-level optimization using genetic algorithm" 123-128, 2002

9 Yuping Wang, "An evolutionary algorithm for solving non-linear bilevel programming based on a new constraint - handling scheme" (35) : 221-232, 2005

10 B. Colson, "A trust-region method for nonlinear bilevel programming: algorithm and computational experience" (30) : 211-227, 2005

11 J. Rajesh, "A tabu search based approach for solving a class of bilevel programming problems in chemical engineering" (9) : 307-319, 2003

12 E. Aiyoshi, "A solution method for the static constrained Stackelberg problem via penalty method" (29) : 1111-1114, 1984

13 H. Tuy, "A novel approach to bilevel nonlinear programming" (38) : 527-554, 2007

14 K. Shimizu, "A new computational method for Stackelberg and minmax problems by use of a penalty method" (26) : 460-466, 1981

15 H. I. Calvete, "A new approach for solving linear bilevel problems using genetic algorithms" (188) : 14-28, 2008

16 Kuen-Ming Lan, "A hybrid neural network approach to bilevel programming problems" (20) : 880-884, 2007

17 Hecheng Li, "A hybrid genetic algorithm for solving a class of nonlinear bilevel programming problems" 408-415, 2006

18 Dao Li Zhu, "A homotopy methodfor solving bilevel programming problem" (57) : 917-928, 2004

19 L D Muu, "A global optimization method for solving convex quadratic bilevel programming problems" (26) : 199-219, 2003