On hub location problems in geographically flexible networks
Metadatos
Mostrar el registro completo del ítemEditorial
Wiley-Blackwell Publishing
Materia
Hub location Mixed integer nonlinear programming Neighborhoods Network design
Fecha
2021-05-19Referencia bibliográfica
Blanco, V. and Puerto, J. (2021), On hub location problems in geographically flexible networks. Intl. Trans. in Op. Res.. [https://doi.org/10.1111/itor.12993]
Patrocinador
Junta de Andalucia SEJ-584 FQM-331 FEDER-US-1256951 P18-FR-1422 P18-FR-2369; Spanish Government European Commission MTM2016-74983-C02-01; Andalucia Tech CEI-3FQM331; NetmeetData (Fundacion BBVA - Big Data 2019)Resumen
In this paper, we propose an extension of the uncapacitated hub location problem where the potential positions of the hubs are not fixed in advance. Instead, they are allowed to belong to a region around an initial discrete set of nodes. We give a general framework in which the collection, transportation, and distribution costs are based on norm-based distances and the hub-activation setup costs depend not only on the location of the hub that are opened but also on the size of the region where they are placed. Two alternative mathematical programming formulations are proposed. The first one is a compact formulation while the second one involves a family of constraints of exponential size that we separate efficiently giving rise to a branch-and-cut algorithm. The results of an extensive computational experience are reported showing the advantages of each of the approaches.