Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.

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

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

[3]  Rüdiger Schultz,et al.  Dual decomposition in stochastic integer programming , 1999, Oper. Res. Lett..

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

[5]  C. J. Goodman,et al.  Moving block signalling dynamics: performance measures and re-starting queued electric trains , 2003 .

[6]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

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

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

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

[10]  Dario Pacciarelli,et al.  Evaluation of green wave policy in real-time railway traffic management , 2009 .

[11]  Terry Tse Safety Analysis of Communication Timeout and Latency in a Positive Train Control System , 2008 .

[12]  Andres Ramos,et al.  MATHEMATICAL PROGRAMMING APPROACH TO UNDERGROUND TIMETABLING PROBLEM FOR MAXIMIZING TIME SYNCHRONIZATION , 2007 .

[13]  Matteo Fischetti,et al.  Fast Approaches to Improve the Robustness of a Railway Timetable , 2009, Transp. Sci..

[14]  Xuesong Zhou,et al.  Robust single-track train dispatching model under a dynamic and stochastic environment: a scenario-based rolling horizon solution approach , 2011 .

[15]  Paolo Toth,et al.  Nominal and robust train timetabling problems , 2012, Eur. J. Oper. Res..

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

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

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

[19]  Lucas P. Veelenturf,et al.  An overview of recovery models and algorithms for real-time railway rescheduling , 2014 .

[20]  Warren B. Powell,et al.  Clearing the Jungle of Stochastic Optimization , 2014 .

[21]  Ziyou Gao,et al.  Credibility-based rescheduling model in a double-track railway network: a fuzzy reliable optimization approach , 2014 .

[22]  Leonardo Lamorgese,et al.  An Exact Decomposition Approach for the Real-Time Train Dispatching Problem , 2015, Oper. Res..

[23]  Xuesong Zhou,et al.  Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State-space-time Network Representations , 2015, ArXiv.

[24]  Xuesong Zhou,et al.  Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: Nonlinear integer programming models with linear constraints , 2015 .

[25]  Warren B. Powell,et al.  A Unified Framework for Optimization Under Uncertainty , 2016 .

[26]  Harvey J. Greenberg,et al.  Optimization Challenges in Complex, Networked and Risky Systems , 2016 .

[27]  Ziyou Gao,et al.  Energy-efficient metro train rescheduling with uncertain time-variant passenger demands: An approximate dynamic programming approach , 2016 .

[28]  David Canca,et al.  Design of energy-Efficient timetables in two-way railway rapid transit lines , 2017 .

[29]  Lixing Yang,et al.  Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations , 2017 .

[30]  Rob M.P. Goverde,et al.  Multi-train trajectory optimization for energy efficiency and delay recovery on single-track railway lines , 2017 .

[31]  Li Wang,et al.  Robust train speed trajectory optimization: A stochastic constrained shortest path approach , 2017 .

[32]  Shuai Su,et al.  Metro train rescheduling by adding backup trains under disrupted scenarios , 2017 .

[33]  Ziyou Gao,et al.  Dynamic passenger demand oriented metro train scheduling with energy-efficiency and waiting time minimization: Mixed-integer linear programming approaches , 2017 .

[34]  Leo G. Kroon,et al.  Review of energy-efficient train control and timetabling , 2017, Eur. J. Oper. Res..

[35]  Francesco Corman,et al.  A train rescheduling model integrating speed management during disruptions of high-speed traffic under a quasi-moving block system , 2017 .

[36]  David Bergman,et al.  Discrete Nonlinear Optimization by State-Space Decompositions , 2017, Manag. Sci..

[37]  Jesper Larsen,et al.  A survey on robustness in railway planning , 2018, Eur. J. Oper. Res..