With the continuous expansion of the railway infrastructure network, the railway operation network has become more and more complex both in time and space dimensions. In order to help railway operators formulate management measures more pertinently, this research aims to develop a method to analyze the complex operation network via quantifying and ranking the importance of stations in different periods based on the train timetable. Firstly, we propose the time-space train origin-destination (OD) service network (OD-TS network) to abstractly describe the railway transportation service. And a network construction method is designed to build the OD-TS network according to the train operation information in the timetable. We further develop an improved k-shell decomposition method to quantify the node importance for the directed-weighted networks. Case studies are carried out based on the train timetable of China's high-speed railway. We study the OD-TS network from three perspectives (the global network, the railway hubs, and the stations) and analyze the spatiotemporal details of the railway operation. These analyses show that the proposed method can help the railway operators mine the spatiotemporal characteristics of the railway operation well.

Heavy-haul railway transport is a critical mode of regional bulk cargo transport. It dramatically improves the freight transport capacity of railway lines by combining several unit trains into one combined train. In order to improve the efficiency of the heavy-haul transport system and reduce the transportation cost, a critical problem involves arranging the combination scheme in the combination station (CBS) and scheduling the train timetable along the trains’ journey. With this consideration, this paper establishes two integer programming models in stages involving the train service plan problem (TSPP) model and train timetabling problem (TTP) model. The TSPP model aims to obtain a train service plan according to the freight demands by minimizing the operation cost. Based on the train service plan, the TTP model is to simultaneously schedule the combination scheme and train timetable, considering the utilization optimal for the CBS. Then, an effective hybrid genetic algorithm (HGA) is designed to solve the model and obtain the combination scheme and train timetable. Finally, some experiments are implemented to illustrate the feasibility of the proposed approaches and demonstrate the effectiveness of the HGA.

Methods for solving the carrying capacity problem for High-Speed Railways (HSRs) have received increasing attention in the literature in the last few years. As important nodes in the High-Speed Railway (HSR) network, large stations are usually the carrying capacity bottlenecks of the entire network due to the presence of multiple connections in different directions and the complexity of train operations at these stations. This paper focuses on solving the station carrying capacity problem and considers train set utilization constraints, which are important influencing factors that have rarely been studied by previous researchers. An integer linear programming model is built, and the CPLEX v12.2 software is used to solve the model. The proposed approach is tested on a real-world case study of the Beijing South Railway Station (BS), which is one of the busiest and most complex stations in China. Studies of the impacts of different train set utilization constraints on the practical station carrying capacity are carried out, and some suggestions are then presented for enhancing the practical carrying capacity. Contrast tests indicate that both the efficiency of the solving process and the quality of the solution show huge breakthroughs compared with the heuristic approach.

Compared with other modes of transportation, a high-speed railway has energy saving advantages; it is environmentally friendly, safe, and convenient for large capacity transportation between cities. With the expansion of the high-speed railway network, the operation of high-speed railways needs to be improved urgently. In this paper, a hybrid approach for quickly solving the timetable of high-speed railways, inspired by the periodic model and the aperiodic model, is proposed. A space–time decomposition method is proposed to convert the complex passenger travel demands into service plans and decompose the original problem into several sub-problems, to reduce the solving complexity. An integer programming model is proposed for the sub-problems, and then solved in parallel with CPLEX. After that, a local search algorithm is designed to combine the timetables of different periods, considering the safety operation constraints. The hybrid approach is tested on a real-world case study, based on the Beijing–Shanghai high-speed railway (HSR), and the results show that the train timetable calculated by the approach is superior to the real-world timetable in many indexes. The hybrid approach combines the advantages of the periodic model and the aperiodic model; it can deal with the travel demands of passengers well and the solving speed is fast. It provides the possibility for flexible adjustment of a timetable and timely response to the change of passenger travel demands, to avoid the waste of transportation resources and achieve sustainable development.

The “left-behind” phenomenon occurs frequently in Urban Rail Transit (URT) networks with booming travel demand, especially during peak hours in a complex URT network, which makes passenger travel patterns more complicated. This paper proposes a methodology to mine passenger travel patterns based on fare transaction records from automatic fare collection (AFC) systems and Automatic Vehicle Location (AVL) data from Communication Based Train Control (CBTC) Systems or tracking systems. By introducing the concept of a sequence, a space-time-sequence trajectory model is proposed to simulate a passenger’s travel activities, including when they are left-behind. The paper analyzes passenger travel trajectory links and estimates the weight of each feasible trajectory under tap-in/tap-out constraints. The station time parameters, including access/egress and transfer walking-time parameters, are important inputs for the model. The paper also presents a maximum-likelihood approach to estimate these parameters from AFC transaction data and AVL data. The methodology is applied to a case study using AFC and AVL data from the Beijing URT network during peak hours to test the proposed model and algorithm. The estimation results are consistent with the results obtained from the authorities, and this finding verifies the feasibility of our approach.

Comparing to other modes of transportation, high-speed railway has the advantages of energy saving, environment friendly, safety and convenience for passengers, and has been more and more popular. However, unforeseen emergencies may disrupt the normal train operation. In this paper, an integrated dispatch strategy (IDS) is proposed to synergistically reschedule the train timetable and rolling stock circulation plan under single-direction disruptions. A two-objective model is formulated, aiming at minimizing both the delay time of passengers and the operation costs of railway companies, to reschedule the train operation efficiently and economically. An algorithm based on Non-dominated Sorting Genetic Algorithms-II (NSGA-II) is designed to solve the model. To accelerate the solving process, we propose a quick method to generate an assignment plan to serve disrupted passengers, and based on the practical experiences, the algorithm acceleration strategy (AAS) is proposed to improve the quality of initial solutions. The model and algorithm are tested on real-world instances of the Beijing-Shanghai high-speed railway line. The results indicate that the average minimized delay time of passengers is 6,012,386 min and the average minimized additional operation costs (operation mileage of standby rolling stocks) are 1623 km, with a decrease of 28.5% and 18.3%, respectively, indicating the model and algorithm are adaptable to handle single-direction disruptions on the railway line, and AAS can further accelerate the computing speed and improve the solutions quality. Finally, the characteristics of disrupted sections of railway lines are well studied and analyzed.