Finding Delay-Tolerant Train Routings through Stations

Gabrio Caimi (), Dan Burkolter () and Thomas Herrmann ()
Additional contact information
Gabrio Caimi: Swiss Federal Institute of Technology
Dan Burkolter: Swiss Federal Institute of Technology
Thomas Herrmann: Swiss Federal Institute of Technology

A chapter in Operations Research Proceedings 2004, 2005, pp 136-143 from Springer

Abstract: Abstract Currently, many railway operators are increasing the frequencies of their trains. By condensing the timetable, routing trains becomes increasingly difficult as the chosen routes not only have to meet safety restrictions, but also guarantee some stability if delays occur. We address the problem of routing trains through railway stations for a given timetable and outline two algorithms. The first algorithm searches for a feasible solution for the train routing problem based on an independent set modeling that is solved using a fixed-point iteration method. The initial solution is then amended by applying the second algorithm in order to increase the time slot of a chosen route, i.e. the time interval during which a train may arrive and find its designated route open. This algorithm is based on a local search optimization scheme. Results showed that the fixed-point iteration found feasible solutions within minutes even for difficult cases, i.e. tight timetables. Though more time-consuming, the second algorithm allowed the average time slot length to be doubled, thus implying that it is possible to find routings which are more delay-tolerant. This helps to decrease impacts of late trains.

Keywords: Feasible Solution; Time Slot; Train Arrival; Choose Route; Railway Operator (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (9)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-540-27679-1_17

Ordering information: This item can be ordered from
http://www.springer.com/9783540276791

DOI: 10.1007/3-540-27679-3_17

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().