The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the vehicle servicing arcs has a finite capacity, and hence has to return to the depot or a secondary station to be refilled (or emptied). In contrast, in the 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 computational experiments are presented.
Paru en décembre 2004 , 12 pages