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

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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2011-02, Vol.38 (2), p.539-549
Hauptverfasser:	Catanzaro, Daniele, Gourdin, Eric, Labbé, Martine, Özsoy, F. Aykut
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Branch-and-cut Communication networks Communications networks Computer networks Computer Science Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Flows in networks. Combinatorial problems Graph partitioning Hub-location Information retrieval. Graph Integer programming Internet IP (Internet Protocol) Logistics Networks Operational research and scientific management Operational research. Management science Operations Research Optimization algorithms Partitioning Position (location) Routing Routing (telecommunications) Size constrained clique partitioning Software Studies Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0305-0548 1873-765X 0305-0548
DOI:	10.1016/j.cor.2010.07.014