RT journal article
T1 On Carriers Collaboration in Hub Location Problems
A1 Fernández Areizaga, Elena
A1 Sgalambro, Antonino
A2 Estadística e Investigación Operativa
K1 Location
K1 Hub location
K1 Mixed integer programming
K1 Carriers collaboration
AB This paper considers a hub location problem where several carriers operate on a shared network to satisfy a given demand represented by a set of commodities. Possible cooperative strategies are studiedwhere carriers can share resources or swap their respective commodities to produce tangible cost savings while fully satisfying the existing demand. Three different collaborative policies are introduced and discussed, and mixed integer programming formulations are provided for each of them. Theoretical analyses are developed in order to assess the potential savings of each model with respect to traditional noncollaborative approaches. An empirical performance comparison on state-of-art sets of instances offers a complementary viewpoint. The influence of several diverse problem parameters on the performance is analyzed to identify those operational settings enabling the highest possible savings for the considered collaborative hub location models. The number of carriers and the number of open hubs have shown to play a key role; depending on the collaborative strategy, savings of up to 50% can be obtained as the number of carriers increases or the number of open hubs decreases.
PB Elsevier
SN 0377-2217
YR 2020
FD 2020
LK http://hdl.handle.net/10498/38376
UL http://hdl.handle.net/10498/38376
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 07-nov-2026