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
This is a preview of subscription content, log in to check access
The authors would like to thank CNPq, FAPEG and FAPESP for their financial support.
Applegate D, Cook W, Rohe A (2003) Chained lin-kernighan for large traveling salesman problems. INFORMS J Comput 15(1):82–92CrossRefGoogle Scholar
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