基于解编顺序的阶段计划车流推算模型及算法  

Model and Algorithm for Estimation of Wagon Flow of Stage Operating Plan Based on Break-up and Make-up Sequences

作　　者：王正彬[1] 杜文[2] 吴柏青[1] 羊艳[1] 

机构地区：[1]西南交通大学峨眉校区,四川峨眉山614202 [2]西南交通大学交通运输学院,四川成都610031

出　　处：《西南交通大学学报》2008年第1期91-95,共5页Journal of Southwest Jiaotong University

基　　金：铁道部科技研究开发项目(2003X033)

摘　　要：为实现车站调度指挥自动化,考虑到出发列车的编组内容和车流来源与列车解体、编组顺序紧密相联,以调机活动为核心,建立了技术站阶段计划的车流推算模型.从寻找最优的列车解体、编组顺序出发,结合求解运输问题的表上作业方法,设计了求解该模型的混合遗传算法,并开发了相应的软件.实例表明,用该算法,在普通P4微机上的运行时间不超过10 min.In order to realize automational dispatch, an estimation model for wagon flow of a stage operating plan for a technical station was established based on the close relationship between the make- up content and source of outbound trains and the sequences of break-up and make-up operations of trains and by taking the operation of shunting locomotive as the core factor. Based on the optimal break-up and make-up sequences of trains and by combining with the tabular method in solving transportation problems, a hybrid-genetic algorithm for this model was designed, and the relevant program software was developed. An axample shows that the running time of the designed algorithm does not exceed 10 min on an ordinary P4 computer.

关 键 词：技术站 车流组织 阶段计划 混合遗传算法 

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