Capacitated Hub Routing Problem in ...
Document type :
Communication dans un congrès avec actes
Title :
Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm
Author(s) :
Gelareh, Shahin [Auteur]
Laboratoire de Génie Informatique et d'Automatique de l'Artois [LGI2A]
Neamatian Monemi, Rahimeh [Auteur]
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Laboratoire de Génie Informatique et d'Automatique de l'Artois [LGI2A]
Neamatian Monemi, Rahimeh [Auteur]
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Conference title :
ODYSSEUS 2015 - Sixth International Workshop on Freight Transportation and Logistics
City :
Ajaccio
Country :
France
Start date of the conference :
2015-05-31
English keyword(s) :
Hub Location
Location Routing
Branch-and-Bound
Benders Decomposition
Location Routing
Branch-and-Bound
Benders Decomposition
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the ...
Show more >In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the hub-level network is a complete subgraph. The transshipment operations take place atthe 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 Bendersdecomposition to solve the problem. To accelerate convergence, our solution framework embeds an efficientheuristic producing high-quality solutions in short computation times. In addition, we show how symmetrycan be exploited to accelerate and improve the performance of our method.Show less >
Show more >In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the hub-level network is a complete subgraph. The transshipment operations take place atthe 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 Bendersdecomposition to solve the problem. To accelerate convergence, our solution framework embeds an efficientheuristic producing high-quality solutions in short computation times. In addition, we show how symmetrycan be exploited to accelerate and improve the performance of our method.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-01222923/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01222923/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01222923/document
- Open access
- Access the document
- document
- Open access
- Access the document
- ShahinGelareh_ODYSSEUS2015.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- ShahinGelareh_ODYSSEUS2015.pdf
- Open access
- Access the document