CRT, GERAD, and Department of Mathematics and Industrial Engineering, École Polytechnique de Montréal, C.P. 6079, Succ. Centre-ville, Montréal, Qué., Canada H3C 3A7
Abstract:
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.