铁路编组站动态配流分层模型  

Hierarchical Model of Dynamic Traffic Assignment at Railway Marshalling Station

作　　者：马亮[1] 郭进[1] 陈光伟 

机构地区：[1]西南交通大学信息科学与技术学院,四川成都610031 [2]中国铁路总公司中国铁路总公司信息技术中心,北京100860

出　　处：《中国铁道科学》2015年第2期87-95,共9页China Railway Science

基　　金：铁道部科技研究开发计划重大项目(2010X010,2012X003-A)

摘　　要：为了使编组站动态配流充分考虑实际解体和编组作业过程,首先基于约束程序中的累积调度和字典序多目标优化理论,按照配流成功的出发列车优先级总和最大、车辆在站平均中转停留时间最小和资源利用率最高3个目标函数的字典序,建立适应于不同解体方式的动态配流字典序多目标累积调度模型,并设计约束传播与多点结构化搜索相结合的混合算法迭代求解,得到解编顺序和初步配流方案;然后,以出发列车车流来源总数最少为目标函数,建立二次配流整数规划模型,并设计贪婪算法对初步配流方案优化。算例结果表明,采用给出的编组站动态配流分层模型和求解算法,可提高铁路编组站的解编调车作业效率和配流方案兑现率。The practical operation processes for the break-up and make-up of trains need to be fully considered in the dynamic traffic assignment at marshalling station.Firstly,based on the theory of constraint programming cumulative scheduling and lexicographic multi-objective optimization, a lexicographic multi-objective cumulative scheduling model of dynamic wagon-flow allocation is built for the purpose to maximize the total number of the departure trains＇priorities,minimize the average dwell time of the railcars and maximize the resource utilization,which can provide different ways to disassemble the inbound trains.The scheduling of break-up and make-up operations and initial wagon-flow allocation plan are gained by solving the model iteratively with the hybrid algorithm of constraint propagation and multipoint constructive search.Secondly,an integer programming model of secondary wagon-flow allocation is built to minimize the total number of the inbound trains which provide railcars to the outbound trains and the initial wagon-flow allocation plan is optimized by the greedy algorithm.Finally,instance validation results indicate that the proposed hierarchical model of dynamic wagon-flow allocation and the solving algorithm can improve the efficiency of shunting operations and redemption rate of the wagon-flow allocation plan at railway marshalling station.

关 键 词：铁路运输 编组站 动态配流 到发车流 解体 编组 

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