Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.