Skip to content

Train scheduling and rescheduling in the UK with a modified shifting bottleneck procedure

Research output: Chapter in Book/Report/Conference proceedingConference contribution

This paper introduces a modified shifting bottleneck approach to solve train scheduling and rescheduling problems. The problem is formulated as a job shop scheduling model and a mixed integer linear programming model is also presented. The shifting bottleneck procedure is a well-established heuristic method for obtaining solutions to the job shop and other machine scheduling problems. We modify the classical shifting bottleneck approach to make it suitable for the types of job shop problem that arises in train scheduling. The method decomposes the problem into several single machine problems. Different variations of the method are considered with regard to solving the single machine problems. We compare and report the performance of the algorithms for a case study based on part of the UK railway network.
Original languageEnglish
Title of host publication12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
EditorsDaniel Delling, Leo Liberti
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Pages120-131
Number of pages12
Volume25
ISBN (Print)978-3939897453
DOIs
Publication statusPublished - 13 Sep 2012
Event12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - Ljubljana, Slovenia
Duration: 13 Sep 201213 Sep 2012

Publication series

NameOpenAccess Series in Informatics (OASIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Workshop

Workshop12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
CountrySlovenia
CityLjubljana
Period13/09/1213/09/12

Related information

Relations Get citation (various referencing formats)

ID: 6665735