A new approach for solving linear bilevel problems using genetic algorithms

Bilevel programming involves two optimization problems where the constraint region of the first level problem is implicitly determined by another optimization problem. This paper develops a genetic algorithm for the linear bilevel problem in which both objective functions are linear and the common constraint region is a polyhedron. Taking into account the existence of an extreme point of the polyhedron which solves the problem, the algorithm aims to combine classical extreme point enumeration techniques with genetic search methods by associating chromosomes with extreme points of the polyhedron. The numerical results show the efficiency of the proposed algorithm. In addition, this genetic algorithm can also be used for solving quasiconcave bilevel problems provided that the second level objective function is linear.

[1]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[2]  G. Anandalingam.  Artificial Intelligence Based Approaches for Solving Hierarchical Optimization Problems , 1989 .

[3]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[4]  Stephan Dempe,et al.  Foundations of Bilevel Programming , 2002 .

[5]  U. Wen,et al.  A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem , 1996 .

[6]  G. Anandalingam,et al.  Genetic algorithm based approach to bi-level linear programming , 1994 .

[7]  Ichiro Nishizaki,et al.  A computational method using genetic algorithms for obtaining Stackelberg solutions to two‐level linear programming problems , 2002 .

[8]  Michel Gendreau,et al.  A hybrid Tabu-ascent algorithm for the linear Bilevel Programming Problem , 1996, J. Glob. Optim..

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

[10]  Wayne F. Bialas,et al.  On two-level optimization , 1982 .

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[12]  S. Dempe.  Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints , 2003 .

[13]  A. Ciric,et al.  A dual temperature simulated annealing approach for solving bilevel programming problems , 1998 .

[14]  Sonja Berner,et al.  Parallel methods for verified global optimization practice and theory , 1996, J. Glob. Optim..

[15]  Wayne F. Bialas,et al.  Two-Level Linear Programming , 1984 .

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[19]  Mohammad Mehdi Sepehri,et al.  Linear bilevel programming solution by genetic algorithm , 2002, Comput. Oper. Res..

[20]  Ramesh Sharda,et al.  Impacts of recent computer advances on operations research , 1989 .

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

[22]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

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