High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained.

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.

It is a multiobjective mixed integer programming problem that calculates the carrying capacity of high speed railway based on mathematical programming method. The model is complex and difficult to solve, and it is difficult to comprehensively consider the various influencing factors on the train operation. The multiagent theory is employed to calculate high speed railway carrying capacity. In accordance with real operations of high speed railway, a three‐layer agent model is developed to simulate the operating process of high speed railway. In the proposed model, railway network agent, line agent, station agent, and train agent are designed, respectively. To validate the proposed model, a case study is performed for Beijing–Shanghai high speed railway by using NetLogo software. The results are consistent with the actual data, which implies that the proposed multiagent method is feasible to calculate the carrying capacity of high speed railway.

The train-set circulation plan problem (TCPP) belongs to the rolling stock scheduling (RSS) problem and is similar to the aircraft routing problem (ARP) in airline operations and the vehicle routing problem (VRP) in the logistics field. However, TCPP involves additional complexity due to the maintenance constraint of train-sets: train-sets must conduct maintenance tasks after running for a certain time and distance. The TCPP is nondeterministic polynomial hard (NP-hard). There is no available algorithm that can obtain the optimal global solution, and many factors such as the utilization mode and the maintenance mode impact the solution of the TCPP. This paper proposes a train-set circulation optimization model to minimize the total connection time and maintenance costs and describes the design of an efficient multiple-population genetic algorithm (MPGA) to solve this model. A realistic high-speed railway (HSR) case is selected to verify our model and algorithm, and, then, a comparison of different algorithms is carried out. Furthermore, a new maintenance mode is proposed, and related implementation requirements are discussed.

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.

This study discusses the issue of train rescheduling in high-speed railways (HSR) when unexpected interruptions occur. These interruptions can lead to delays, cancellations, and disruptions to passenger travel. An optimization model for train rescheduling under uncertain-duration interruptions is proposed. The model aims to minimize both the decline in passenger service quality and the total operating cost, thereby achieving sustainable rescheduling. Then, a hybrid optimization algorithm combining rolling horizon optimization with a deep-learning-embedded NSGA-II algorithm is introduced to solve this multi-objective problem. This hybrid algorithm combines the advantages of each single algorithm, significantly improving computational efficiency and solution quality, particularly in large-scale scenarios. Furthermore, a case study on the Beijing–Shanghai high-speed railway shows the effectiveness of the model and algorithm. The optimization rates are 16.27% for service quality and 15.58% for operational costs in the small-scale experiment. Compared to other single algorithms or algorithm combinations, the hybrid algorithm enhances computational efficiency by 26.21%, 15.73%, and 25.13%. Comparative analysis shows that the hybrid algorithm outperforms traditional methods in both optimization quality and computational efficiency, contributing to enhanced overall operational efficiency of the railway system and optimized resource utilization. The Pareto front analysis provides decision makers with a range of scheduling alternatives, offering flexibility in balancing service quality and cost. In conclusion, the proposed approach is highly applicable in real-world railway operations, especially under complex and uncertain conditions, as it not only reduces operational costs but also aligns railway operations with broader sustainability goals.