期刊文献+

日常动态货物列车开行方案优化研究 被引量:9

Daily Dynamic Freight Train Service Optimization
下载PDF
导出
摘要 为使铁路行车组织符合日常货流动态变化,本文提出编制日常动态货物列车开行方案,以确定货物列车开行的始发终到站、开行数量、编组内容和开行时段.基于编组计划、运行图等基本运输计划构建列车时空网络,以车流走行费用,列车运营费用,车流延误费用之和最小为目标;考虑车流径路唯一,节点流量平衡,列车开行数量,车流中转时间等约束,构建整数规划模型.为提升算法的求解效率,增加解的个体数目实现算法的并行性,引入多邻域移动准则,设计改进的模拟退火算法进行求解.以蒙华铁路实际数据进行案例分析,结果证明了本文模型和算法的有效性. To compensate for the change of freight traffic arising in daily operations,this paper aims to construct a daily freight train service plan,which determines the origin and destination stations,number,formation,and time periods of trains to operate.This paper constructs a train service time-space network based on the formation plan and timetable.An integer programming model is constructed to minimize the total costs of wagon flow movement,train operation,and shipment delay with considering the constraints of wagon flow paths,flow conservation,operating number of trains,and transit time.An improved simulated annealing algorithm is designed to improve the solving efficiency by increasing the solution number to achieve parallel search as well as by introducing multiple neighborhood structures.A real case built on the Menghua railway illustrates the effectiveness of the model and algorithm proposed in this paper.
作者 李晟东 吕红霞 吕苗苗 徐长安 倪少权 LI Sheng-dong;LV Hong-xia;LV Miao-miao;XU Chang-an;NI Shao-quan(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 610031,China;National Railway Train Diagram Research and Training Center,Southwest Jiaotong University,Chengdu 610031,China;National and Local Joint Engineering Laboratory of Comprehensive Intelligent Transportation,Southwest Jiaotong University,Chengdu 610031,China)
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2020年第5期177-184,共8页 Journal of Transportation Systems Engineering and Information Technology
基金 国家重点研发计划(2016YFC0802208) 国家自然科学基金(52072314,61703351)。
关键词 铁路运输 车流组织 列车开行方案 日常运营 模拟退火算法 railway transportation wagon-flow organization train formation plan daily operation simulated annealing algorithm
  • 相关文献

参考文献3

二级参考文献19

  • 1史峰,李致中,孙焰,胡建华.列车编组计划网络优化方法[J].铁道学报,1994,16(2):74-79. 被引量:16
  • 2林柏梁,朱松年.路网上车流径路与列车编组计划的整体优化[J].铁道学报,1996,18(1):1-7. 被引量:22
  • 3朱松年.列车编组计划的二次0-1规划模型及解法[J].西南交通大学学报,1986,21(增刊):65-72.
  • 4杜旭升.货车编组计划的优化[C]//铁道科学技术新进展--铁道科学研究院五十五周年论文集.北京:中国铁道出版社,2005:896-903.
  • 5张进川,杨浩.基于货主满意度的铁路空车调配方案研究[J].物流技术,2007,26(11):128-131. 被引量:2
  • 6程学庆,蒲云.基于货主满意度的模糊空车调配模型的研究[J].铁道运输与经济,2007,29(11):71-73. 被引量:9
  • 7AHUJA R K, CUNHA C B, SAHIN G. Network models in railroad planning and scheduling[J]. Tutorials in Operations Research, 2005, 1: 54-101.
  • 8LIN B L, WANG Z M. Optimizing the freight train connection service network of a large-scale rail system[J]. Transportation Research Part B: Methodological, 2012, 46(5): 649-667.
  • 9M H Keaton. Designing railroad operating plans: a dual adjustment method for implementing lagrangian relaxation[J]. Transp. Sci., 1992,26,433-452.
  • 10Armin Fugenschuh, Stefan Vigerske. Mixed-integer nonlinear problems in transportation applications[C]// 2nd International Conference on Engineering Optimization: 2010:1-10.

共引文献23

同被引文献84

引证文献9

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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