Anders Peterson
Communications and Transport Systems, ITN, Linköping University, Norrköping, Sweden
Valentin Polishchuk
Communications and Transport Systems, ITN, Linköping University, Norrköping, Sweden
Christiane Schmidt
Communications and Transport Systems, ITN, Linköping University, Norrköping, Sweden
Download article
Published in: RailNorrköping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), Norrköping, Sweden, June 17th – 20th, 2019
Linköping Electronic Conference Proceedings 69:62, p. 964-977
Published: 2019-09-13
ISBN: 978-91-7929-992-7
ISSN: 1650-3686 (print), 1650-3740 (online)
Railway timetabling is a prominent research area in railway research. The timetable is usually shown as a time-space diagram. However, even algorithms that try to adapt/add to an existing timetable rely mainly on mixed integer programming, but do not use the geometric representation of the timetable. In this paper, we consider the problem of determining residual train paths in an existing timetable. We aim to restrict possible disturbance on existing (passenger) traffic, and, hence, insert train paths of a specified minimum temporal distance to other trains. We show how we can extend algorithms for thick paths in polygonal domains to compute the maximum number of trains with a specified robustness to insert.
