Conflict-free railway track assignment at depots

Gilg, Brady and Klug, Torsten and Martienssen, Rosemarie and Paat, Joseph and Schlechte, Thomas and Schulz, Christof and Seymen, Senan and Tesch, Alexander (2018) Conflict-free railway track assignment at depots. Journal of Rail Transport Planning and Management, 8 (1). pp. 16-28. ISSN 2210-9706 (Print) 2210-9714 (Online)

Full text not available from this repository. (Request a copy)


Managing rolling stock with no passengers aboard is a critical component of railway operations. One aspect of managing rolling stock is to park the rolling stock on a given set of tracks at the end of a day or service. Depending on the parking assignment, shunting may be required in order for a parked train to depart or for an incoming train to park. Given a collection of tracks ℳ and a collection of trains T with a fixed arrival-departure timetable, the train assignment problem (TAP) is to determine the maximum number of trains from T that can be parked on ℳ according to the timetable and without the use of shunting. Hence, efficiently solving the TAP allows to quickly compute feasible parking schedules that do not require further shunting adjustments. In this paper, we show that the TAP is NP-hard and present two integer programming models for solving the TAP. We compare both models on a theoretical level. Moreover, to our knowledge, we consider the first approach that integrates track lengths along with the three most common types of parking tracks FIFO, LIFO and FREE tracks in a common model. Furthermore, to optimize against uncertainty in the arrival times of the trains we extend our models by stochastic and robust modeling techniques. We conclude by giving computational results for both models, observing that they perform well on real timetables.
Item Type: Article
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Industrial Engineering
Faculty of Engineering and Natural Sciences
Depositing User: IC-Cataloging
Date Deposited: 30 Jul 2023 21:49
Last Modified: 30 Jul 2023 21:49

Actions (login required)

View Item
View Item