An adjustable robust optimization approach for periodic timetabling
In this paper, we consider the Robust Periodic Timetabling Problem (RPTP), the problem of designing a periodic timetable that can easily be adjusted in case of small periodic disturbances. We develop a solution method for a parametrized class of uncertainty regions. This class relates closely to uncertainty regions known in the robust optimization literature, and naturally defines a metric for the robustness of the timetable. The proposed solution method combines a linear decision rule with well-known reformulation techniques and cutting-plane methods. We show that the RPTP can be solved for practical-sized instances by applying the solution method to practical cases of Netherlands Railways (NS). In particular, we show that the trade-off between the efficiency and robustness of a timetable can be analyzed using our solution method.
|Keywords||Adjustable robustness, Periodic event scheduling, Periodic timetabling, Robust optimization|
|Persistent URL||dx.doi.org/10.1016/j.trb.2019.07.011, hdl.handle.net/1765/120426|
|Journal||Transportation Research. Part B: Methodological|
Polinder, G.J. (G. J.), Breugem, T, Dollevoet, T.A.B, & Maróti, G. (2019). An adjustable robust optimization approach for periodic timetabling. Transportation Research. Part B: Methodological, 128, 50–68. doi:10.1016/j.trb.2019.07.011