An adjustable robust optimization approach for periodic timetabling

In this paper, the authors 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. The authors 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. The authors 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, the authors show that the trade-off between the efficiency and robustness of a timetable can be analyzed using their solution method.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01719374
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Oct 15 2019 5:07PM