Loading...
Loading...

Go to the content (press return)

A heuristic for mixed linear integer bi-level programming problems based on benders decomposition

Author
Codina, E.; Lopez, F.
Type of activity
Presentation of work at congresses
Name of edition
1st International Workshop on Bi-level Programming
Date of publication
2017
Presentation's date
2016-03-10
Book of congress proceedings
1st International Workshop on Bi-level Programming (IWOBIP 2016): Nuevo Leon, Mexico: march 7-11, 2016: proceedings
First page
1
Last page
1
Project funding
ROBUSTEZ, RECUPERACION Y ADAPTABILIDAD DE SISTEMAS DE TRANSPORTE PUBLICO
Abstract
In this paper, a heuristic algorithm for a subclass of mixed-integer linear bi-level programming problem (MILBP) is presented. This subclass covers all MILBPs in which the upper level problem may contain both integer and continuous variables and variables for the lower level are continuous. The algorithm can be considered as a direct extension of the classical Benders decomposition method for linear integer programming. Although other Benders extensions have been previously used to solve these k...
Keywords
Benders decomposition, Mixed integer linear bi-level programming, Rapid Transit Design.
Group of research
IMP - Information Modelling and Processing
PROMALS - Research Group in Mathematical Programming, Logistics and Simulation
inLab FIB

Participants