A comparison of two exact methods for passenger railway rolling stock (re)scheduling

J.T. Haahr, Joris Wagenaar, L. Veelenturf, L. Kroon

Research output: Contribution to journalArticleScientificpeer-review

Abstract

The assignment of rolling stock units to timetable services in passenger railways is an important optimization problem that has been addressed by many papers in different forms. Solution approaches have been proposed for different planning phases: strategic, tactical, operational, and real-time planning. In this paper we compare two approaches within the operational and real-time planning phase. The first exact approach is based on a known Mixed Integer Linear Program (MILP) which is solved using CPLEX. The second approach is a new method that is an extension of a recently introduced MILP, which is solved using a column and row generation approach. In this paper, we benchmark the performance of the methods on networks of two countries (Denmark and The Netherlands). We use the approaches to make daily schedules and we test their real time applicability by performing tests with different disruption scenarios. The computational experiments demonstrate that both models can be used on both networks and are able to find optimal rolling stock circulations in the different planning phases. Furthermore, the results show that both approaches are sufficiently fast to be used in a real-time setting.
Original languageEnglish
Pages (from-to)15-32
JournalTransportation Research Part E: Logistics and Transportation Review
Volume91
DOIs
Publication statusPublished - Jul 2016
Externally publishedYes

Fingerprint

time planning
scheduling
German Federal Railways
Scheduling
Planning
planning
Denmark
Netherlands
scenario
experiment
performance
time
Rescheduling
Railway
Experiments

Cite this

@article{e1ccaa9348c145beb324d43e5d953299,
title = "A comparison of two exact methods for passenger railway rolling stock (re)scheduling",
abstract = "The assignment of rolling stock units to timetable services in passenger railways is an important optimization problem that has been addressed by many papers in different forms. Solution approaches have been proposed for different planning phases: strategic, tactical, operational, and real-time planning. In this paper we compare two approaches within the operational and real-time planning phase. The first exact approach is based on a known Mixed Integer Linear Program (MILP) which is solved using CPLEX. The second approach is a new method that is an extension of a recently introduced MILP, which is solved using a column and row generation approach. In this paper, we benchmark the performance of the methods on networks of two countries (Denmark and The Netherlands). We use the approaches to make daily schedules and we test their real time applicability by performing tests with different disruption scenarios. The computational experiments demonstrate that both models can be used on both networks and are able to find optimal rolling stock circulations in the different planning phases. Furthermore, the results show that both approaches are sufficiently fast to be used in a real-time setting.",
author = "J.T. Haahr and Joris Wagenaar and L. Veelenturf and L. Kroon",
year = "2016",
month = "7",
doi = "10.1016/j.tre.2016.03.019",
language = "English",
volume = "91",
pages = "15--32",
journal = "Transportation Research Part E: Logistics and Transportation Review",
issn = "1366-5545",
publisher = "Elsevier Limited",

}

A comparison of two exact methods for passenger railway rolling stock (re)scheduling. / Haahr, J.T.; Wagenaar, Joris; Veelenturf, L.; Kroon, L.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 91, 07.2016, p. 15-32.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A comparison of two exact methods for passenger railway rolling stock (re)scheduling

AU - Haahr, J.T.

AU - Wagenaar, Joris

AU - Veelenturf, L.

AU - Kroon, L.

PY - 2016/7

Y1 - 2016/7

N2 - The assignment of rolling stock units to timetable services in passenger railways is an important optimization problem that has been addressed by many papers in different forms. Solution approaches have been proposed for different planning phases: strategic, tactical, operational, and real-time planning. In this paper we compare two approaches within the operational and real-time planning phase. The first exact approach is based on a known Mixed Integer Linear Program (MILP) which is solved using CPLEX. The second approach is a new method that is an extension of a recently introduced MILP, which is solved using a column and row generation approach. In this paper, we benchmark the performance of the methods on networks of two countries (Denmark and The Netherlands). We use the approaches to make daily schedules and we test their real time applicability by performing tests with different disruption scenarios. The computational experiments demonstrate that both models can be used on both networks and are able to find optimal rolling stock circulations in the different planning phases. Furthermore, the results show that both approaches are sufficiently fast to be used in a real-time setting.

AB - The assignment of rolling stock units to timetable services in passenger railways is an important optimization problem that has been addressed by many papers in different forms. Solution approaches have been proposed for different planning phases: strategic, tactical, operational, and real-time planning. In this paper we compare two approaches within the operational and real-time planning phase. The first exact approach is based on a known Mixed Integer Linear Program (MILP) which is solved using CPLEX. The second approach is a new method that is an extension of a recently introduced MILP, which is solved using a column and row generation approach. In this paper, we benchmark the performance of the methods on networks of two countries (Denmark and The Netherlands). We use the approaches to make daily schedules and we test their real time applicability by performing tests with different disruption scenarios. The computational experiments demonstrate that both models can be used on both networks and are able to find optimal rolling stock circulations in the different planning phases. Furthermore, the results show that both approaches are sufficiently fast to be used in a real-time setting.

U2 - 10.1016/j.tre.2016.03.019

DO - 10.1016/j.tre.2016.03.019

M3 - Article

VL - 91

SP - 15

EP - 32

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

SN - 1366-5545

ER -