节点文献

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

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

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王正彬杜文吴柏青羊艳

【Author】 WANG Zhengbin1,2,DU Wen2,WU Baiqing1,2,YANG Yan1(1.Emei Campus,Southwest Jiaotong University,Emeishan 614202,China;2.School of Traffic and Transportation,Southwest Jiaotong University,Chengdu 610031,China)

【机构】 西南交通大学峨眉校区西南交通大学交通运输学院西南交通大学峨眉校区 四川峨眉山614202四川成都610031四川峨眉山614202

【摘要】 为实现车站调度指挥自动化,考虑到出发列车的编组内容和车流来源与列车解体、编组顺序紧密相联,以调机活动为核心,建立了技术站阶段计划的车流推算模型.从寻找最优的列车解体、编组顺序出发,结合求解运输问题的表上作业方法,设计了求解该模型的混合遗传算法,并开发了相应的软件.实例表明,用该算法,在普通P4微机上的运行时间不超过10 min.

【Abstract】 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.

【基金】 铁道部科技研究开发项目(2003X033)
  • 【文献出处】 西南交通大学学报 ,Journal of Southwest Jiaotong University , 编辑部邮箱 ,2008年01期
  • 【分类号】U292.3
  • 【被引频次】64
  • 【下载频次】641
节点文献中: 

本文链接的文献网络图示:

本文的引文网络