A heuristic method for the capacitated arc routing problem with refill points and multiple loads

We describe a solution procedure for a capacitated arc routing problem with refill points and multiple loads. This problem stems from the road network marking in Quebec, Canada. Two different types of vehicles are used: the first type (called servicing vehicle–SV) with a finite capacity to service the arcs and the other (called refilling vehicle–RV) to refill the SV vehicle. The RV can deliver multiple loads, which means that it meets the SV several times before returning to the depot. The problem consists of simultaneously determining the vehicle routes that minimize the total cost of the two vehicles. We present an integer formulation and a route first-cluster second heuristic procedure. Computational results are provided.