交通运输系统工程与信息 ›› 2021, Vol. 21 ›› Issue (2): 180-188.

• 系统工程理论与方法 • 上一篇    下一篇

考虑空车调配协调的货物列车开行方案优化研究

刘晓伟1a,1b,1c,晏启鹏1a, 2,倪少权*1a,1b,1c,吕苗苗1a,1b,1c,吕红霞1a,1b,1c   

  1. 1.西南交通大学,a.交通运输与物流学院,b.综合交通运输智能化国家地方联合工程实验室, c.综合交通大数据应用技术国家工程实验室,成都 610031;2.四川旅游学院,成都 610100
  • 收稿日期:2020-05-26 修回日期:2021-01-21 出版日期:2021-04-25 发布日期:2021-04-25
  • 作者简介:刘晓伟(1981- ),男,湖北南漳人,博士生。
  • 基金资助:

    国家重点研发计划/National Key Research and Development Program of China (2017YFB1200702);国家自然科学基金/ National Natural Science Foundation of China(52072314);四川省科技计划项目/ Sichuan Science and Technology Program (2020YFH0035)。

Railway Freight Transportation Service Network Design Problem with Empty Car Distribution

LIU Xiao-wei1a,1b,1c , YAN Qi-peng1a, 2 , NI Shao-quan*1a,1b,1c, LV Miao-miao1a,1b,1c , LV Hong-xia1a,1b,1c   

  1. 1a. 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
  • Received:2020-05-26 Revised:2021-01-21 Online:2021-04-25 Published:2021-04-25

摘要:

为实现空车调配与货物列车开行方案协调优化,结合基本运行图架构与车流径路,构建货运时空服务拓展网络。考虑配空与装卸取送、集编发等环节的时间接续要求,节点与区段不对流空车要求,以重车流全程运送与空车配送等广义总费用最少为目标,建立整数规划弧路模型。针对既有算法设计局限性,结合重车或空车配空的时间接续要求,提出将不同的 k 短路重车流方案与空车配空方案相关联的改进可行解构造方法,设计混合差分进化求解算法。实例研究表明,考虑空车调配进行重车、空车流组织协调优化,能够减少空车走行费用,及时满足装车需求,有效保证作业车流配合中转车流集结编组及时挂线,提高方案可实施性。

关键词: 铁路运输, 列车开行方案, 差分进化算法, 空车调配, 时空网络

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.

Key words: railway transportation, train operation plan, differential evolution algorithm, empty car distribution, spacetime network

中图分类号: