The capacitated vehicle routing problem (CVRP) is the problem of finding a routing schedule to satisfy demand by supplying goods stored at the depot, such that the traveling costs are minimized. For operational purposes, in many practical applications a long term routing schedule is made, often based on average demand. When demand substantially differs from the average, constructing a new schedule is beneficial. The vehicle rescheduling problem (VRSP) is the problem of finding a new schedule that not only minimizes the total traveling costs but also minimizes the costs of deviating from the original schedule. In this paper a mathematical programming formulation of the rescheduling problem is presented as well as a heuristic solution method referred to as the two-phase heuristic. We provide sufficiency conditions for which it produces the optimal solution. Finally, we perform computational experiments to study the performance of the two-phase heuristic.

Additional Metadata
Keywords Operational planning, Rescheduling, Vehicle routing
Persistent URL dx.doi.org/10.1016/j.cor.2013.09.009, hdl.handle.net/1765/64009
Journal Computers & Operations Research
Citation
Spliet, R, Gabor, A.F, & Dekker, R. (2014). The vehicle rescheduling problem. Computers & Operations Research, 43(1), 129–136. doi:10.1016/j.cor.2013.09.009