An adjustable robust optimization approach for periodic timetabling

G. J. Polinder, Thomas Breugem, Twan Dollevoet, Gábor Maróti

Research output: Contribution to JournalArticleAcademicpeer-review

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.

Original languageEnglish
Pages (from-to)50-68
Number of pages19
JournalTransportation Research Part B: Methodological
Volume128
Early online date6 Aug 2019
DOIs
Publication statusPublished - Oct 2019

Fingerprint

uncertainty
German Federal Railways
Netherlands
Uncertainty
efficiency
literature

Keywords

  • Adjustable robustness
  • Periodic event scheduling
  • Periodic timetabling
  • Robust optimization

Cite this

Polinder, G. J. ; Breugem, Thomas ; Dollevoet, Twan ; Maróti, Gábor. / An adjustable robust optimization approach for periodic timetabling. In: Transportation Research Part B: Methodological. 2019 ; Vol. 128. pp. 50-68.
@article{4cb44809e49745c3ac392149b6bc1625,
title = "An adjustable robust optimization approach for periodic timetabling",
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.",
keywords = "Adjustable robustness, Periodic event scheduling, Periodic timetabling, Robust optimization",
author = "Polinder, {G. J.} and Thomas Breugem and Twan Dollevoet and G{\'a}bor Mar{\'o}ti",
year = "2019",
month = "10",
doi = "10.1016/j.trb.2019.07.011",
language = "English",
volume = "128",
pages = "50--68",
journal = "Transportation Research. Part B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

An adjustable robust optimization approach for periodic timetabling. / Polinder, G. J.; Breugem, Thomas; Dollevoet, Twan; Maróti, Gábor.

In: Transportation Research Part B: Methodological, Vol. 128, 10.2019, p. 50-68.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - An adjustable robust optimization approach for periodic timetabling

AU - Polinder, G. J.

AU - Breugem, Thomas

AU - Dollevoet, Twan

AU - Maróti, Gábor

PY - 2019/10

Y1 - 2019/10

N2 - 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.

AB - 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.

KW - Adjustable robustness

KW - Periodic event scheduling

KW - Periodic timetabling

KW - Robust optimization

UR - http://www.scopus.com/inward/record.url?scp=85073708039&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073708039&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2019.07.011

DO - 10.1016/j.trb.2019.07.011

M3 - Article

VL - 128

SP - 50

EP - 68

JO - Transportation Research. Part B: Methodological

JF - Transportation Research. Part B: Methodological

SN - 0191-2615

ER -