LISS 2014 pp 395-400 | Cite as

Solving a Variant of the Hub Location-Routing Problem

  • Mauro Cardoso Lopes
  • Thiago Alves de QueirozEmail author
  • Carlos Eduardo de Andrade
  • FlávioKeidi Miyazawa
Conference paper


We investigate a variant of the many-to-many (hub) location-routing problem, which consists in partitioning the set of vertices of a graph into cycles containing exactly one hub each, and determining an extra cycle interconnecting all hubs. A local search heuristic that considers add/remove and swap operations is developed.Also, a branch-and-cut approach that solves an integer formulation is investigated.Computational experiments on several instances adapted from literature show that our algorithms are good to deal with small to medium-sized instances.


Location-routing problem Branch-and-cut Local search 



The authors would like to thank CNPq, FAPEG and FAPESP for their financial support.


  1. Applegate D, Cook W, Rohe A (2003) Chained lin-kernighan for large traveling salesman problems. INFORMS J Comput 15(1):82–92CrossRefGoogle Scholar
  2. de Camargo RS, de Miranda G, Løkketangen A (2013) A new formulation and an exact approach for the many-to-many hub location-routing problem. Appl Math Model 37(12–13):7465–7480CrossRefGoogle Scholar
  3. Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551–570CrossRefGoogle Scholar
  4. Lin CC, Lin JY, Chen YC (2012) The capacitated p-hub median problem with integral constraints:an application to a chinese air cargo network. Appl Math Model 36:2777–2787CrossRefGoogle Scholar
  5. Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100(2):423–445 (Series A and B)CrossRefGoogle Scholar
  6. Nagy G, Salhi S (1998) The many-to-many location-routing problem. Top 6:261–275CrossRefGoogle Scholar
  7. O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32:393–404CrossRefGoogle Scholar
  8. Wang Z, Lin C, Chan CK (2006) Demonstration of a single-fiber self-healing CWDM metro accessring network with unidirectional OADM. Photonics Technol Lett 18:163–165CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Mauro Cardoso Lopes
    • 1
  • Thiago Alves de Queiroz
    • 2
    Email author
  • Carlos Eduardo de Andrade
    • 1
  • FlávioKeidi Miyazawa
    • 1
  1. 1.Institute of ComputingIC/UNICAMPCampinasBrazil
  2. 2.Department of MathematicsUFG-Campus CatalãoCatalãoBrazil

Personalised recommendations