Train timetabling for an urban rail transit line using a Lagrangian relaxation approach

Abstract Delivering efficient transit services to users is the main objective of public transportation systems. Thus, rail transit systems seek to schedule train services in order to avoid passenger congestion and to minimize the waiting times for passengers. In this study, we present a path-indexed nonlinear formulation of the train timetabling problem for an urban railway system with the objective of minimizing the average waiting time per passenger subject to capacity and resource constraints. The number of planned train services is limited, so the main decisions involved in this scheduling problem are the optimal departure times for all the trains running on the network. A Lagrangian relaxation approach is proposed where the vehicle circulation constraints are relaxed, so the problem can be decomposed into a number of sub-problems for each path. We tested the proposed approach using realistic examples suggested by the Tehran sub-urban railway administration in Iran. The results obtained proved that the strength of the vehicle circulation constraint was dominant. The Lagrangian relaxation algorithm could find optimal solutions for large-scale problems within a reasonable run-time compared with traditional methods using commercial solvers, thereby suggesting the high potential of the proposed solution approach for a metro system.

[1]  Matteo Fischetti,et al.  A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling , 2012, Transp. Sci..

[2]  Erfan Hassannayebi,et al.  Train timetabling at rapid rail transit lines: a robust multi-objective stochastic programming approach , 2017, Oper. Res..

[3]  Enrique Castillo,et al.  Timetabling optimization of a mixed double- and single-tracked railway network , 2011 .

[4]  Hairong Dong,et al.  Optimization of Metro Train Schedules With a Dwell Time Model Using the Lagrangian Duality Theory , 2015, IEEE Transactions on Intelligent Transportation Systems.

[5]  Claude Lemaréchal,et al.  Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.

[6]  Raymond S. K. Kwan,et al.  A two-phase approach for real-world train unit scheduling , 2014, Public Transp..

[7]  Tao Tang,et al.  Real-time scheduling for single lines in urban rail transit systems , 2013, 2013 IEEE International Conference on Intelligent Rail Transportation Proceedings.

[8]  Xiaojin Zheng,et al.  Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach , 2010 .

[9]  Huimin Niu,et al.  An Optimization to Schedule Train Operations with Phase-Regular Framework for Intercity Rail Lines , 2012 .

[10]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[11]  Fred Glover,et al.  A Study of Alternative Relaxation Approaches for a Manpower Planning Problem. , 1979 .

[12]  Lixin Tang,et al.  The Charge Batching Planning Problem in Steelmaking Process Using Lagrangian Relaxation Algorithm , 2009 .

[13]  Michael Jung.  Relaxations and Approximations for Mixed-Integer Optimal Control , 2014 .

[14]  Paolo Toth,et al.  A tutorial on non-periodic train timetabling and platforming problems , 2015, EURO J. Transp. Logist..

[15]  Vahid Baradaran,et al.  Accurate Estimation of Average Waiting Time in Public Transportation Systems , 2015, Transp. Sci..

[16]  Bart De Schutter,et al.  Efficient Bilevel Approach for Urban Rail Transit Operation With Stop-Skipping , 2014, IEEE Transactions on Intelligent Transportation Systems.

[17]  Nomesh B. Bolia,et al.  Combined empty and loaded train scheduling for dedicated freight railway corridors , 2014, Comput. Ind. Eng..

[18]  R. Kipp Martin,et al.  Large scale linear and integer optimization - a unified approach , 1998 .

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

[20]  Tao Tang,et al.  Origin-Destination Dependent Train Scheduling Problem with Stop-Skipping for Urban Rail Transit Systems , 2014 .

[21]  Peter B. Luh,et al.  An alternative framework to Lagrangian relaxation approach for job shop scheduling , 2003, Eur. J. Oper. Res..

[22]  Roberto Cordone,et al.  The demand-dependent optimization of regular train timetables , 2004, Electron. Notes Discret. Math..

[23]  P. I. Welding,et al.  The Instability of a Close-Interval Service , 1957 .

[24]  Sunderesh S. Heragu,et al.  A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem , 2004 .

[25]  Gilbert Laporte,et al.  Single-line rail rapid transit timetabling under dynamic passenger demand , 2014 .

[26]  David Canca,et al.  Design and analysis of demand-adapted railway timetables , 2013 .

[27]  Gilbert Laporte,et al.  Exact formulations and algorithm for the train timetabling problem with dynamic demand , 2014, Comput. Oper. Res..

[28]  Sung-Pil Hong,et al.  An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network , 2011 .

[29]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[30]  Leishan Zhou,et al.  The Optimization Model and Algorithm for High-Speed Railway Station Operation Based on Lagrangian Relaxation , 2014 .

[31]  Tianyou Chai,et al.  An effective Lagrangian relaxation approach for rescheduling a steelmaking-continuous casting process , 2014 .

[32]  Janny Leung,et al.  Optimizing Timetable Synchronization for Rail Mass Transit , 2008, Transp. Sci..

[33]  Christoph Helmberg,et al.  Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation , 2008, ATMOS.

[34]  Erfan Hassannayebi,et al.  Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem , 2017, Comput. Oper. Res..

[35]  Arman Sajedinejad,et al.  Urban rail transit planning using a two-stage simulation-based optimization approach , 2014, Simul. Model. Pract. Theory.

[36]  Masoud Yaghini,et al.  An improved local branching approach for train formation planning , 2013 .

[37]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[38]  Huimin Niu,et al.  An Approach to Optimize the Departure Times of Transit Vehicles with Strict Capacity Constraints , 2013 .

[39]  Lu Liu,et al.  Timetable Design for Urban Rail Line with Capacity Constraints , 2015 .

[40]  Xiaoning Zhu,et al.  A practical model for last train rescheduling with train delay in urban railway transit networks , 2015 .

[41]  Xuesong Zhou,et al.  Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables , 2014 .

[42]  Kay W. Axhausen,et al.  Demand-driven timetable design for metro services , 2014 .

[43]  Leyuan Shi,et al.  The allocation of berths and quay cranes by using a sub-gradient optimization technique , 2010, Comput. Ind. Eng..

[44]  Keping Li,et al.  Research on passenger flow and energy consumption in a subway system with fuzzy passenger arrival rates , 2015 .

[45]  Thomas Albrecht.  Automated timetable design for demand-oriented service on suburban railways , 2009, Public Transp..

[46]  Xuesong Zhou,et al.  Optimizing urban rail timetable under time-dependent demand and oversaturated conditions , 2013 .

[47]  Keping Li,et al.  Balanced train timetabling on a single-line railway with optimized velocity , 2014 .

[48]  Shifeng Wang,et al.  Optimizing train stopping patterns and schedules for high-speed passenger rail corridors , 2016 .

[49]  Leyuan Shi,et al.  Optimization Based Method for Supply Location Selection and Routing in Large-Scale Emergency Material Delivery , 2011, IEEE Transactions on Automation Science and Engineering.

[50]  Shuzhi Zhao,et al.  The real-time dispatch methods for urban rail transportation , 2011, Proceedings 2011 International Conference on Transportation, Mechanical, and Electrical Engineering (TMEE).

[51]  Graham Mills,et al.  SCHEDULING A HETEROGENEOUS SET OF TRAINS OVER A SINGLE LINE TRACK USING LAGRANGIAN RELAXATION , 2008, The ANZIAM Journal.

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

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