A branch-and-cut algorithm for the partitioning-hub location-routing problem

Catanzaro, Daniele;Gourdin, E.;Labbé, M.;Özsoy, F.A.
(2011) Computers & Operations Research — Vol. 38, n° 2, p. 539-549 (2011)

Files

document.pdf
  • Restricted Access
  • Adobe PDF
  • 633.28 KB
Request a copy

Details

Authors
Abstract
(en) We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol called Intermediate System–Intermediate System (ISIS), and strategic planning of LTL ground freight distribution systems. We present an Integer Programming (IP) model for solving exactly the PHLRP and explore possible valid inequalities to strengthen it. Computational experiments prove the effectiveness of our model which is able to tackle instances of PHLRP containing up to 20 vertices.
Affiliations
  • ULBComputer Science Department

Citations

  • APA
  • Chicago
  • FWB

Catanzaro, D., Gourdin, E., Labbé, M., & Özsoy, F. A. (2011). A branch-and-cut algorithm for the partitioning-hub location-routing problem. Computers & Operations Research, 38(2), 539-549. https://doi.org/10.1016/j.cor.2010.07.014 (Original work published 2011)