J. Rodríguez Pereira, E. Fernández
In this work, we study an extension of the Rural Postman Problem, where we assume that there are several depots, instead of only one, from which routes must be made to satisfy the demand, located at the edges of a graph. Optimality conditions of solutions are studied and a formulation based on these conditions is proposed. We study the separation problem for exponential size constraints families. We present and analyse the results of some computational experiments.
Keywords: Multi-Depot, Arc-Routing, Rural PostmanScheduled
F4 Routing 3
October 2, 2015 5:00 PM
Salón de actos