基于改进局部分支法的列车编组计划研究  

Research on Train Formation Plan Based onImproved Local Branching Algorithm

作　　者：张长泽 Zhang Changze(Track Alignment and Station Yard Design&Research Department,China Railway SIYUAN Survey&Design Group Co.,Ltd.,Wuhan 430063,China)

机构地区：[1]中铁第四勘察设计院集团有限公司线站院,武汉430063

出　　处：《青海交通科技》2023年第2期24-30,共7页Qinghai Transportation Science and Technology

摘　　要：货物列车编组计划(TFP)是确定列车路线以及将车流变为列流的一种组织方式。首先针对TFP问题,建立以改编和集结车小时为最小目标的数学模型;然后,为求解TFP模型,提出了一种改进的局部分支算法,该方案虽旨在改善混合整数规划(MIP)求解器的启发式行为,但在本质上是精确的。在局部分支算法模型中,为二进制变量建立了附加约束;但是在改进的局部分支算法中,将模型中的整数变量建立了附加约束。最后,为了评估提出的算法在求解TFP问题中具有可行性和有效性,通过实验设计模拟并解决了5个测试问题,结果表明了该方法的有效性和稳定性。Freight Train Formation Planning(TFP)is a method of organizing train routing and changing the flow of cars into a train flow.The article firstly aims at the TFP problem and establishes a mathematical model with the minimum objective of resorting operation cost and fixed assembly time;then,in order to solve the proposed train TFP model,an improved local branching algorithm is proposed.Although it is designed to improve the heuristic behavior of the mixed integer programming(MIP)solver at hand.In the local branching algorithm,additional constraints are built in the model for the binary variables,but in the improved local branching algorithm,the additional constraints are built in the model for integer variables.Finally,in order to evaluate the feasibility and effectiveness of the proposed algorithm in solving TFP problems,this paper simulates and solves five test problems through experimental design,and the results show the effectiveness and stability of the method.

关 键 词：列车编组计划 改编费用 集结时间 局部分支算法 

分 类 号：U292.31[交通运输工程—交通运输规划与管理]