Line planning problems and differential pricing problems are complementary processes in the railway system, but these two problems were generally considered separate processes in most of the existing literature. This paper studies a time-dependent line planning problem and differential pricing problem with passenger train choice in high-speed railway networks under elastic origin-destination-period demand. After clearly and flexibly describing the organization cost of operators, the price cost, and the time cost of passengers in a physical infrastructure-based directed graph, a non-linear joint optimization model is designed with a diversity of optimization goals of maximizing the total revenue of railway operators minus the total travel cost of passengers. An algorithm based on a simulated annealing framework is designed to solve the joint optimization model, and six neighborhood search strategies are designed by combining the features of the studied problem and designed model closely to improve the efficiency of the solution search. The results based on both a toy railway network and a real-world railway network show that the optimized time-dependent line plan and differential price plan are beneficial to increasing the total revenue of railway operators and improving the travel service of railway passengers.
In the transportation organization optimization of high-speed railway (HSR), optimizations such as line planning, ticket pricing, and seat allocation are generally studied separately. However, in reality, when passengers choose trains, they need to consider multiple factors such as train routes, stop plans, seat prices, seat availability, and departure times. Therefore, there is an urgent need for an integrated optimization method to simultaneously make decisions regarding these multiple factors. This study constructs a nonlinear optimization model of line planning integrating differentiated pricing and seat allocation decisions for HSR under elastic demand. To efficiently solve the model, an improved heuristic algorithm based on the simulated annealing framework combined with a linear passenger flow allocation method is proposed. Finally, case analysis proves that the improved algorithm can effectively solve the model under the input conditions of an actual Y-shaped HSR network composed of 13 stations, with a potential for a 106.54% improvement from the initial solution to the final solution. The uniqueness of our study lies in the joint optimization of three critical HSR operations, which has not been comprehensively explored in prior studies and is of great significance for improving the level of HSR train operations and passenger services.