Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
ShahinGelareh_ODYSSEUS2015.pdf (252.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01222923 , version 1 (31-10-2015)

Identifiants

  • HAL Id : hal-01222923 , version 1

Citer

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⟩
408 Consultations
261 Téléchargements

Partager

Gmail Facebook X LinkedIn More