Deadlock analysis, prevention and train optimal travel mechanism in single-track railway system

In this paper, train scheduling problem (TSCP) is discussed for the case of single-track railway corridor, in which variable sensitivity on train delay are discussed in detailed for different types of trains. The mathematical model is a complicated nonlinear mixed-integer programming. The object of the model reflects sensitivity of trains with different types or travelling mileages on delay. A heuristic method based on the global conflicts distribution prediction (CDP) is presented. In the CDP, two critical problems restricting the development of simulation method, i.e., train deadlock and near-optimal travel strategy of train, are effectively solved. Numerical experiments show that the CDP can obtain a solution close enough to the optimal solution within a very short computational time. Variable cost weight with trapezoid-shape structure is investigated. Compared with constant weight, the schedule plan has more rational structure when variable cost weight is adopted.

[1]  Xiaoqiang Cai,et al.  Greedy heuristics for rapid scheduling of trains on a single track , 1998 .

[2]  Arie Shoshani,et al.  System Deadlocks , 1971, CSUR.

[3]  Patrick T. Harker,et al.  Tactical Scheduling of Rail Operations: The SCAN I System , 1991, Transp. Sci..

[4]  Maged M. Dessouky,et al.  Modeling train movements through complex rail networks , 2004, TOMC.

[5]  Shi Mu,et al.  Scheduling freight trains traveling on complex networks , 2011 .

[6]  Leo G. Kroon,et al.  A Variable Trip Time Model for Cyclic Railway Timetabling , 2003, Transp. Sci..

[7]  Xuesong Zhou,et al.  Single-Track Train Timetabling with Guaranteed Optimality: Branch-and-Bound Algorithms with Enhanced Lower Bounds , 2007 .

[8]  Yong Cui.  Simulation based hybrid model for a partially automatic dispatching of railway operation , 2010 .

[9]  B Szpigel,et al.  OPTIMAL TRAIN SCHEDULING ON A SINGLE LINE RAILWAY , 1973 .

[10]  Malachy Carey,et al.  Extending a train pathing model from one-way to two-way track , 1994 .

[11]  A. J. Taylor,et al.  A Structured Model for Rail Line Simulation and Optimization , 1982 .

[12]  Jörn Pachl.  Avoiding Deadlocks in Synchronous Railway Simulations , 2007 .

[13]  Malachy Carey,et al.  A model and strategy for train pathing with choice of lines, platforms, and routes , 1994 .

[14]  Per Olov Lindberg,et al.  Railway Timetabling Using Lagrangian Relaxation , 1998, Transp. Sci..

[15]  Jyh-Cherng Jong,et al.  ALGORITHMS FOR GENERATING TRAIN SPEED PROFILES , 2005 .

[16]  Erhan Kozan,et al.  Optimal scheduling of trains on a single line track , 1996 .

[17]  Malachy Carey,et al.  A Model, Algorithms and Strategy for Train Pathing , 1995 .

[18]  Erhan Kozan,et al.  Heuristic Techniques for Single Line Train Scheduling , 1997, J. Heuristics.

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

[20]  Matteo Fischetti,et al.  Modeling and Solving the Train Timetabling Problem , 2002, Oper. Res..

[21]  Jörn Pachl,et al.  Railway Operation and Control , 2002 .

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

[23]  Patrick T. Harker,et al.  REAL-TIME SCHEDULING OF FREIGHT RAILROADS , 1995 .