Daily line planning in the operation stage should satisfy the fluctuating travel demand on different days and ensure the operation stability. In this paper, we propose an approach of daily line planning optimization for high-speed railway (HSR) lines to trade off the system costs and operation stability. The line plan is optimized by adjusting the reference line plan based on the baseline plan. A bi-level programming model is constructed based on Stackelberg game theory to describe the interaction and conflicts between railway companies and passengers. We propose the thought of “trigger decision, space-time coupling and joint iteration” to solve the model under the framework of the Simulated Annealing Algorithm (SAA). The case study on the Beijing–Shanghai HSR Line demonstrates that the adjusted line plan can not only optimize the system costs but also ensure the operation stability. It can provide sufficient transit capacity to satisfy the travel requirements of passengers and present the obvious advantage of operation cost reduction.

It is particularly important to develop efficient air–rail intermodal path planning methods for making full use of the advantages of air–rail intermodal networks and providing passengers with richer and more reasonable travel options. A Time-Expanded Graph (TEG) is used to model the timetable information of public transportation providing a theoretical basis for public transportation path planning. However, if the TEG includes a large amount of data such as train stations, airports, train and air schedules, the network scale will become very large, making path planning extremely time-consuming. This study proposes an XGBoost-based heuristic path planning algorithm (XGB-HPPA) for large scale air–rail intermodal networks, which use the XGBoost model to predict transfer stations before path planning, and quickly eliminate unreasonable transfer edges by adding a heuristic factor, reducing the network scale, thus accelerating the computation speed. Comparative results indicate that XGB-HPPA can markedly enhance computational speed within large-scale networks, while obtaining as many valid solutions as possible and approximating the optimal solution.