Highlights We analyze an adjustable robustness extension of the Periodic Timetabling Problem. By using a Linear Decision Rule, we can deal with an infinite number of scenarios. Our approach is demonstrated on relevant real-life timetabling problems.
Abstract 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.
An adjustable robust optimization approach for periodic timetabling
Transportation Research Part B: Methodological ; 128 ; 50-68
2019-07-22
19 pages
Article (Journal)
Electronic Resource
English
Springer Verlag | 2018
|An integrated micro–macro approach to robust railway timetabling
Online Contents | 2016
|An integrated micro–macro approach to robust railway timetabling
Elsevier | 2016
|