铁路双向编组站列车-车场指派优化模型与算法  

Optimization Model and Algorithm for Train-to-Yard Assignment atRailway Bidirectional Marshalling Stations

作　　者：赵军[1,2] 张思宇 赵嵩森[3] 彭其渊 ZHAO Jun;ZHANG Siyu;ZHAO Songsen;PENG Qiyuan(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 611756,China;National United Engineering Laboratory of Integrated and Intelligent Transportation,Southwest Jiaotong University,Chengdu 611756,China;Zhengzhou Station,China Railway Zhengzhou Group Co.,Ltd.,Zhengzhou 450000,China)

机构地区：[1]西南交通大学交通运输与物流学院,四川成都611756 [2]西南交通大学综合交通运输智能化国家地方联合工程实验室,四川成都611756 [3]中国铁路郑州局集团有限公司郑州站,河南郑州450000

出　　处：《铁道学报》2024年第6期22-35,共14页Journal of the China Railway Society

基　　金：国家自然科学基金(52272325);四川省自然科学基金(2023NSFSC0390);中国国家铁路集团有限公司科技研究开发计划(K2022X016)。

摘　　要：研究铁路双向编组站在作业计划编制中的列车-车场指派优化问题,给定计划时段内的到达列车信息、出发列车信息及其编组要求,以及各系统的接发车能力与解编能力,该问题在于灵活确定到达列车的接入系统与出发列车的发出系统。根据双向编组站技术作业过程,以车辆在站总停留时间最小为目标,考虑到发列车间的车流接续、出发列车编组要求和车站作业能力限制等实际约束,将原问题先构建为混合整数非线性规划模型,再进一步转换为混合整数线性规划模型。此外,设计遗传算法快速寻找近似最优解,该算法对到达列车的接入系统进行二进制编码,基于此设计1个启发式解码规则获得原问题的可行解。最后,以切实算例验证所提出方法相较于现场经验规则的优越性,并分析系统解编能力与接发车条件对方法性能及求解结果的影响。This paper studied a train-to-yard assignment optimization problem in the design of operation plans for a railway bidirectional marshalling station.Given the information of inbound trains,the information of outbound trains and their assembly requirements,as well as the receiving,departure,disassembly and assembly capacity for each system,this problem lay in flexibly assigning the receiving system for inbound trains and the departure system for outbound trains.According to the technical operation procedures at bidirectional marshalling stations,the studied problem was first formulated as a mixed integer nonlinear programming model to minimize the total dwell time of railcars at the station,which was further transformed into a mixed integer linear programming model.Practical requirements such as the railcar connection restrictions between inbound and outbound trains,the assembly requirements for outbound trains,and the station capacity limitations,were all included into the model.Besides,a genetic algorithm,developed to quickly find near-optimal solution,encoded the receiving system for inbound trains by a binary-based representation,based on which a decoding heuristic was designed to obtain a feasible solution for the original problem.Finally,a realistic case was used to validate the superiority of the proposed approaches compared to the empirical methods used in practice.An analysis was given on the effects of the system disassembly and assembly capacity as well as the system receiving and departure conditions on the performance and results of the proposed approaches.

关 键 词：铁路运输 列车-车场指派 双向编组站 整数规划 定制遗传算法 

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