首页 | 本学科首页   官方微博 | 高级检索  
     检索      

考虑空车调配协调的货物列车开行方案优化研究
引用本文:刘晓伟,晏启鹏,倪少权,吕苗苗,吕红霞.考虑空车调配协调的货物列车开行方案优化研究[J].交通运输系统工程与信息,2021,21(2):180-188.
作者姓名:刘晓伟  晏启鹏  倪少权  吕苗苗  吕红霞
作者单位:1.西南交通大学,a.交通运输与物流学院,b.综合交通运输智能化国家地方联合工程实验室, c.综合交通大数据应用技术国家工程实验室,成都 610031;2.四川旅游学院,成都 610100
基金项目:国家重点研发计划/National Key Research and Development Program of China (2017YFB1200702);国家自然科学基金/ National Natural Science Foundation of China(52072314);四川省科技计划项目/ Sichuan Science and Technology Program (2020YFH0035)。
摘    要:为实现空车调配与货物列车开行方案协调优化,结合基本运行图架构与车流径路,构建货运时空服务拓展网络。考虑配空与装卸取送、集编发等环节的时间接续要求,节点与区段不对流空车要求,以重车流全程运送与空车配送等广义总费用最少为目标,建立整数规划弧路模型。针对既有算法设计局限性,结合重车或空车配空的时间接续要求,提出将不同的 k 短路重车流方案与空车配空方案相关联的改进可行解构造方法,设计混合差分进化求解算法。实例研究表明,考虑空车调配进行重车、空车流组织协调优化,能够减少空车走行费用,及时满足装车需求,有效保证作业车流配合中转车流集结编组及时挂线,提高方案可实施性。

关 键 词:铁路运输  列车开行方案  差分进化算法  空车调配  时空网络  
收稿时间:2020-05-26

Railway Freight Transportation Service Network Design Problem with Empty Car Distribution
LIU Xiao-wei,YAN Qi-peng,NI Shao-quan,LV Miao-miao,LV Hong-xia.Railway Freight Transportation Service Network Design Problem with Empty Car Distribution[J].Transportation Systems Engineering and Information,2021,21(2):180-188.
Authors:LIU Xiao-wei  YAN Qi-peng  NI Shao-quan  LV Miao-miao  LV Hong-xia
Institution:1.a. School of Transportation and Logistics, 1b. National and Local Joint Engineering Laboratory of Comprehensive Intelligent Transportation, 1c. National Engineering Laboratory of Integrated Transportation Big Data Application Technology, Southwest Jiaotong University, Chengdu 610031, China; 2. Sichuan Tourism University, Chengdu 610100, China
Abstract:This paper addresses a dynamic service network design problem for freight transportation on Chinese railway networks with single- block train services. To improve the efficient utilization of rolling- stock, a multicommodity flow model with path- based variables is proposed to integrate car-to- block assignment, train scheduling, freight routing and empty car redistribution, considering the unitary rule and in tree rule of loaded car, the limits of empty car flow. A space-time network is constructed with the basic train diagram and wagon- flow routing. A hybrid differential evolution algorithm is used to solve the model. An initial feasible solution is constructed by k - shortest path, greedy and annealing strategies. A practical case is presented to prove the validity of the model and algorithm.
Keywords:railway transportation  train operation plan  differential evolution algorithm  empty car distribution  spacetime network  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《交通运输系统工程与信息》浏览原始摘要信息
点击此处可从《交通运输系统工程与信息》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号