Optimization-Based Methods for Revising Train Timetables with Focus on Robustness
2016 (English)Licentiate thesis, comprehensive summary (Other academic)
With increase in the use of railway transport, ensuring robustness in railway timetables has never been this important. In a dense railway timetable even a small disturbance can propagate easily and a_ect trains' arrival and departure times. In a robust timetable small delays are absorbed and knock-on e_ects are prevented e_ectively. The aim of this thesis is to study how optimization tools can support the generation of robust railway tra_c timetables. We address two Train Timetabling Problems (TTP) and for both problems we apply Mixed Integer Linear Programming (MILP) to solve them from network management perspectives. The _rst problem is how robustness in a given timetable can be assessed and ensured. To tackle this problem, a headway-based method is introduced. The proposed method is implemented in real timetables and evaluated from performance perspectives. Furthermore, the impact of the proposed method on capacity utilization, heterogeneity and the speed of trains, is monitored. Results show that the proposed method can improve robustness without imposing major changes in timetables. The second problem addressed in the thesis is how robustness can be assessed and maintained in a given timetable when allocating additional tra_c and maintenance slots. Di_erent insertion strategies are studied and their consequences on capacity utilization and on the properties of the timetables are analyzed. Two di_erent insertion strategies are considered: i) simultaneous and ii) stepwise insertion. The results show that inserting the additional trains simultaneously usually results in generating more optimal solutions. However, solving this type of problem is computationally challenging. We also observed that the existing robustness metrics cannot capture the essential properties of having more robust timetables. Therefore we proposed measuring Channel Width, Chan- nel Width Forward, Channel Width Behind and Track Switching.
Furthermore, the experimental analysis of the applied MILP model shows that some cases are computationally hard to solve and there is a need to decrease the computation time. Hence several valid inequalities are developed and their e_ects on the computation time are analyzed.
This thesis contains three papers which are appended. The results of this thesis are of special interests for railway tra_c planners and it would support their working process. However, railway tra_c operators and passengers also bene_t from this study.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. , 49 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1763
Control Engineering Computational Mathematics Transport Systems and Logistics Signal Processing Computer Science
IdentifiersURN: urn:nbn:se:liu:diva-132920DOI: 10.3384/lic.diva-132920Local ID: liu-tek-lic 2016ISBN: 9789176856314 (print)OAI: oai:DiVA.org:liu-132920DiVA: diva2:1051321
2016-12-06, Täppan, TP2, Campus Norrköping, Linköpings Universitet, Norrköping, 10:15 (English)
Harrod, Steven, Professor
Lundgren, Jan, ProfessorTörnquist Krasemann, Johanna, Dr.
List of papers