Meta-Heuristic for inserting a robust train path in a non-cyclic timetable

William Erlandson, Carl Henrik Häll, Anders Peterson and Christiane Schmidt

Transportation Planning and Technology, 2023, vol. 46, issue 7, 842-863

Abstract: Many freight trains depart Swedish marshalling yards before or after their planned departure times. Today, a deviating departure time is allowed if no conflicting train path can be found a few stations ahead. This increases the risk that the train might be delayed to its destination and cause delays to other trains. We present a meta-heuristic that modifies a timetable by adding a train path (for our freight train) and, if necessary, adjusting surrounding train paths. The aim of the insertion of the additional train path and the adjustments of the existing ones is to obtain a large bottleneck robustness, that is, the largest possible minimal temporal distance to any other train in the timetable. We provide experimental results for a Swedish railway stretch with a non-cyclic timetable and heterogeneous traffic. We show that we quickly add a train path, while improving the robustness of the timetable.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2023.2239208 (text/html)
Access to full text is restricted to subscribers.

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:taf:transp:v:46:y:2023:i:7:p:842-863

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20

DOI: 10.1080/03081060.2023.2239208

Access Statistics for this article

Transportation Planning and Technology is currently edited by Dr. David Gillingwater

More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().