Construction of Timetables Based on Periodic Event Scheduling

Jonas Christoffer Villumsen

AbstractThis thesis deals with scheduling of periodic timetables for railways. The model is based on the Periodic Event Scheduling Problem (PESP) formulated in terms of some cycle basis of the constraint graph.

Important properties of the PESP relevant for train scheduling such as sequencing and matching are examined. Constraints appearing in timetable planning are identified and formulated using the PESP, and integration with other planning phases are achieved, partly by extending the PESP model. In particular, aspects of lineplanning is introduced into the model by matching of predefined linesegments.

Instances are created and solved for the Copenhagen commuter train service S-train. The main objective is to minimise the number of required train units used to operate the service, and thereby the estimated operating costs. Simultaneously, minimising passenger waiting times for certain connections is also attemted for one instance. In general, results show that solutions can easily be obtained for basic instances, where lineplanning is not considered. When lineplanning is allowed, the complexity and solution time increases significantly.

For periodic train networks the method seems to be a relevant alternative to existing manual or ad-hoc timetabling mehtods, since it is based on a widely recognised mathematical model and is able to integrate most aspects of timetabling and some aspects of lineplanning, leading to better solutions in some cases.
TypeMaster's thesis [Academic thesis]
Year2006
PublisherInformatics and Mathematical Modelling, Technical University of Denmark, DTU
AddressRichard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby
SeriesIMM-Thesis-2006-52
NoteSupervised by Jens Clausen, IMM.
Electronic version(s)[pdf] [ps]
BibTeX data [bibtex]
IMM Group(s)Operations Research