Automatic Train Operation (ATO) aims to partially or fully automate train driving, enhancing railway capacity, punctuality, and energy efficiency. However, a key challenge arises from the mismatch between discrete event-time decisions at the Traffic Management System (TMS) level, assuming fixed running times, and the continuous speed–distance trajectory optimisation at the ATO level, leading to possible misalignments between planned and executed train movements. To bridge this gap, this paper introduces a novel optimisation-based method that dynamically computes Train Path Envelopes (TPEs) based on multiple driving strategies, defined as time targets or windows over a sequence of timing points, which ATO-equipped trains must comply with to align their movements with traffic management constraints. The method follows a two-stage approach: First, a linear programming model determines conflict-free blocking time ranges across the multiple driving strategies. Second, a structured optimisation process establishes operationally feasible TPEs by determining departure tolerances and configuring intermediate timing points. By integrating a critical-block strategy, the optimised TPEs provide the flexibility needed for ATO while accommodating variations in train driving strategies. The method is validated through experiments and a real-life case study in The Netherlands, demonstrating that optimised timing points at critical track locations improve energy efficiency, enhance punctuality, increase capacity, and provide an approach to align traffic management with ATO.

To address the increasing passenger demand in the coming years and make public transport less crowded and delayed, insights into predicted passenger flow are needed. A wide range of studies has used and validated that smart card data can be one of the sound bases for predicting short-term passenger demand. However, it also has several disadvantages, such as the relatively long collection time, the insufficiency to reflect the relationship between passenger behavior and ridership. Trip planner data, which emerged as a type of real-time transit information, could reduce the perceived waiting time of passengers and increase the transit ridership due to the improved satisfaction. Combining these two types of data could potentially cater to the interest of operators in matching the vehicle supply and passenger flow demand at an operational level. Our results show that it is novel and useful to incorporate trip planner data in short-term ridership prediction, however, entirely based on this kind of data would be inaccurate. Random Forest Regression outperforms the other six models that we have selected. The request-related features (variables) can take up 20% of the importance of short-term ridership prediction.

In this study, a data-driven, generic and transfer-based methodology for separation and ranking the PTNs has been put forward. With the hierarchy of a network, this is beneficiary for the management and operation of operators for focusing on the higher level network layer and in turn provide better service for passengers. The study introduces three steps to rank the hierarchy of a PTN: (1) using the passenger journey and ride data to derive transfer flow matrix; (2) applying C-space network representation with community detection method to separate and visualize the PTN layer; (3) performing ranking method, regarding inner- and intra- transfer flow. To this end, the hierarchy of a PTN could be presented with temporal attributes. Different day of week and various time period of a day could potentially yield different hierarchy. The proposed unsupervised learning algorithm is based on passenger transfer flow data, independent from geographic location and the mode of transportation. The study shows that the level is changing based on the selected time slot and can be a mixture of different modes, which is dissimilar from the hierarchy purely based on qualitative method.