Abstract:

To make the line planning for the high- speed railway fit well with time-dependent demand, a train running scheme is introduced. Then train times (departures and arrivals) are applied in the line planning optimization, which avoids the large-scale computations of integrated optimization with timetabling. A Stackelberg Game model of the line planning for the high-speed railway considering time-dependent demand is proposed with the objective of minimizing the train engine time and the passenger travel time with weights. Constraints include section through capacities, the station capacity of train departing and the train capacity. A schedule-based assignment method is used to evaluate the solution. A simulated annealing algorithm is used in which some strategies are designed to search neighborhoods including reducing train formations, deleting trains, adding trains, splicing trains, increasing train formations and adjusting train departure times. The numerical experiment is conducted on the Beijing-Shanghai high-speed railway line and the results show good evaluation indexes. Especially, the actual boarding times of passengers match better with the expected departure times and the algorithm holds high efficiency and well convergence.

Key words: railway transportation, high-speed railway, line planning, time-dependent travel demand, simulated annealing algorithm

摘要：

为了使高铁列车开行方案与旅客时变需求相吻合，引入列车运行方案图，使列 车开行方案优化中既能利用列车运行的时间信息，又能避免结合列车运行图综合优化的 大规模计算.借助于基于时刻表的高铁客流分配方法，在区间通过能力、车站始发能力、列 车载客能力等多种约束下，以列车运行时间与旅客出行时间加权和为优化目标，构建了 时变需求下高铁列车开行方案优化的Stackelberg 博弈模型.利用降低编组、删除列车、添 加列车、拼接列车、提高编组和调整列车始发时间等邻域搜索策略，设计了求解模型的模 拟退火算法.最后，针对京沪高速铁路进行算例分析，优化产生的列车开行方案具有良好 的评价指标，特别是旅客上车时间与计划出发时间的偏差较小，具有较高的运算效率和 收敛性.

关键词: 铁路运输, 高速铁路, 列车开行方案, 旅客时变需求, 模拟退火算法