期刊文献+

基于ADMM方法的新增列车条件下灵活的列车时刻表优化算法研究 被引量:6

Study on Additional Train Timetable Algorithm in Flexible Manner Based on ADMM Approach
下载PDF
导出
摘要 以高速铁路走廊为背景,旨在研究新增列车条件下的列车时刻表优化问题。为了获得更加实际和更加灵活的列车时刻表,提出基于小时时段的灵活列车出发时间窗、不固定列车停站方案、停站时间、列车发车顺序、越行时空位置的灵活架构。通过构建时空网络,将列车时刻表问题中的列车安全间隔约束和越行约束表示为列车占用弧段的不相容关系,将灵活构架下的列车时刻表问题刻画为网络多商品流模型。分别利用标准的拉格朗日松弛方法和交替方向乘子法(ADMM)将原问题分解为一系列容易求解的单列车在时空网络中的最短路径问题。最后,以武广高速铁路线路为例,比较两种算法的计算性能。 This paper focuseds on optimizing the train timetables under the condition of additional trains in the case of on the high-speed rail corridor.In order to obtain a more practical and flexible train timetable,a flexible framework was developed which sets flexible departure time window based on hour-period and loosens the train stop pattern and dwelling time,departure sequence and overtaking space-time location.By constructing the space-time network,the train headway and overtaking constraints in the train timetable were transformed into the incompatible relationship between different trains to occupy the space-time arcs.Then,the additional train timetabling problem was developed into the multi-commodity flow model.The standard Lagrangian relaxation method and alternating direction method of multipliers(ADMM)were respectively introduced to decompose the original problem into a series of easy-solved single train shortest path problem in the space-time network.Finally,a real-word example based on Wuhan-Guangzhou high-speed rail corridor was conducted to compare the computational efficiency of the two important algorithms.
作者 高如虎 牛惠民 GAO Ruhu;NIU Huimin(School of Traffic and Transportation,Lanzhou Jiaotong University,Lanzhou 730070,China)
出处 《铁道学报》 EI CAS CSCD 北大核心 2021年第2期21-29,共9页 Journal of the China Railway Society
基金 国家自然科学基金(71771109,71861022)。
关键词 列车时刻表 新增列车 灵活架构 拉格朗日松弛 交替方向乘子法 train timetable additional trains flexible manner Lagrangian relaxation alternating direction method of multipliers
  • 相关文献

参考文献4

二级参考文献27

  • 1史峰,黎新华,秦进,邓连波.单线列车运行图铺划的时间循环迭代优化方法[J].铁道学报,2005,27(1):1-5. 被引量:22
  • 2CAREY M. A Model and Strategy for Train Pathing with Choice of Lines,Platforms, and Routes[J]. Transportation Research Part B.. Methodological, 1994,28(5) : 333-353.
  • 3CAREY M, LOCKWOOD D. A Model, Algorithms and Strategy for Train Pathing[J]. Journal of the Operational Research Society, 1995,46(8) : 988-1 005.
  • 4CASTILLO E,GALLEGO I, URENA J M, et al. Timeta- bling Optimization of A Mixed Double and Single-tracked Railway Network [J]. Applied Mathematical Modelling, 2011,35(2) :859-878.
  • 5CAPRARA A, FISCHETTI M,TOTH P. Modeling and Solving the Train Timetabling Problem[J]. Operations Re- search,2002,50(5) :851-861.
  • 6CAPRARA A, MONACI M,TOTH P. A Lagrangian Heu- ristic Algorithm for A Real-world Train Timetabling Prob lem[J]. Discrete Applied Mathematics, 2006,154 (5) : 738- 753.
  • 7MENG Lingyun,ZHOU Xuesong. Simultaneous Train Re- routing and Rescheduling on An N-track Network:A Mod- el Reformulation with Network-based Cumulative Flow Variables[J]. Transportation Research Part B: Methodo- logical, 2014,67 : 208-234.
  • 8FISHER M L. An Applications Oriented Guide to La- grangian Relaxation[J]. Interfaces, 1985,15(2) : 10-21.
  • 9GOH C J, MEES A I. Optimal Control on A Graph with Application to Train Scheduling Problems[J]. Mathemati- cal and Computer Modelling, 1991,15(2) :49-58.
  • 10BRANNLUND U, LINDBERG P O, NOU A, et al. Rail- way Timetabling Using Lagrangian Relaxation[J]. Trans- portation Science, 1998,32(4) :358-369.

共引文献47

同被引文献43

引证文献6

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部