Assessment of flexible timetables in real-time traffic management of a railway bottleneck

A standard practice to improve punctuality of railway services is the addition of time reserves in the timetable to recover perturbations occurring in operations. However, time reserves reduce line capacity, and the amount of time reserves that can be inserted in congested areas is, therefore, limited. In this paper, we investigate the new concept of flexible timetable as an effective policy to improve punctuality without decreasing the capacity usage of the lines. The principle of a flexible timetable is to plan less in the timetable and to solve more inter-train conflicts during operations. The larger degree of freedom left to real-time management offers better chance to recover disturbances. We illustrate a detailed model for conflict resolution, based on the alternative graph formulation, and analyze different algorithms for resolving conflicts, based on simple local rules or global optimization. We compare the solutions obtained for different levels of flexibility and buffer time inserted in the timetable. An extensive computational study, based on a bottleneck area of the Dutch railway network, confirms that flexibility is a promising concept to improve train punctuality and to increase the throughput of a railway network.

[1]  Dario Pacciarelli,et al.  Train Scheduling in a Regional Railway Network , 2001 .

[2]  Malachy Carey,et al.  Properties of expected costs and performance measures in stochastic models of scheduled transport , 1995 .

[3]  D. R. Ward,et al.  Description of the Situation , 2001 .

[4]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[5]  J. Carlier.  The one-machine sequencing problem , 1982 .

[6]  Ismail Sahin,et al.  Railway traffic control and train scheduling based oninter-train conflict management , 1999 .

[7]  A. Schaafsma,et al.  Dynamisch Railverkeersmanagement besturingsconcept voor railverkeer op basis van het Lagenmodel Verkeer en Vervoer , 2001 .

[8]  Ravindra K. Ahuja,et al.  Network Models in Railroad Planning and Scheduling , 2005 .

[9]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[10]  A. D. Middelkoop,et al.  Simulation Of Traffic Management With FRISO , 2006 .

[11]  Ulrich Weidmann,et al.  Computers in railways XIV , 1994 .

[12]  S. H. Hong,et al.  Railway conflict detection and resolution in the Korean railway system , 2004 .

[13]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[14]  I. A. Hansen,et al.  System analysis of train operations and track occupancy at railway stations , 2005 .

[15]  Robert C. Leachman,et al.  An exact solution procedure to determine the optimal dispatching times for complex rail networks , 2006 .

[16]  Dario Pacciarelli,et al.  A branch and bound algorithm for scheduling trains in a railway network , 2007, Eur. J. Oper. Res..

[17]  M. J Dorfman,et al.  Scheduling trains on a railway network using a discrete event model of railway traffic , 2004 .

[18]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[19]  Johanna Törnquist,et al.  Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms , 2005, ATMOS.