Real-time high-speed train rescheduling in case of a complete blockage

被引:125
作者
Zhan, Shuguang [1 ]
Kroon, Leo G. [2 ,3 ]
Veelenturf, Lucas P. [4 ]
Wagenaar, Joris C. [3 ]
机构
[1] Southwest Jiaotong Univ, Sch Transportat & Logist, Chengdu, Peoples R China
[2] Netherlands Railways, Proc Qual & Innovat, Utrecht, Netherlands
[3] Erasmus Univ, Rotterdam Sch Management, NL-3000 DR Rotterdam, Netherlands
[4] Eindhoven Univ Technol, Sch Ind Engn, NL-5600 MB Eindhoven, Netherlands
基金
中国国家自然科学基金;
关键词
High speed railway; Segment blockages; Train rescheduling; Real-time control; DELAY MANAGEMENT;
D O I
10.1016/j.trb.2015.04.001
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper focuses on real-time rescheduling of railway traffic on a high speed railway line in case of a complete blockage of the railway infrastructure. Due to the disruption, all tracks in a railway segment are out of order for a certain period of time. In the situation that we consider, trains that are blocked by the disruption do not return to their origin by taking over train services in the opposite direction, but wait inside the stations until the disruption is over. Thus the main decisions to be taken are the following: in which stations do trains have to wait, in which order do they have to leave when the disruption is over, and which trains have to be canceled? A Mixed Integer Programming model is formulated to minimize the total weighted train delay and the number of canceled trains, while adhering to headway and station capacity constraints. Most instances can be solved in a single optimization run, but for the most complex instances we propose a two-stage optimization approach to improve the computational efficiency. The model is tested on real-world instances of the Beijing-Shanghai high speed railway line. The results show that the model is promising for reducing the effect of a disruption on passenger service, especially in comparison with a heuristic method used in practice. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:182 / 201
页数:20
相关论文
共 19 条
[1]   Rescheduling rail networks with maintenance disruptions using Problem Space Search [J].
Albrecht, A. R. ;
Panton, D. M. ;
Lee, D. H. .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (03) :703-712
[2]   Railway timetabling using Lagrangian relaxation [J].
Brannlund, U ;
Lindberg, PO ;
Nou, A ;
Nilsson, JE .
TRANSPORTATION SCIENCE, 1998, 32 (04) :358-369
[3]   An overview of recovery models and algorithms for real-time railway rescheduling [J].
Cacchiani, Valentina ;
Huisman, Dennis ;
Kidd, Martin ;
Kroon, Leo ;
Toth, Paolo ;
Veelenturf, Lucas ;
Wagenaar, Joris .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 63 :15-37
[4]   Modeling and solving the train timetabling problem [J].
Caprara, A ;
Fischetti, M ;
Toth, P .
OPERATIONS RESEARCH, 2002, 50 (05) :851-861
[5]   Modeling capacity consumption considering disruption program characteristics and the transition phase to steady operations during disruptions [J].
Chu, Friederike ;
Oetting, Andreas .
JOURNAL OF RAIL TRANSPORT PLANNING & MANAGEMENT, 2013, 3 (03) :54-67
[6]   Dispatching and coordination in multi-area railway traffic management [J].
Corman, F. ;
D'Ariano, A. ;
Pacciarelli, D. ;
Pranzo, M. .
COMPUTERS & OPERATIONS RESEARCH, 2014, 44 :146-160
[7]  
Corman F., 2011, 2011 International Conference on Networking, Sensing and Control (ICNSC 2011), P323, DOI 10.1109/ICNSC.2011.5874901
[8]  
Corman F., 2012, TRANSPORT RES E-LOG, V48, P171
[9]   Optimal multi-class rescheduling of railway traffic [J].
Corman, Francesco ;
D'Ariano, Andrea ;
Hansen, Ingo A. ;
Pacciarelli, Dario .
JOURNAL OF RAIL TRANSPORT PLANNING & MANAGEMENT, 2011, 1 (01) :14-24
[10]   A tabu search algorithm for rerouting trains during rail operations [J].
Corman, Francesco ;
D'Ariano, Andrea ;
Pacciarelli, Dario ;
Pranzo, Marco .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2010, 44 (01) :175-192