The capacitated arc routing problem with refill points

This article introduces the capacitated arc routing problem with refill points (CARP–RP). The vehicle servicing arcs must be refilled on the spot by using a second vehicle. The problem consists on simultaneously determining the vehicles routes that minimize the total cost. An integer linear programming model is proposed and tested.