设为首页 |  加入收藏
首页期刊介绍编 委 会投稿须知稿 约征订启事合作办刊联系我们English
 
编组站配流问题中多阶段优化算法的启发式规则
作者:郭瑞1 2 郭进1 苏跃斌1 
单位:1. 西南交通大学 信息科学与技术学院,四川 成都 610031;2. 郑州轻工业学院 计算机与通信工程学院,河南 郑州 450002
关键词:编组站 配流 多阶段算法 启发式规则 
分类号:
出版年·卷·期(页码):2017·39·第6期(1-9)
摘要:

以所有车辆在站停留时间最短为目标,对单向单推单溜配流模型进行理论分析,证明该模型下的三个优化目标转换定理,并在不同假设条件下得出8个推论。为了验证上述定理和推论的启发效果,将它们设计为各阶段选择解体列车和编制配流方案的优先规则,并构建以每列出发列车获得最大车流数最多为子目标的多阶段配流问题推理算法,实例结果表明该算法可在线性时间复杂度内获得高效近似解。

This paper carried on the theoretical analysis of the single directional,single pushing and single humping wagon-flow allocation model,with the shortest car dwell time at stations as the objective.The transformation theorem of three optimization objectives under the model was proved by mathematical proof,and the eight deductions were obtained under different hypothesis conditions.In order to verify the validity of the heuristic rules of above theorems and deductions,they were designed as priority rules of selecting train breaking-up and the wagon-flow plans in each stage.The reasoning algorithm of multistage wagon-flow allocation target was used,which took the maximum number of departure trains as sub-objective.The experimental results showed the efficient approximate solution of the algorithm in linear time complexity.

参考文献:
服务与反馈:
文章下载】【发表评论】【查看评论】【加入收藏
提示:您还未登录,请登录!点此登录
 
友情链接   更多

地址:北京复兴路10号  中国铁道学会《铁道学报》编辑部    邮编:100844      电话:(010)51842631 / 51847451 
传真:(010)51892424       邮箱:tdxb@vip.163.com   京ICP备09031577号