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

被引:83
作者
D'Ariano, Andrea [2 ]
Pacciarelli, Dario [1 ]
Pranzo, Marco [3 ]
机构
[1] Univ Roma Tre, Dipartimento Automat & Informat, I-00146 Rome, Italy
[2] Delft Univ Technol, Dept Transport & Planning, NL-2600 AA Delft, Netherlands
[3] Univ Siena, Dipartimento Ingn Informaz, I-53100 Siena, Italy
关键词
flexible timetable; conflict resolution; real-time train scheduling;
D O I
10.1016/j.trc.2007.07.006
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
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. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:232 / 245
页数:14
相关论文
共 23 条
[1]  
Ahuja R. K., 2005, Tutorials in Operations Research, P54, DOI [https://doi.org/10.1287/educ.1053.0013, DOI 10.1287/EDUC.1053.0013]
[2]   PROPERTIES OF EXPECTED COSTS AND PERFORMANCE-MEASURES IN STOCHASTIC-MODELS OF SCHEDULED TRANSPORT [J].
CAREY, M ;
KWIECINSKI, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (01) :182-199
[3]   ADJUSTMENT OF HEADS AND TAILS FOR THE JOB-SHOP PROBLEM [J].
CARLIER, J ;
PINSON, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 78 (02) :146-161
[4]   THE ONE-MACHINE SEQUENCING PROBLEM [J].
CARLIER, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (01) :42-47
[5]   AN ALGORITHM FOR SOLVING THE JOB-SHOP PROBLEM [J].
CARLIER, J ;
PINSON, E .
MANAGEMENT SCIENCE, 1989, 35 (02) :164-176
[6]   A survey of optimization models for train routing and scheduling [J].
Cordeau, JF ;
Toth, P ;
Vigo, D .
TRANSPORTATION SCIENCE, 1998, 32 (04) :380-404
[7]   A branch and bound algorithm for scheduling trains in a railway network [J].
D'Ariano, Andrea ;
Pacciarelli, Dario ;
Pranzo, Marco .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (02) :643-657
[8]   An exact solution procedure to determine the optimal dispatching times for complex rail networks [J].
Dessouky, MM ;
Lu, Q ;
Zhao, JM ;
Leachman, RC .
IIE TRANSACTIONS, 2006, 38 (02) :141-152
[9]   Scheduling trains on a railway network using a discrete event model of railway traffic [J].
Dorfman, MJ ;
Medanic, J .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2004, 38 (01) :81-98
[10]  
Hansen I. A., 2005, EUROPEAN J TRANSPORT, V5, P31