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 language | English |
|---|---|
| Pages (from-to) | 50-68 |
| Number of pages | 19 |
| Journal | Transportation Research Part B: Methodological |
| Volume | 128 |
| Early online date | 6 Aug 2019 |
| DOIs | |
| Publication status | Published - Oct 2019 |
Fingerprint
Keywords
- Adjustable robustness
- Periodic event scheduling
- Periodic timetabling
- Robust optimization
Cite this
}
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 Journal › Article › Academic › peer-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 -