We present a Variable Neighborhood Search heuristic for the rolling stock rescheduling problem. Rolling stock rescheduling is needed when a disruption leads to cancellations in the timetable. In rolling stock rescheduling, we then assign duties, i.e., sequences of trips, to the available train units in such a way that both passenger comfort and operational performance are taken into account. For our heuristic, we introduce three neighborhoods that can be used for rolling stock rescheduling, which respectively focus on swapping duties between train units, on improving the individual duties and on changing the shunting that occurs between trips. These neighborhoods are used for both a Variable Neighborhood Descent local search procedure and for perturbing the current solution in order to escape from local optima. We apply our heuristic to instances of Netherlands Railways (NS). The results show that the heuristic is able to find high-quality solutions in a reasonable amount of time. This allows rolling stock dispatchers to use our heuristic in real-time rescheduling.

, ,
Econometric Institute Research Papers
Department of Econometrics

Hoogervorst, R., Dollevoet, T., Maróti, G., & Huisman, D. (2019, December). A Variable Neighborhood Search Heuristic for Rolling Stock Rescheduling. Econometric Institute Research Papers. Retrieved from http://hdl.handle.net/1765/122716