Prize-collecting Arc Routing Problems are arc routing problems where, in addition to the cost function, there is a profit function on the edges that must be taken into account only the first time that an edge is traversed. In this work we present the Clustered Prize-collecting Arc Routing Problem where there are clusters of arcs and, for each cluster, we require that either all its links are se...

Arc routing problems consist basically of finding one or several routes traversing a given set arcs and/or edges that must be serviced. The Close-Enough Routing Problem, Generalized Directed Rural Postman does not assume customers are located at specific arcs, but can serviced by any arc subset. Real-life applications include for meter reading, in which vehicle equipped with receiver travels st...

Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents shortest path between two locations. Studies on time-dependent followed this model and therefore defined speed functions graph. We argue that is often inadequate, particular for problems involving services edges of network. To fill gap, we formally define capacitated problem (TDCAR...

We consider a class of routing optimization problems on networks with deadlines imposed at a subset of nodes, and with uncertain arc travel times. The problems are static in the sense that routing decisions are made prior to the realization of uncertain travel times. The goal is to find optimal routing policies such that arrival times at nodes respect deadlines “as much as possible”. We propose...