Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
A new approach for solving linear bilevel problems using genetic algorithms
Ist Teil von
European journal of operational research, 2008-07, Vol.188 (1), p.14-28
Ort / Verlag
Amsterdam: Elsevier B.V
Erscheinungsjahr
2008
Link zum Volltext
Quelle
Elsevier ScienceDirect Journals
Beschreibungen/Notizen
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.