Hub location problem in round-trip service applications - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Operations Research Année : 2021

Hub location problem in round-trip service applications

Omar Kemmar
Shahin Gelareh

Résumé

In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein runaway nodes and runaway connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.

Dates et versions

hal-04538507 , version 1 (09-04-2024)

Identifiants

Citer

Omar Kemmar, Karim Bouamrane, Shahin Gelareh. Hub location problem in round-trip service applications. RAIRO - Operations Research, 2021, 55, pp.S2831-S2858. ⟨10.1051/ro/2020125⟩. ⟨hal-04538507⟩

Collections

UNIV-ARTOIS
3 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More