摘要
为了适应旅客客流的动态变化,列车运行图的调整越来越频繁,相应的动车组运用计划也需要随之进行调整。为了使动车组运用计划在列车运行图切换时能够高效高质量地调整,针对客流波动场景下的动车组运用计划调整问题进行研究,构建了一个多日的动车组运用接续网络刻画动车组担当运行线、检修、接续等状态和基本约束,从而将可行动车组交路的生成转化为接续网上的路径搜索问题。在此基础上,以取消加开车次数量最少、偏离原计划程度最小、动车组运用成本最小和偏离期望库存数量最少为目标,考虑动车组接续以及检修等约束条件,建立了基于路径的动车组运用计划调整模型。针对模型的分治结构特征,设计了拉格朗日松弛算法,将原问题分解为多个独立动车组运用的时空最短路径子问题,并通过求解拉格朗日对偶子问题得到路径集合。基于迭代过程中生成的路径集合,采用求解器求解原模型,得到问题的上界解。最后,以多个区域内的部分高速铁路网络日常图与周末图的实际运营数据为背景进行算例验证。结果表明,所设计的算法均能在65 s内得出结果,且Gap均在0.64%以下,所得到的方案在求解质量和求解效率方面均优于人工调整的方案。通过本文提出的优化方法,可以快速生成动车组调整计划,有效提高动车组的运用效率,降低运营成本。
To meet the dynamic demand of passengers,the need for train timetable rescheduling is becoming increasingly frequent,and the subsequent rolling stock plan also requires rescheduling.To efficiently and effectively carry out rolling stock rescheduling when changing train timetable,we focused on the rolling stock rescheduling under passenger demand fluctuation,and constructed a multi-day time-space connection network of rolling stock plan to describe the utilization,the maintenance,the connection and some basic constraints of rolling stock so as to transform the generation of feasible paths into a path search problem on the time space connection network.On this basis,the objectives were set to minimize the number of canceled additional trips,the deviation from the original plan,the cost of using rolling stock,and the deviation from the desired inventory.By considering connection and maintenance constraints,we established a path-based model of rolling stock rescheduling.According to the partition structure characteristic of the model,a Lagrangian relaxation algorithm decomposed the original problem into several independent shortest path sub-problems of rolling stock utilization.Based on the set of paths generated in the iteration process,a solver was used to solve the original model to obtain an upper bound for the problem.We tested our method on the real data of basic and semaphore timetables from several high-speed railway networks.The results show that our method can solve all cases within 65 s,with Gaps below 0.64%,and the obtained plans are better than the manual plans in terms of both solution quality and efficiency.It can be concluded that the proposed method can solve the problem quickly,improve the utilization efficiency of rolling stock and reduce the operation cost.
作者
何筱雍
王莹
李涵
曹伟
HE Xiaoyong;WANG Ying;LI Han;CAO Wei(School of Traffic and Transportation,Beijing Jiaotong University,Beijing 100044,China;Beijing Railway West Station,China Railway Beijing Group Co.Ltd.,Beijing 100055,China)
出处
《铁道科学与工程学报》
EI
CAS
CSCD
北大核心
2024年第8期3072-3081,共10页
Journal of Railway Science and Engineering
基金
国家自然科学基金铁路基础研究联合基金资助项目(U2268207)。
关键词
高速铁路
动车组运用计划调整
短期计划
时空接续网络
拉格朗日松弛
high-speed railway
rolling stock rescheduling
short term planning
time space connection network
Lagrangian relaxation
