The Multi-Depot Rural Postman Problem

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 Postman

Scheduled

F4 Routing 3
October 2, 2015  5:00 PM
Salón de actos

Other papers in the same session

On the Hierarchical Mixed Rural Postman Problem

M. Colombi, Á. Corberán, R. Mansini, I. Plana, J. M. Sanchis Llopis

Formulations and exact algorithms for the Distance Constrained Generalized Directed Rural Postman Problem

Á. Corberán, I. Plana, J. M. Sanchis Llopis

Organizers

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.