Journal of Transportation Systems Engineering and Information Technology ›› 2018, Vol. 18 ›› Issue (5): 164-169.

• Systems Engineering Theory and Methods • Previous Articles     Next Articles

Dynamic Wagon-flow Allocation Based on Freight Delivery Time Frame in Marshalling Station

LI Sheng-donga, b, XU Chang-ana, b, LV Hong-xiaa, b, c, LI Wen-xina   

  1. a. School of Transportation and Logistics; b. National Railway Train Diagram Research and Training Center; c. National and Local Joint Engineering Laboratory of Comprehensive Intelligent Transportation, Southwest Jiaotong University, Chengdu 610031, China
  • Received:2018-03-15 Revised:2018-04-26 Online:2018-10-25 Published:2018-10-26

基于货物运到期限的编组站动态配流优化研究

李晟东 a, b,徐长安 a, b,吕红霞* a, b, c,李文新 a   

  1. 西南交通大学 a. 交通运输与物流学院;b. 全国铁路列车运行图编制研发培训中心; c. 综合交通运输智能化国家地方联合工程实验室,成都 610031
  • 作者简介:李晟东(1993-),男,四川绵阳人,博士生.
  • 基金资助:

    国家重点研发计划/ National Key Research Program of China(2017YFB1200702);四川省科技创新(苗子工程)培育项目/ Science and Technology Plan of Sichuan Province(2017015);“服务科学与创新”四川省重点实验室开放课题/ Service Science and Innovation Key Laboratory of Sichuan Province(KL1701).

Abstract:

The delivery time frame is a key issue of railway freight transport organization. It is of great significance to improve the quality and competitiveness of railway freight transportation by guaranteeing the delivery time frame. This paper takes the dynamic wagon-flow allocation in marshalling station as the research object. Considering the difference between different goods on the timeliness of transportation, the minimum weighted sum of the residence time of each car is took as the optimization objective. And the mean proportion distribution method is used to assign the delivery time frame to the marshalling station operation link of the freight transport, which becoming the maximum residence time constraint. At the same time, considering the constraints of marshalling destination, a comprehensive optimization model of shunting operation plan and wagon-flow allocation plan based on delivery time frame is established. The simulation annealing algorithm is designed to solve the model. Finally, the case study shows that the model and algorithm in this paper can effectively solve the dynamic wagon-flow allocation problem and satisfy the delivery time frame requirements of wagon-flow.

Key words: railway transportation, delivery time frame, simulated annealing algorithm, wagon-flow allocation, marshalling station

摘要:

运到期限是铁路货物运输组织的关键问题,保障运到期限,对提升铁路货物运输质量与竞争力有重要意义.本文以编组站动态配流为研究对象,考虑不同货物对运输时效性要求的不同,以车流在站停留时间加权值总和最小为优化目标;采用均值比例分配法将运到期限分配到货物运输编组站作业环节,成为车流最大在站停留时间约束,同时考虑编组去向等约束,建立基于运到期限的编组站调机运用计划与配流计划综合优化模型,设计模拟退火算法对模型进行求解.最后通过算例分析表明,本文的模型和算法能够有效地解决编组站动态配流问题,同时满足车流的运到期限要求.

关键词: 铁路运输, 运到期限, 模拟退火算法, 配流, 编组站

CLC Number: