期刊文献+

重载铁路装车端空车配送模型 被引量:8

Model of Empty Car Distribution in the Loading End of Heavy Haul Railway
下载PDF
导出
摘要 根据重载铁路空车调整具有以列为单位、装车点对空车列到达时间要求高等特点,定义满意度隶属函数,以车流平衡、到发时间间隔为约束条件,以装车点满意度最大及空车列空费时间最小为目标函数,建立重载铁路装车端空车配送的多目标模糊规划模型,采用混合遗传算法求解。以大秦铁路为例,采用建立的模型和算法,计算和比较湖东站单独作为空车列分解站、湖东站和大新站联合作为空车列分解站2种方案。结果表明:增加大新站作为装车端的空车列分解站,装车点满意度可提高13.66%,空车列空费时间则可降低87.67%,能更好地满足装车点对空车列到达时间等方面的要求及线路通过能力的限制。 The empty cars of heavy haul railway are distributed in the form of a train, and the loactlng stations make higher request on the arrival time of empty cars trains. The jurisdiction function of satisfaction was defined to reflect the requirement of the loading stations on arrival time of empty cars trains, with the traffic flow equilibrium and the interval time between arrival and departure trains as constraints, a multiobjective fuzzy planning model of empty cars distribution scheme in heavy haul railway loading end was established, taking the maximum satisfaction of the loading stations and minimum wasting time of empty cars trains as the objective functions. Hybrid genetic algorithm was employed to work out the solutions. Da-Qin Railway was taken as an example. Two empty cars distribution schemes were calculated respectively by the constructed model and algorithm. One was taking Hudong Station as the disassembled station alone, and the other was taking Hudong Station and Daxin Station as the united disassembled station. The calculation results indicate that, if Daxin Station were added as the disassembled station for empty cars trains, the satisfaction degree of the loading stations could be raised by 13.66% and the wasting time of empty cars trains could be reduced by 87.67%, which could better meet the requirement of the loading stations on the arrival time of empty cars trains and the restriction of the carrying capacity.
出处 《中国铁道科学》 EI CAS CSCD 北大核心 2009年第4期113-117,共5页 China Railway Science
基金 铁道部科技研究开发计划项目(2008J011-A)
关键词 重载铁路 装车端 空车配送 组合列车 模糊规划 大秦铁路 Heavy haul railway Loading end Empty car distributio Combined train Fuzzy planning Da-Qin Railway
  • 相关文献

参考文献10

二级参考文献15

  • 1郑时德 等.铁路行车组织[M].北京:中国铁道出版社,1997..
  • 2胡思继.铁路行车组织[M].北京:中国铁道出版社,2001..
  • 3铁道部信息技术中心.铁路运输调度管理信息系统技术报告[R].北京:铁道部信息技术中心,2003.
  • 4铁道部信息技术中心.路网车流智能预测管理信息系统研究报告[R].北京:铁道部信息技术中心,2005.
  • 5杜艳平.智能路网车流动态预测理论和方法的研究[D].北京:铁道科学研究院,2005.
  • 6铁道科学研究院.铁路智能运输系统(RITS)体系框架研究报告[R].北京:铁道科学研究院,2003.
  • 7铁道部信息技术中心.铁路货运技术计划管理信息系统技术报告[R].,2002..
  • 8林柏梁,胡安洲.重空车流运行组织的协同优化理论及模型[J].铁道学报,1998,20(5):9-14. 被引量:17
  • 9张济民,施其洲.两阶段多目标空车调整决策系统分析[J].上海铁道学院学报,1990,11(1):27-36. 被引量:4
  • 10党建武.神经网络在铁路空车调度问题中的应用[J].兰州铁道学院学报,1999,18(1):77-85. 被引量:19

共引文献91

同被引文献36

  • 1张喜,张全寿.基于知识约束的空车调整优化方法研究[J].铁道学报,2003,25(6):14-20. 被引量:20
  • 2梁栋,林柏梁.铁路运输动态车流组织的策略优化模型研究[J].系统工程理论与实践,2007,27(1):77-84. 被引量:9
  • 3范振平,乐逸祥,范登科,林柏梁.基于蚁群算法的装车地直达重载运输优化模型求解算法研究[J].物流技术,2007,26(8):110-114. 被引量:4
  • 4DANTZI G G B. Linear programming and extensions [ M ]. New York : Princeton University Press,1998 : 52-53.
  • 5NASH S G, SOFER A. Linear and nonlinear programming [ M ]. New York : McGraw-Hill, 1996 : 156.
  • 6MURTY K G. Linear and combinatorial programming [ M ]. Melbouren: Robert E Krieger Publishing Company, 1985: 592.
  • 7DORFMAN R, SAMUELSON P A, SOLOW R M. Linear programming and economic analysis[M]. New York: Dover PUBN Inc. , 1987: 324-325.
  • 8NELDER J A, MEAD R. A simplex method for function minimization[J]. The Computer Journal, 1965, 7(4): 308.
  • 9ECKER J G, KUPFERSCHMID M. Introduction to operations research [ M ]. Melbourne : Krieger Publishing Company, 1991 : 24.
  • 10IGNIZIO J P, CAVALIER T M. Linear programming[M]. New Jersey: Prentice-Hall Inc. , 1994 : 206.

引证文献8

二级引证文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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