J. Rodriguez Pereira, E. Fernández Aréizaga, G. Laporte
Location and arc routing problems have been, and remain, as recurring problems, widely studied. Although these are two closely related problems, in most real situations, traditionally, they have been tackled independently.
In this work we consider models that combine location and arc routing, in which nodes must be selected where facilities may be established, and routes must be designed to serve a given set of required edges. Optimality conditions are studied and alternative formulations based on these conditions are proposed. To solve the problems, we present an exact branch-and-cut algorithm. Finally, numerical results from a series of computational experiments on a large set of benchmark instances are presented to analyze the behavior of the proposed method.
Palabras clave / Keywords: location, arc routing
Programado
Sesión GT04-2: Localización (GELOCA-2). Organizador: Antonio Manuel Rodríguez Chía
29 de mayo de 2018 17:00
Sala 3
