设为首页 |  加入收藏
首页期刊介绍编 委 会投稿须知稿 约征订启事合作办刊联系我们English
 
基于货物运到期限的列车运行线选择优化研究
作者:张小炳1 2  李晟东1 2  吕红霞1 2 3  徐长安1 2 
单位:1. 西南交通大学 交通运输与物流学院, 四川 成都 610031; 2. 西南交通大学 全图铁路列车运行图编制研发培训中心, 四川 成都 610031;3. 综合交通运输智能化国家地方联合工程实验室, 四川 成都 610031
关键词:货物运输  运到期限  运行线选择  k短路 
分类号:
出版年·卷·期(页码):2019·41·第5期(10-15)
摘要:

采用规划型运输组织模式,根据货运市场动态需求,基于实施日进行铁路货物列车运行图编制是提高铁路货物运输时效性、实现铁路货运改革创新的关键。实现流线结合,对于动态的车流合理选择运行线进行挂运,即将车流指派到运行线对应的列车上,是确定货物运输方案的核心工作。确定的运行线不同,货物运输时间则不同,基于此,可为货主提供多种运到期限选择方案。以车流在途运输时间最小为优化目标,以货物列车运输能力、技术站有调中转作业时间等为约束条件,构建基于货物运到期限的列车运行线选择0-1整数规划模型;模型采用模拟退火算法求解,并提出了运行线选择的k短路算法;最后通过算例分析,验证了模型及算法的有效性。

Adopting the planning type transportation organization mode, along with compiling freight train timetable according to the dynamic demand of freight market based on implementation day, are the keys to improve the timeliness of railway freight transport and achieve the reform and innovation of railway freight operation. To achieve the tight combination of freight flow and train path, selecting the train paths appropriate for the freight flows is the core of freight trip planning. Different train paths correspond to different freight delivery time, which provides the shippers with a variety of trip plan options based on the due date. With the minimum transport time of cargo as the optimization objective, and the transport capacity of the cargo trains and the transit time in the technical stations as constraints, a 0-1 integer programming model was constructed. A k shortest paths algorithm based on simulated annealing algorithm for the train path selection was proposed. Finally, an example was given to demonstrate the validity of the model and the algorithm.

参考文献:
服务与反馈:
文章下载】【发表评论】【查看评论】【加入收藏
提示:您还未登录,请登录!点此登录
 
友情链接   更多

地址:北京复兴路10号  中国铁道学会《铁道学报》编辑部    邮编:100844      电话:(010)51848021 / 51847501 
传真:(010)51892424       邮箱:tdxb@vip.163.com   京ICP备09031577号