期刊文献+

基于网络流的双机不成对机车周转方案建模研究

Study on Modeling of Two-engine Unpaired Locomotive Turnover Scheme Based on Network Flow
下载PDF
导出
摘要 现有的研究大多针对单机机车周转问题,而对于双机不成对机车周转问题研究较少。本文主要针对双机不成对机车周转问题,采用网络流方法建立最小费用给定流模型,分析机车运用数量。通过C++编程进行算例分析,验证基于网络流方法所建模型的有效性。 Most of the existing researches focus on the problem of single-engine locomotive turnover,but there are few researches on the problem of two-engine locomotive turnover.Aiming at the problem of two-engine unpaired locomotive turnover,this paper adopts the network flow method to establish the minimum cost given flow model and analyze the number of locomotives in use.Through C++programming,the validity of the model based on network flow method is verified.
作者 安志龙 马丽 Zhilong An;Li Ma(Shaanxi Railway Institute,Weinan 714000,China)
出处 《青海交通科技》 2020年第1期65-67,共3页 Qinghai Transportation Science and Technology
关键词 网络流 双机不成对 机车周转方案 network flow two engines do not pair locomotive turnover scheme
  • 相关文献

参考文献8

二级参考文献52

  • 1陈团生,毛保华,何宇强.旅客列车发车时间域优化研究[J].铁道学报,2006,28(4):12-16. 被引量:17
  • 2谢金宝,永秀.利用网络技术求解机车交路方案[J].铁道学报,1996,18(5):9-13. 被引量:21
  • 3史峰,胡安洲.机车周转图的线性配置算法[J].铁道学报,1996,18(4):18-24. 被引量:19
  • 4赵鹏,杨浩,胡安洲.高速铁路动车组的不固定区段使用问题[J].铁道学报,1997,19(2):15-19. 被引量:31
  • 5Maoti G. Operations research models for railway rolling stock planning [ D ]. Eindhoven, Technische Universiteit Eindhoven, 2006.
  • 6Peeters M, Kroon L, et al. Circulation of railway rolling stock: a branch-and-price approach [J] . Computers & Operational Research, 2008, 35(2) : 538 - 556.
  • 7Alfieri A, Rutger G, Kroon L, et al. Efficient circulation of railway rolling stock [ J ]. Transportation Science, 2006, 40(3) : 378 - 391.
  • 8Maoti G, Kroon L. Maintenance routing for train units: the transition model[J]. Transportation Science, 2005, 39 (4): 518- 525.
  • 9Maoti G, Kroon L. Maintenance routing for train units: the interchange model[ J]. Computers & Operational Research, 2007, 34(4) : 1121 - 1140.
  • 10钱颂迪,运筹学,1990年

共引文献62

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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