A new approach for solving linear bilevel problems using genetic algorithms. (English) Zbl 1135.90023

Summary: 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.


90C05 Linear programming


extreme point


Full Text: DOI


[1] Anandalingam, G.; Mathieu, R.; Pittard, C.L.; Sinha, N., Artificial intelligence based approaches for solving hierarchical optimization problems, (), 289-301
[2] Bard, J.F., Practical bilevel optimization. algorithms and applications, (1998), Kluwer Academic Publishers Dordrecht, Boston, London · Zbl 0943.90078
[3] Bialas, W.F.; Karwan, M.H., On two-level optimization, IEEE transactions on automatic control, 27, 211-214, (1982) · Zbl 0487.90005
[4] Bialas, W.F.; Karwan, M.H., Two-level linear programming, Management science, 30, 1004-1024, (1984) · Zbl 0559.90053
[5] Calvete, H.I.; Galé, C., On the quasiconcave bilevel programming problem, Journal of optimization theory and applications, 98, 3, 613-622, (1998) · Zbl 0913.90240
[6] Dempe, S., Foundations of bilevel programming, (2002), Kluwer Academic Publishers Dordrecht, Boston, London · Zbl 1038.90097
[7] Dempe, S., Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints, Optimization, 52, 333-359, (2003) · Zbl 1140.90493
[8] Gendreau, M.; Marcotte, P.; Savard, G., A hybrid tabu-ascent algorithm for the linear bilevel programming problem, Journal of global optimization, 9, 1-14, (1996) · Zbl 0859.90097
[9] Goldberg, D.E., Genetic algorithms in search, optimization and machine learning, (1989), Addison-Wesley Reading, MA · Zbl 0721.68056
[10] Goldberg, D.E., The design of innovation: lessons from and for competent genetic algorithms, (2002), Kluwer Academic Publishers Boston · Zbl 1047.68162
[11] Hejazi, S.R.; Memariani, A.; Jahanshahloo, G.; Sepehri, M.M., Linear bilevel programming solution by genetic algorithm, Computers and operations research, 29, 1913-1925, (2002) · Zbl 1259.90120
[12] Holland, J.H., Adaptation in natural and artificial systems, (1975), University of Michigan Press Ann Arbor, MI
[13] Mathieu, R.; Pittard, L.; Anandalingam, G., Genetic algorithms based approach to bi-level linear programming, RAIRO-operations research, 28, 1, 1-22, (1994) · Zbl 0857.90083
[14] Michalewick, Z., Genetic algorithms+data structures=evolution programs, (1996), Springer Berlin
[15] Nishizaki, I.; Sakawa, M.; Niwa, K.; Kitaguchi, Y., A computational method using genetic algorithms for obtaining Stackelberg solutions to two-level linear programming problems, Electronics and communications in Japan, part 3, 85, 6, 55-62, (2002)
[16] Rajesh, J.; Gupta, K.; Kusumakar, H.S.; Jayaraman, V.K.; Kulkarni, B.D., A tabu search based approach for solving a class of bilevel programming problems in chemical engineering, Journal of heuristics, 9, 307-319, (2003)
[17] Reeves, C.R., Genetic algorithms for the operations researcher, INFORMS journal on computing, 9, 3, 231-250, (1997) · Zbl 0893.90145
[18] Sakin, K.H.; Ciric, A.R., A dual temperature simulated annealing approach for solving bilevel programming problems, Computers and chemical engineering, 23, 11-25, (1998)
[19] Wen, U.P.; Huang, A.D., A simple tabu search method to solve the mixed-integer linear bilevel programming problem, European journal of operational research, 88, 3, 563-571, (1996) · Zbl 0908.90194
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.