Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Applegate D, Cook W, Rohe A (2003) Chained lin-kernighan for large traveling salesman problems. INFORMS J Comput 15(1):82–92
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–7480
Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551–570
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–2787
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)
Nagy G, Salhi S (1998) The many-to-many location-routing problem. Top 6:261–275
O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32:393–404
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–165
Acknowledgements
The authors would like to thank CNPq, FAPEG and FAPESP for their financial support.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lopes, M., de Queiroz, T., de Andrade, C., Miyazawa, F. (2015). Solving a Variant of the Hub Location-Routing Problem. In: Zhang, Z., Shen, Z., Zhang, J., Zhang, R. (eds) LISS 2014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43871-8_58
Download citation
DOI: https://doi.org/10.1007/978-3-662-43871-8_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43870-1
Online ISBN: 978-3-662-43871-8
eBook Packages: Business and EconomicsBusiness and Management (R0)