The capacitated vehicle routing problem is to find a routing schedule describing the order in which geographically dispersed customers are visited to satisfy demand by supplying goods stored at the depot, such that the traveling costs are minimized. In many practical applications, a long term routing schedule has to be made for operational purposes, often based on average demand estimates. When demand substantially differs, constructing a new schedule is beneficial. The vehicle rescheduling problem is to find 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 two mathematical programming formulations of the rescheduling problem are presented as well as two heuristic methods, a two-phase heuristic and a modified savings heuristic. Computational and analytical results show that for sufficiently high deviation costs, the two-phase heuristic generates a schedule that is on average close to optimal or even guaranteed optimal, for all considered problem instances. The modified savings heuristic generates schedules of constant quality, however the two-phase heuristic produces schedules that are on average closer to the optimum.

Additional Metadata
Keywords operational planning, vehicle rescheduling problem, vehicle routing
Publisher Erasmus School of Economics (ESE)
Persistent URL hdl.handle.net/1765/17350
Citation
Spliet, R, Gabor, A.F, & Dekker, R. (2009). The Vehicle Rescheduling Problem (No. EI 2009-43). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–17). Erasmus School of Economics (ESE). Retrieved from http://hdl.handle.net/1765/17350