A genetic algorithm for solving linear fractional bilevel problems |
| |
Authors: | Herminia I. Calvete Carmen Galé Pedro M. Mateo |
| |
Affiliation: | (1) Dpto. de Métodos Estadísticos, Universidad de Zaragoza, Pedro Cerbuna, 12, 50009 Zaragoza, Spain;(2) Maria de Luna 3, 50018 Zaragoza, Spain |
| |
Abstract: | Bilevel programming has been proposed for dealing with decision processes involving two decision makers with a hierarchical structure. They are characterized by the existence of two optimization problems in which the constraint region of the upper level problem is implicitly determined by the lower level optimization problem. In this paper a genetic algorithm is proposed for the class of bilevel problems in which both level objective functions are linear fractional and the common constraint region is a bounded polyhedron. The algorithm associates chromosomes with extreme points of the polyhedron and searches for a feasible solution close to the optimal solution by proposing efficient crossover and mutation procedures. The computational study shows a good performance of the algorithm, both in terms of solution quality and computational time. |
| |
Keywords: | Bilevel programming Genetic algorithm Extreme point Linear fractional |
本文献已被 SpringerLink 等数据库收录! |