论文信息 - Efficient scheduling of railway traffic based on global information of train

Efficient scheduling of railway traffic based on global information of train

This paper presents an improved simulation method for solving the train scheduling problem to reduce the total travel time on the single-track railway. An algorithm based on the global information of the train is designed to obtain a more effective travel advance strategy of the train than the TAS method proposed by Dorfman and Medanic [Dorfman, M.J., Medanic, J., 2004. Scheduling trains on a railway network using a discrete-event model of railway traffic. Transportation Research Part B 38 (1), 81-98]. Based on the non-local information, we present a train control method with more loose restrains to avoid the deadlock. Moreover, operation conditions of trains under the local information are analyzed in detail, and the improved method can describe the behaviors of acceleration and deceleration of trains. The simulation results show that the total delay time of trains decreases remarkably. This fact means that the improved method can obtain a better schedule than the method proposed by Dorfman and Medanic (2004). Compared with the mathematical programming method, our method has a better computational performance, and can quickly obtain a good feasible meet-pass plan. The approach described in this paper is designed to be a decision support tool for train dispatchers to schedule the trains in real-time.

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

[2] Richard L. Sauder,et al. Computer aided train dispatching: decision support through optimization , 1983 .

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

[4] J. Medanic,et al. Efficient Scheduling of Traffic on a Railway Line , 2002 .

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

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

[7] U. T. Zimmermann,et al. Train Schedule Optimization in Public Rail Transport , 2003 .

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

[9] E R Kraft. A BRANCH AND BOUND PROCEDURE FOR OPTIMAL TRAIN DISPATCHING , 1987 .

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

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

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

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

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