Solving a Variant of the Hub Location-Routing Problem

Mauro Cardoso Lopes (), Thiago Alves de Queiroz (), Carlos Eduardo de Andrade () and FlávioKeidi Miyazawa ()
Additional contact information
Mauro Cardoso Lopes: IC/UNICAMP
Thiago Alves de Queiroz: UFG-Campus Catalão
Carlos Eduardo de Andrade: IC/UNICAMP
FlávioKeidi Miyazawa: IC/UNICAMP

A chapter in LISS 2014, 2015, pp 395-400 from Springer

Abstract: 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.

Keywords: Location-routing problem; Branch-and-cut; Local search (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-43871-8_58

Ordering information: This item can be ordered from
http://www.springer.com/9783662438718

DOI: 10.1007/978-3-662-43871-8_58

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().