High-Speed Rail Train Timetabling Problem: A Time-Space Network Based Method with an Improved Branch-and-Price Algorithm

A time-space network based optimization method is designed for high-speed rail train timetabling problem to improve the service level of the high-speed rail. The general time-space path cost is presented which considers both the train travel time and the high-speed rail operation requirements: (1) service frequency requirement; (2) stopping plan adjustment; and (3) priority of train types. Train timetabling problem based on time-space path aims to minimize the total general time-space path cost of all trains. An improved branch-and-price algorithm is applied to solve the large scale integer programming problem. When dealing with the algorithm, a rapid branching and node selection for branch-and-price tree and a heuristic train time-space path generation for column generation are adopted to speed up the algorithm computation time. The computational results of a set of experiments on China’s high-speed rail system are presented with the discussions about the model validation, the effectiveness of the general time-space path cost, and the improved branch-and-price algorithm.

[1]  Christian Liebchen,et al.  Integral cycle bases for cyclic timetabling , 2009, Discret. Optim..

[2]  X. Cai,et al.  A fast heuristic for the train scheduling problem , 1994, Comput. Oper. Res..

[3]  Steven Harrod,et al.  Modeling Network Transition Constraints with Hypergraphs , 2011, Transp. Sci..

[4]  Richard G. Bullock,et al.  High-speed rail : the first three years taking the pulse of China's emerging program , 2012 .

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

[6]  Paolo Toth,et al.  A Lagrangian heuristic algorithm for a real-world train timetabling problem , 2006, Discret. Appl. Math..

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

[8]  Erhan Kozan,et al.  A sequencing approach for creating new train timetables , 2010, OR Spectr..

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

[10]  Yusin Lee,et al.  A heuristic for the train pathing and timetabling problem , 2009 .

[11]  Rommert Dekker,et al.  Stochastic Improvement of Cyclic Railway Timetables , 2006 .

[12]  Paolo Toth,et al.  A column generation approach to train timetabling on a corridor , 2008, 4OR.

[13]  Huiling Fu,et al.  Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach , 2012 .

[14]  Matthias Ehrgott,et al.  Routing Trains Through Railway Junctions: A New Set-Packing Approach , 2011, Transp. Sci..

[15]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

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

[17]  Ziyou Gao,et al.  Train Routing Model and Algorithm Combined with Train Scheduling , 2013 .

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

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

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

[21]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..