Flexible Connections in PESP Models for Cyclic Passenger Railway Timetabling
Authors:
- 1 February 2014
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 48 (1) , 136-154
Abstract
In this paper we describe how rolling stock and passenger connections in a cyclic railway timetable can be modeled in a flexible way within the model for the Periodic Event-Scheduling Problem (PESP). Usually, PESP models assume that the constraints for rolling stock or passenger connections specify in detail which trains should connect with each other. However, the flexibility described in this paper allows the model to choose which trains should connect with each other in a rolling stock or passenger connection. We express the connection times in a minimum matching of arriving and departing trains in terms of certain process time variables. We also describe an abstract framework demonstrating that, under certain conditions, the extra flexibility can be modeled purely in terms of PESP constraints. The concept of flexible rolling stock and passenger connections is illustrated by an example based on three intercity lines of Netherlands Railways.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- The New Dutch Timetable: The OR RevolutionInterfaces, 2009
- Stochastic improvement of cyclic railway timetablesTransportation Research Part B: Methodological, 2008
- When Periodic Timetables Are Suboptimal2008
- Constructing periodic timetables using MIP - a case study from DSB S-trainInternational Journal of Operational Research, 2006
- Symmetry for Periodic Railway TimetablesElectronic Notes in Theoretical Computer Science, 2004
- A Variable Trip Time Model for Cyclic Railway TimetablingTransportation Science, 2003
- Decision Support Systems Support the Search for Win-Win Solutions in Railway Network DesignInterfaces, 1999
- A constraint generation algorithm for the construction of periodic railway timetablesTransportation Research Part B: Methodological, 1996
- A Mathematical Model for Periodic Scheduling ProblemsSIAM Journal on Discrete Mathematics, 1989