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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...