Volume 55, 2021Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|Page(s)||S2831 - S2858|
|Published online||02 March 2021|
Hub location problem in round-trip service applications
Laboratoire d’informatique d’Oran (LIO), Université Oran 1, BP 1524 EL Mnaouer Oran, Algeria
2 Département Réseaux et Télécommunications, Université d’Artois, F-62400 Béthune, France
Accepted: 31 October 2020
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.
Mathematics Subject Classification: 68T20 / 90C59 / 90C27 / 90B80 / 90C35 / 90C05 / 90C11
Key words: Hub location problem / liner shipping / runaway node / branch-and-cut / hyper-heuristic / variable neighborhood search / reinforcement learning / k-means
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.