A branch-and-bound approach for robust railway timetabling

This paper studies the robust cyclic timetabling problem. The goal is to modify a given reference timetable to enhance its robustness against small stochastic disturbances. The robustness is measured by the expected total delay of the realised timetable. Kroon et al. (Transp Res Part B 42(6):553–570, 2008) propose a stochastic programming approach and implement it for Netherlands Railways (NS). While the model’s outcome is accepted by practitioners, relevant planning problems are rendered intractable by computation times of up to several days. In this paper we describe a Branch-and-Bound algorithm for solving the stochastic program of Kroon et al. (Transp Res Part B 42(6):553–570, 2008). We propose specific node selection rules, variable selection rules, constructive heuristics and lower bounds. We carry out computational tests on large real-life problem instances. The results confirm that our algorithm is able to considerably improve the robustness of the reference solutions. This is achieved with computation times of a few minutes. However, the weak lower bounds we use leave a considerable optimality gap. Therefore, our algorithm is best described as a heuristic solution method.

  • Record URL:
  • Availability:
  • Supplemental Notes:
    • © 2017 Gábor Maróti The contents of this paper reflect the views of the author and do not necessarily reflect the official views or policies of the Transportation Research Board or the National Academy of Sciences.
  • Authors:
  • Publication Date: 2017-7


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01641156
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jul 17 2017 9:33AM