A Hybrid Genetic Algorithm for Solving a Class of Nonlinear Bilevel Programming Problems
In this paper, a special nonlinear bilevel programming problem (BLPP), in which the follower’s problem is a convex quadratic programming in y, is transformed into an equivalent single-level programming problem by using Karush-Kuhn-Tucker(K-K-T) condition. To solve the equivalent problem effectively, firstly, a genetic algorithm is incorporated with Lemke algorithm. For x fixed, the optimal solution y of the follower’s problem can be obtained by Lemke algorithm, then (x,y) is a feasible or approximately feasible solution of the transformed problem and considered as a point in the population; secondly, based on the best individuals in the population, a special crossover operator is designed to generate high quality individuals; finally, a new hybrid genetic algorithm is proposed for solving this class of bilevel programming problems. The simulation on 20 benchmark problems demonstrates the effectiveness of the proposed algorithm.
KeywordsCrossover Operator Benchmark Problem Hybrid Genetic Algorithm Bilevel Programming Bilevel Programming Problem
Unable to display preview. Download preview PDF.
- 1.Von Stackelberg, H.: The Theory of the Market Economy. William Hodge, Lond, UK (1952)Google Scholar
- 6.Amouzegar, M.A., Moshirvaziri, K.: A penalty method for linear bilevel programming problems. In: Migdalas, A., Pardalos, M., Varbrand, P. (eds.) Multilevel optimization: Algorithms, complexity and Applications, ch. 11, Kluwer, Norwell (1997)Google Scholar
- 12.Oduguwa, V., Roy, R.: Bi-level optimization using genetic algorithm. In: Proc. IEEE Int. Conf. Artificial Intelligence Systems, pp. 123–128 (2002)Google Scholar