期刊文献+

基于改进蚁群算法的客运站到发线运用优化研究

Research on Optimization of Arrival and Departure Track Application of Passenger Station Based on Improved Ant Colony Algorithm
下载PDF
导出
摘要 合理使用高铁站到发线对车站的工作效率至关重要,为编制高效的到发线运用方案,建立以固定使用到发线和均衡运用到发线为目标的0-1整数规划模型,采用改进蚁群算法来求解模型。为了验证模型和算法的可行性,以定西北站实际数据为例验证9∶00~12∶00车站到发线运用优化方案是否满足行车安全和高效作业要求。算例表明,模型和算法可以有效编制满足条件的优化方案,能够为客运站的智能化作业提供参考。 The rational use of arrival and departure track of high-speed railway stations is critical to the efficiency of the station.In order to formulate an efficient arrival and departure track operation plan,a 0-1 integer plan is established with the goal of fixed use of arrival and departure track and balanced use of arrival and departure lines.A modified ant colony optimization to solve the model.In order to verify the feasibility of the model and algorithm,the actual data of a high-speed railway station was used as an example to verify whether the optimization plan for the arrival and departure track at the station from 9∶00 to 12∶00 meets the requirements of safe driving and efficient operation.The calculation example shows that the model and algorithm can effectively compile an optimized plan that meets the conditions,and can provide a reference for the intelligent operation of passenger stations.
作者 王林杰 WANG Lin-jie(School of Traffic and Transportation,Lanzhou Jiaotong University,Lanzhou,Gansu 730070,China)
出处 《黑龙江交通科技》 2022年第2期155-158,共4页 Communications Science and Technology Heilongjiang
关键词 客运站 到发线运用 0-1整数规划 改进蚁群算法 passenger station arrival and departure track operation 0-1integer programming improved ant colony optimization
  • 相关文献

参考文献5

二级参考文献13

  • 1谢楚农,黎新华.铁路客运站到发线运用优化研究[J].中国铁道科学,2004,25(5):130-133. 被引量:56
  • 2[5]Katta G. Murty. The Algorithm for Ranking all Assignmints in Order of Increasing Cost [ J ]. Operations Research,1968, 16: 682-687.
  • 3DORIGO M,STOTZLE T.蚁群优化[M].张军,胡晓敏,罗旭跃,等译.北京:清华大学出版,2006:73-75.
  • 4STUTZLE T, HOOS H. Max-min ant system[ J]. Future Generation Computer Systems, 2000, 16(8) : 889-914.
  • 5DORIGO M, GAMBARDELLA L M. Ant colonies for the traveling salesman problem[ J ]. BioSystems, 1997 (43) : 73-81.
  • 6Rajendran C, Ziegler H. Ant-colony algorithms for permutation flow-shop sequencing [ J ]. Computer and Operation Research, 2004, 31(5): 791-801
  • 7DORIGO M, MANIEZZO V. COLORNI A. The ant system: optimization by a colony of cooperating agents [ J ]. IEEE Transactions on Systems, Man, and Cybernetics, 1996, 26(2) : 29-41.
  • 8MANIEZZO V, COLORNI A. The ant system applied to the quadratic assignment problem[J]. IEEE Transcations on Data and Knowledge Engineering, 2000, 11 (5) : 769-778.
  • 9张苏波,廖勇,邹健康,黄志彤.基于遗传算法的客运站到发线优化安排[J].铁道运输与经济,2007,29(11):24-27. 被引量:7
  • 10林志安,潘玲巧.基于Memetic算法的客运站到发线分配问题研究[J].兰州交通大学学报,2008,27(6):80-82. 被引量:3

共引文献80

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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