The Vehicle Rescheduling Problem with Retiming



When a vehicle breaks down in a 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). To incorporate delays, we expand the recovery network with retiming possibilities. As the network gets too large, we propose an iterative neighborhood exploration heuristic to solve the VRSPRT. Experiments show that by delaying one or two trips with on average 4 minutes, we can decrease the average number of cancelled trips with 30 percent.