Por Diego Ruiz Hernández. Sheffield University Management School
INARBE organiza este seminario que se impartirá el 22 de noviembre a las 12,00h. en la sala de conferencias del edificio Jerónimo de Ayanz.
In this work we address the problem of a mailing company that has to visit a large subset of streets for delivering mail in a city. The problem is modelled as an acr routing problem (a variant of the so-called Chinese postman problem) where operators are expected to traverse (and serve) the complete set of arcs in their delivery region. Because of the limited number of operators working for the company, the first stage of the problem is to define areas of delivery and assign a number of streets to be covered by each of their operators (this is a variant of the team orienteering problem). Additionally, given the limited capacity of the trolleys, the operators must make several replenishment stops, where their trolleys will be refilled. This implies the segmentation of the region in delivery-sub-regions, and the location of the replenishment points. This is a problem of high complexity that combines, districting, location and arc-routing problems. A solution heuristic is developed and illustrated with examples from the city of Pamplona.