RT journal article
T1 Uncapacitated single-allocation hub median location with edge upgrading: Models and exact solution algorithms
A1 Landete, Mercedes
A1 Muñoz Ocaña, Juan Manuel
A1 Rodríguez Chía, Antonio Manuel
A1 Saldanha-da-Gama, Francisco
A2 Estadística e Investigación Operativa
K1 Hub location
K1 Hub-network design
K1 Single allocation
K1 Edge upgrading
K1 MILP models
K1 Branch-and-cut
AB In this paper, a class of single-allocation hub location problems is investigated from theperspective of upgrading. The latter is understood as an improvement of a set of edges toincrease their individual performance, e.g., a decreased unit transportation cost. The goalis to obtain an improved optimal solution to the problem compared to that obtained ifupgrading was not done. A budget constraint is assumed to limit the upgrading operations.A flow-based formulation is initially proposed that extends a classical model for uncapacitatedsingle-allocation hub location with complete hub networks. Nevertheless, the fact that the unitcosts after upgrading may violate the triangle inequality needs to be accounted for. Since theproposed formulation has a high computing burden, different possibilities are discussed forenhancing it. This leads to devising an efficient branch-and-cut algorithm with different variants.Additionally, a formulation based on the discrete ordered median function is also introducedthat is also enhanced and embedded into a branch-and-cut algorithm again with severalvariants. All models and algorithms are also adapted to problems embedding hub networkdesign decisions. Extensive computational tests were conducted to assess the methodologicalcontributions proposed.
PB Elsevier
SN 0191-2615
YR 2024
FD 2024-07-30
LK http://hdl.handle.net/10498/35886
UL http://hdl.handle.net/10498/35886
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-nov-2026