When a vehicle breaks down during operation in a public transportation system, the remaining vehicles can be rescheduled to minimize the impact of the breakdown. In this paper, we discuss the vehicle rescheduling problem with retiming (VRSPRT). The idea of retiming is that scheduling flexibility is increased, such that previously inevitable cancellations can be avoided. To incorporate delays, we expand the underlying recovery network with retiming possibilities. This leads to a problem formulation that can be solved using Lagrangian relaxation. As the network gets too large, we propose an iterative neighborhood exploration heuristic to solve the VRSPRT. This heuristic allows retiming for a subset of trips, and adds promising trips to this subset as the algorithm continues. Computational results indicate that the heuristic performs well. While requiring acceptable additional computation time, we find improvements over solutions that do not allow retiming in 58% of the tested instances. By delaying only one or two trips with on average 6–8 min, the average number of cancelled trips is reduced from 1.2 to 0.5.

Additional Metadata
Keywords Lagrangian heuristic, Retiming, Vehicle rescheduling
Persistent URL dx.doi.org/10.1016/j.cor.2018.04.008, hdl.handle.net/1765/106190
Journal Computers & Operations Research
van Lieshout, R.N, Mulder, J, & Huisman, D. (2018). The vehicle rescheduling problem with retiming. Computers & Operations Research, 96, 131–140. doi:10.1016/j.cor.2018.04.008