Home > Research > Publications & Outputs > An experimental comparison of periodic timetabl...

Research

Links

Text available via DOI:

Keywords

View graph of relations

An experimental comparison of periodic timetabling models

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

An experimental comparison of periodic timetabling models. / Siebert, Michael; Goerigk, Marc.
In: Computers and Operations Research, Vol. 40, No. 10, 10.2013, p. 2251-2259.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Siebert, M & Goerigk, M 2013, 'An experimental comparison of periodic timetabling models', Computers and Operations Research, vol. 40, no. 10, pp. 2251-2259. https://doi.org/10.1016/j.cor.2013.04.002

APA

Siebert, M., & Goerigk, M. (2013). An experimental comparison of periodic timetabling models. Computers and Operations Research, 40(10), 2251-2259. https://doi.org/10.1016/j.cor.2013.04.002

Vancouver

Siebert M, Goerigk M. An experimental comparison of periodic timetabling models. Computers and Operations Research. 2013 Oct;40(10):2251-2259. Epub 2013 Apr 11. doi: 10.1016/j.cor.2013.04.002

Author

Siebert, Michael ; Goerigk, Marc. / An experimental comparison of periodic timetabling models. In: Computers and Operations Research. 2013 ; Vol. 40, No. 10. pp. 2251-2259.

Bibtex

@article{2a10f6fb971a4d42a1a47ed9567d77de,
title = "An experimental comparison of periodic timetabling models",
abstract = "In the Periodic Timetabling Problem, vehicle arrivals and departures need to be scheduled over a periodically repeating time horizon. Its relevance and applicability have been demonstrated by several real-world implementations, including the Netherlands railways and the Berlin subway. In this work, we consider the practical impact of two possible problem variations: firstly, how passenger paths are handled, and secondly, how line frequencies are included. In computational experiments on real-world and close-to real-world networks, we can show that passenger travel times can significantly benefit from extended models.",
keywords = "Event activity networks, Integrated passenger routing, Iterative timetabling, Periodic timetabling",
author = "Michael Siebert and Marc Goerigk",
year = "2013",
month = oct,
doi = "10.1016/j.cor.2013.04.002",
language = "English",
volume = "40",
pages = "2251--2259",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "10",

}

RIS

TY - JOUR

T1 - An experimental comparison of periodic timetabling models

AU - Siebert, Michael

AU - Goerigk, Marc

PY - 2013/10

Y1 - 2013/10

N2 - In the Periodic Timetabling Problem, vehicle arrivals and departures need to be scheduled over a periodically repeating time horizon. Its relevance and applicability have been demonstrated by several real-world implementations, including the Netherlands railways and the Berlin subway. In this work, we consider the practical impact of two possible problem variations: firstly, how passenger paths are handled, and secondly, how line frequencies are included. In computational experiments on real-world and close-to real-world networks, we can show that passenger travel times can significantly benefit from extended models.

AB - In the Periodic Timetabling Problem, vehicle arrivals and departures need to be scheduled over a periodically repeating time horizon. Its relevance and applicability have been demonstrated by several real-world implementations, including the Netherlands railways and the Berlin subway. In this work, we consider the practical impact of two possible problem variations: firstly, how passenger paths are handled, and secondly, how line frequencies are included. In computational experiments on real-world and close-to real-world networks, we can show that passenger travel times can significantly benefit from extended models.

KW - Event activity networks

KW - Integrated passenger routing

KW - Iterative timetabling

KW - Periodic timetabling

U2 - 10.1016/j.cor.2013.04.002

DO - 10.1016/j.cor.2013.04.002

M3 - Journal article

AN - SCOPUS:84878116476

VL - 40

SP - 2251

EP - 2259

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 10

ER -