OASIcs.ATMOS.2012.120.pdf
- Filesize: 0.67 MB
- 12 pages
Document
Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure
Authors
-
Part of:
Volume:
12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2012)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2012-09-13
Cite As Get BibTex
Banafsheh Khosravi, Julia A. Bennell, and Chris N. Potts. Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure. In 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 25, pp. 120-131, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/OASIcs.ATMOS.2012.120
Abstract
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.
Subject Classification
Keywords
- Train Scheduling and Rescheduling
- Job Shop Scheduling
- Shifting Bottleneck Procedure
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads