成网条件下高速铁路动车组运用计划优化模型研究

Study on Optimization Model of High-speed EMU Utilization Plan under Network Formed

通过阐述高速铁路成网后对动车组运用计划的影响,分析成网条件下的动车组运用计划,分步骤构建时空网络,以路径费用最小为目标函数,综合考虑动车组运用计划和检修计划等相关约束,建立动车组运用计划优化模型,选用大规模邻域搜索算法进行模型求解。以京沪、沪宁高速铁路数据为例,验证该算法的可行性和有效性。比较大规模邻域搜索算法与模拟退火算法的优化结果,认为大规模邻域搜索算法能够较快地获取优化结果。

This paper analyzes the influence on EMU utilization plan after high-speed railways network formed, describes the problems of EMU utilization plan under the condition that network formed, and puts forward establishing time-space network step by step. Through taking the minimum route fee as object function, the relative restrictions like EMU utilization plan and maintenance plan were considered comprehensively, the optimization model of EMU utilization plan was established and the model was solved by using large-scale neighborhood search algorithm. Taking Beijing-Shanghai and Shanghai-Nanjing high-speed railway data as examples, the feasibility and availability of the algorithm was validated. Through comparing the optimization results of large-scale neighborhood search algorithm and simulated annealing algorithm, the large neighborhood search algorithm was thought can achieve optimization result much faster.