Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/243467
Type: Artigo
Title: Solving a variant of the hub location-routing problem
Author: Lopes, Mauro Cardoso
Queiroz, Thiago Alves de
Andrade, Carlos Eduardo de
Miyazawa, Flávio Keidi
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.
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
Subject: Problema de localização e alocação de terminais
Roteamento (Administração de redes de computadores)
Algoritmos branch-and-cut
Algoritmos genéticos
Heurística (Computação)
Country: Alemanha
Editor: Springer
Citation: Solving A Variant Of The Hub Location-routing Problem. Springer-verlag Berlin, p. 395-400 2015.
Rights: fechado
fechado
Identifier DOI: 10.1007/978-3-662-43871-8_58
Address: http://link.springer.com/chapter/10.1007%2F978-3-662-43871-8_58
Date Issue: 2015
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000358424900058.pdf759.24 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.