期刊文献+

考虑多编组方案的轨道交通车辆购置策略研究 被引量:4

Vehicle Purchase Strategy Considering Multi-group Train Operation for Urban Rail Transit
下载PDF
导出
摘要 多编组运营是城市轨道交通系统网络化运营组织的重要方法之一.本文针对轨道交通多编组方案下列车运能加强问题,在线路通过能力一定的条件下,以最大购置次数、最小购置间隔及年度最大购置辆数等为约束条件,以广义费用最小为目标,构建了多编组方案下的城市轨道交通车辆购置策略优化模型,并设计两阶段遗传算法求解.算例分析表明,在给定需求和远期单一列车编组假设下,初期和远期采用单一编组,近期采用多编组的方案,虽然司乘成本增加18.6%,但乘客出行费用和列车运行成本分别减少16.48%和25.99%,这较初、近、远期均采用单一编组方案效益更佳. Multi-group train operation is one important part of the urban rail transit network operation technologies. In order to strengthen the transport capacity under the condition of certain line capacity. An optimization modal for vehicle purchase strategy of urban rail transit based on multi-group train is established, which is aimed to minimize the generalized cost. The constraints are maximum purchase frequency, minimum purchase interval, and the maximum purchase number of vehicles. And a two-phase mathematical programming algorithm is also proposed. The results indicate that under the certain passenger demand and single train formation in the future, the scheme of multi-group train is adopted in the near future and single train formation is adopted in initial stage and in the future can reduce the travel cost of passengers and the cost of operation by 16.48% and 25.99%, although it increases the driver cost by 18.6%. This is better than single train formation adopted in initial stage, the near future and future.
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2017年第6期193-199,213,共8页 Journal of Transportation Systems Engineering and Information Technology
基金 中国铁道科学研究院重大基金 国家自然科学基金~~
关键词 城市交通 运能加强 车辆购置策略优化模型 两阶段遗传算法 多编组 urban traffic transport capacity strength vehicle purchase strategy optimization model two-phase genetic algorithm multi-group train
  • 相关文献

参考文献5

二级参考文献27

  • 1王海丹,李映红.高峰期城市轨道交通线路通过能力的研究[J].上海铁道科技,2005(3):39-40. 被引量:2
  • 2李永洁.地铁工程设计阶段的投资控制[J].铁路工程造价管理,2005,20(5):6-9. 被引量:6
  • 3毛宝华,李夏苗,王明生,等.城市轨道交通系统运营管理[M].北京:人民交通出版社,2006.
  • 4尹贻林.工程造价的确定与控制[M].北京:中国计划出版社,2001..
  • 5Edwin Mansfield, Harold Wein. A Model for the Location Df a Railroad Classification Yard [J]. Management Science, 1958, (4) .. 292-313.
  • 6ASSAD A. Models for Rail Transportation [J]. Transporta tion Research Part A,1980,14(3): 205-220.
  • 7NEWTON H N, BARNHART C,VANCE P H. Constru- cting Railroad Blocking Plan to Minimize Handling Cost [J]. Transportation Science, 1998,32(4): 330-345.
  • 8AHUJA R K, et al. Network Models in Railroad Planning and Scheduling [J]. Operation Research Informs,2005: 54- 101.
  • 9TAILARD E D, BADEAU P, GENDREAU M, et al. A Tabu Search Heuistic for the Vehicle Routing Problem with Soft Time Windows [J]-Transportation Science, 1997,31(2) 170-186.
  • 10DORIGO M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem [J]. IEEE Transactions on Evolutionary Computation, 1997, 1 ( 1 ) : 53 66.

共引文献18

同被引文献33

引证文献4

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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