Change search
ReferencesLink to record
Permanent link

Direct link
Optimization-Based Methods for Revising Train Timetables with Focus on Robustness
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
2016 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

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.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1763
National Category
Control Engineering Computational Mathematics Transport Systems and Logistics Signal Processing Computer Science
Identifiers
URN: 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
Presentation
2016-12-06, Täppan, TP2, Campus Norrköping, Linköpings Universitet, Norrköping, 10:15 (English)
Opponent
Supervisors
Available from: 2016-12-01 Created: 2016-12-01 Last updated: 2016-12-01Bibliographically approved
List of papers
1. Robustness Improvements in a Train Timetable with Travel Time Dependent Minimum Headways
Open this publication in new window or tab >>Robustness Improvements in a Train Timetable with Travel Time Dependent Minimum Headways
2015 (English)Conference paper (Other academic)
Abstract [en]

In a railway network with dense traffic, trains’ scheduled arrival and departure times arehighly dependent on each other and even a small delay easily propagates to subsequenttrains using the same infrastructure resources. In the current paper a given timetable is comparedto a modified timetable, where the assigned minimum time slot in the traffic for aservice is linearly increasing with the service’s travel time. The underlying assumption isthat trains lose precision as they travel longer and catching a fixed-size time slot is easier atthe beginning of the journey. Real world observations confirm this assumption as well. Theaim of this study is to verify the improvement in the robustness of those timetables that aremodified with respect to the idea of travel time dependent reserved time slots for the arrivaltimes of trains and to compare the results with the initial timetables. Numerical experimentsare conducted on a selected double track segment of the Swedish Southern mainline. Fourtimetable case studies are considered for the experiments: off-peak hours and peak hoursin 2011 and 2014, respectively. Each timetable is tested for various disturbance scenarios.Several performance measures are used to evaluate delay propagation in the timetables, includingdeviations from the initial timetable, total delays, total number of delayed trains atdestinations, number of punctual trains with 5 minutes arrival delay tolerance at destinationsand number of violations in trains’ overtaking orders. Results show that the modifiedtimetables outperform the initial ones for small disturbances.

Keyword
Robustness, Railway Timetable, Ex-post measures, Delay propagation, Performance measures
National Category
Transport Systems and Logistics
Identifiers
urn:nbn:se:liu:diva-117042 (URN)
Conference
6th International Conference on Railway Operations Modelling and Analysis - RailTokyo2015, Tokyo, March 23-26, 2015
Available from: 2015-04-13 Created: 2015-04-13 Last updated: 2016-12-01

Open Access in DiVA

Optimization-Based Methods for Revising Train Timetables with Focus on Robustness(491 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 491 kBChecksum SHA-512
edeefb75acf26d96294d2ffe327f7945b137d9335b99b92c88fd6e84b3cabe4888be0f91d5ae9c5ad48ae43b3e9812be963f2a2a5236efb562273a4f1598ba91
Type fulltextMimetype application/pdf
omslag(2702 kB)3 downloads
File information
File name COVER01.pdfFile size 2702 kBChecksum SHA-512
df15fd5ba6cc946a644af4ae6411da78410eea457709dee9f9be928fe2f0112bfe8f6219358e8fbe272c320f2652f1d2c6414c42fd1c573ae1ab047bba27152e
Type coverMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Khoshniyat, Fahimeh
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Control EngineeringComputational MathematicsTransport Systems and LogisticsSignal ProcessingComputer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 27 hits
ReferencesLink to record
Permanent link

Direct link