M. Albareda Sambola, M. Landete, G. Laporte
This work is focused on the Interval Transportation Problem (ITP). It is based on the transportation problem, aimed at finding the minimum cost flows between capacitated facilities and customers with given demands.
In the ITP the capacities of the facilities and the demands of the customers are not given in detail. Instead, an interval is given for each of these values. The goal of the ITP is to identify the feasible transportation problem instance with the largest optimal value among those that can be defined by pickig facility capacity values and customers demands from the corresponding given intervals.
We will present different adaptations of a global optimization method proposed by Tsoukalas et al. in 2009 for bilevel problems to the ITP, based on mathematical programming. We will show their effectiveness on a series of computational experiments.
Palabras clave: Facility location. Bilevel problem.
Programado
GT12.GELOCA1 Sesión Invitada
9 de noviembre de 2023 16:50
HC2: Sala Canónigos 2