Predicting short-term passenger flow accurately is of great significance for daily management and for a timely emergency response of rail transit networks. In this paper, we propose an attention-based Graph–Temporal Fused Neural Network (GTFNN) that can make online predictions of origin–destination (OD) flows in a large-scale urban transit network. In order to solve the key issue of the passenger hysteresis in online flow forecasting, the proposed GTFNN takes finished OD flow and a series of features, which are known or observable, as the input and performs multi-step prediction. The model is constructed from capturing both spatial and temporal characteristics. For learning spatial characteristics, a multi-layer graph neural network is proposed based on hidden relationships in the rail transit network. Then, we embedded the graph convolution into a Gated Recurrent Unit to learn spatial–temporal features. For learning temporal characteristics, a sequence-to-sequence structure embedded with the attention mechanism is proposed to enhance its ability to capture both local and global dependencies. Experiments based on real-world data collected from Chongqing’s rail transit system show that the metrics of GTFNN are better than other methods, e.g., the SMAPE (Symmetric Mean Absolute Percentage Error) score is about 14.16%, with a range from 5% to 20% higher compared to other methods.
Enhancing the resilience of train timetables can effectively improve their resistance and recovery capabilities against operational disturbances, thereby ensuring the stable operation of the railway system and the quality of passenger transportation services. This paper defined timetable resilience as three parts: disturbance absorptive capacity, resistance capacity, and post-disturbance recovery capacity. These capacities were quantitatively evaluated using the buffer time of trains, the number of train delays at departures and arrivals, and the duration of delay state. The evaluation metrics of the three resilience capacities and the total travel time of trains were used as the objective to establish a spatiotemporal network model. Utilizing actual operational data from the Beijing–Shanghai high-speed railway in China, the model was validated through a case study. Sensitivity analysis of the model's key parameters was conducted under two experimental scenarios: routine operational disturbances and speed restrictions on specific sections. Results showed that our model can effectively reduce the delay time and the number of delays in both the routine operational disturbance scenario and the 300 km/h speed restriction scenario with a frequent disturbance value of 2 min. Moreover, the model's performance with 3-min frequent disturbance outperformed that with 2-min frequent disturbance in speed restriction at 250 km/h and 200 km/h, yielding a 30% improvement.
Disturbances often occur in transfer stations; however, little is known about the weaknesses of transfer stations and their ability to cope with passenger flows. Therefore, this paper introduces resilience into the study of transfer stations to enhance their emergency response processes and improve the sustainability of URT networks. It establishes a two-level fuzzy evaluation model, using the G1 weighting method, to assess resilience across various scenarios (daily operation, heavy passenger flow, and emergencies) and identify weaknesses; then, corresponding enhancement strategies are proposed. First, factor sets are established according to resilience stages, including rapidity before disturbance, robustness, redundancy, resourcefulness, and rapidity after disturbance. Using the G1 method, the weight matrix for each factor is calibrated, and a membership degree matrix is determined based on their affiliation with the review set. Multiplying the weight matrix and membership degree matrix yields the resilience value. We apply these steps to a representative station with the assistance of Anylogic simulation in calculating the hard-to-obtain data, yielding a peak-hour resilience value of 0.3425, which indicates a “poor” rating in the review set. By combining the peak-hour resilience with resilience curves under different multiples of peak-hour flows, an enhancement prioritization strategy is proposed for the station, which can act as a reference for the management of URT transfer stations.
22 November 2023 in Quantum Information Processing
Timetable scheduling is a combinatorial optimization problem that presents formidable challenges for classical computers. This paper introduces a pioneering methodology for addressing the high-speed train timetabling problem through quantum computing. Initially, a comprehensive binary integer programming model, grounded in the space–time network, is proposed (M1). To manage the intricacy of model M1, a knapsack problem reformulation is employed to establish a simplified binary integer programming model (M2). Both M1 and M2 are subsequently converted into quadratic unconstrained binary optimization (QUBO) models to harness the potential of quantum computing. Several techniques, including the Gurobi solver, simulated annealing, and the coherent Ising machine (CIM) quantum simulator, are deployed to solve the model across four distinct scenarios of varying complexity. The findings indicate that CIM quantum simulator outperforms the simulated annealing method in terms of solution quality for medium-scale problems.
This study examines railway network resilience through a complex network analysis of both the physical infrastructure and service operations. The objectives were to quantify the resilience characteristics of China’s railway network, assess its performance under different disturbance types, and evaluate recovery strategy effectiveness. Network resilience was measured through accessibility, invulnerability, and restorability dimensions. The simulation results demonstrate that targeted disruptions cause significantly more damage than random disturbances, particularly when high-betweenness nodes are affected. Statistical analysis confirmed that betweenness-based recovery strategies outperform degree-based and random approaches. These findings provide a quantitative foundation for infrastructural planning, emergency response protocols, and resource allocation in railway systems.
The intercity railway is subject to variation and fluctuation in demand both in time and space over a day to a large extent. In that case, more advanced line planning techniques are practically needed to match the non-equilibrium passenger demand. We propose an integer linear programming model for adapting to the fluctuating demand and improving rail line profit, in which the multi-period planning approach and flexible train composition mode are taken into consideration. In particular, we also consider the limitations of the carriage and the dynamic transfer of resources during a finite period to ensure the better implementation of the line planning and subsequent operation plans. Our purpose is to improve on previous line planning models by integrating the multi-period strategic-level line planning decision with resource constraints. Since the problem is computationally intractable for realistic size instances, an improved round heuristic algorithm that is based on linear relaxation is proposed and we compare the round heuristic performance with the commercial solver Gurobi on artificial instances. The numerical experiments that are based on an intercity railway in China certify the effectiveness and applicability of the proposed model and algorithm. We evaluate the impact of different optimization parameters and reserved carriages and the computation results show that in comparison to the fixed composition mode, the proposed approach can improve the utilization efficiency of carriage resources and increase the line profit by 1.9% under the same carriage resource conditions.