I. Espejo Miranda, A. Marín Pérez, J. M. Muñoz Ocaña, A. M. Rodríguez Chía
This paper proposes new formulations for uncapacitated single-allocation hub location problems with less number of variables than the previous Integer Linear Programming formulations known in the literature. Our formulations are valid for general cost structure that does not require costs based on distances neither satisfying the triangle inequality and they can be used with costs in aggregated/disaggregated way.
The formulations are strengthened by means of valid inequalities and different families of cuts are developed and added through effective separation procedures.
The performance of the proposed methodology is tested on well-known hub location data sets and compared with the most efficient solution methods for the single-allocation hub location problems. Our results show the efficiency of our methodology, solving large-scale instances in competitive times.
Palabras clave: hub location, single allocation, discrete optimization
Programado
GT01 Localización III. Hub Location
8 de junio de 2022 12:40
A15
