期刊文献+

铁路客运车站股道运用优化模型及算法研究 被引量:1

A Study of the Optimization Model and Algorithm for Track Application in Railway Passenger Stations
下载PDF
导出
摘要 为了提高铁路客运车站的生产作业效率和自动化水平,本文通过对客运车站作业特点及股道运用计划的调查分析,以有效利用车站设备、提高车站接发车对数为目的,考虑车站接发车作业过程中的交叉干扰以及进路建立过程中的技术作业时间差,分别以股道占用时间和空费时间的方差来衡量股道运用的均衡性,建立了股道运用均衡的多目标模型,并用布谷鸟算法求解模型,以实际车站数据进行验证,结果证明了模型的可行性及优越性. In order to improve railway passenger stations' production efficiency and automation level, this paper, through an investigative analysis of passenger stations' operation characteristics and track use plans, with the efficient use of railway stations' equipment and increasing train departures and arrivals as the object, and taking into consideration the cross interference by arrivals and departures and the technical operation time difference in the approach process, measures the equilibrium of track use using the variance of the hold-up time and time unoccupied respectively, establishes a balanced multi-purpose model for track use, adopts a cuckoo algorithm, and validates the model against actual station data. The results prove the feasibility and superiority of the model.
作者 成利刚
出处 《五邑大学学报(自然科学版)》 CAS 2016年第3期14-18,共5页 Journal of Wuyi University(Natural Science Edition)
基金 江门市基础与理论科学研究类项目(20150030004128)
关键词 铁路客运站 股道运用均衡 交叉干扰 布谷鸟算法 railway passenger stations track use equilibrium cross interference the cuckoo algorithm
  • 相关文献

参考文献11

二级参考文献70

  • 1史峰,谢楚农,于桂芳.铁路车站咽喉区进路排列优化方法[J].铁道学报,2004,26(4):5-9. 被引量:42
  • 2谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004,25(5):130-133. 被引量:56
  • 3贾利民,李平,聂阿新.新一代的铁路运输系统——铁路智能运输系统[J].交通运输工程与信息学报,2003,1(1):81-86. 被引量:6
  • 4KROON L G, ROMEIJN H E, ZWANEVELD P J. Routing Trains through Railway Stations: Complexity Issues[J]. European Journal of Operational Research, 1997, 98 (3) : 485-498.
  • 5ZWANEVELD P J. Railway Planning-Routing of Trains and Allocation of Passenger Lines[D]. Rotterdam: Erasmus University Rotterdam, 1997.
  • 6ZWANEVELD P J, DAUZERE-PERES S, HOESEL C P M V, et al. Routing Trains through Railway Stations: Model Formulation and Algorithms [J]. Transportation Science, 1996, 30 (3): 181-194.
  • 7ZWANEVELD P J, KROON L G, HOESEL C P M V. Routing Trains through a Railway Station Based on a Node Packing Model [J]. European Journal of Operational Research, 2001, 128:14-33.
  • 8[5]Katta G. Murty. The Algorithm for Ranking all Assignmints in Order of Increasing Cost [ J ]. Operations Research,1968, 16: 682-687.
  • 9丁承民,张传生,刘辉.遗传算法纵横谈[J].信息与控制,1997,26(1):40-47. 被引量:92
  • 10胡献华.[D].浙江工业大学,2001.

共引文献186

同被引文献2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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