The capacitated vehicle routing problem with reloads

In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational results