Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path
Fredrik Ljunggren (),
Kristian Persson (),
Anders Peterson () and
Christiane Schmidt ()
Additional contact information
Fredrik Ljunggren: Linköping University
Kristian Persson: Linköping University
Anders Peterson: Linköping University
Christiane Schmidt: Linköping University
Public Transport, 2021, vol. 13, issue 3, No 8, 597-623
Abstract:
Abstract We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.
Keywords: Railway timetabling; Robust train path; Bottleneck train path; Network algorithm; Freight transportation (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s12469-020-00253-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:pubtra:v:13:y:2021:i:3:d:10.1007_s12469-020-00253-x
Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12469
DOI: 10.1007/s12469-020-00253-x
Access Statistics for this article
Public Transport is currently edited by Stefan Voß
More articles in Public Transport from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().