In dense railway networks, infrastructure capacity is a great limitation and the planning tasks become more complex and time consuming. We propose a new two-stage model for solving a robust periodic timetabling problem that aims at finding a timetable that uses minimally the existing capacity and maximizes the robustness. The experimental results report high quality timetables and give an insight in appropriate objective functions. Finally, the computational times are promising for practical uses.
|Number of pages||1|
|Publication status||Published - Nov 2015|
|Event||2015 INFORMS Annual Meeting - Philadelphia, United States|
Duration: 1 Nov 2015 → 4 Nov 2015
|Conference||2015 INFORMS Annual Meeting|
|Period||1/11/15 → 4/11/15|