Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm

Shahin Gelareh 1 Rahimeh Neamatian Monemi 2 Frédéric Semet 3
3 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoketo- hub allocations. We propose a mathematical model and a branch-and-cut algorithm based on Benders decomposition to solve the problem. To accelerate convergence, our solution framework embeds an efficient heuristic producing high-quality solutions in short computation times. In addition, we show how symmetry can be exploited to accelerate and improve the performance of our method.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Frédéric Semet <>
Submitted on : Saturday, October 31, 2015 - 8:21:49 AM
Last modification on : Friday, March 22, 2019 - 1:36:01 AM
Long-term archiving on : Monday, February 1, 2016 - 10:13:46 AM


Files produced by the author(s)


  • HAL Id : hal-01222923, version 1


Shahin Gelareh, Rahimeh Neamatian Monemi, Frédéric Semet. Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm. ODYSSEUS 2015 - Sixth International Workshop on Freight Transportation and Logistics, May 2015, Ajaccio, France. ⟨hal-01222923⟩



Record views


Files downloads