首页 | 本学科首页   官方微博 | 高级检索  
     检索      

铁路OD分配优化方法
引用本文:史峰,黎新华,莫辉辉,颜湘礼,廖时元.铁路OD分配优化方法[J].中国铁道科学,2004,25(4):116-119.
作者姓名:史峰  黎新华  莫辉辉  颜湘礼  廖时元
作者单位:1. 中南大学,交通运输工程学院,湖南,长沙,410075
2. 铁道第四勘察设计院,线路站场设计研究处,湖北,武汉,430063
摘    要:基于最短径路、合并径路、适度分流径路三种径路形式研究铁路OD分配问题。通过巧妙地构造合并径路邻域系,设计优化合并径路分配方案的模拟退火算法,解决铁路OD分配的核心问题。进而在合并径路分配方案的基础上,采用贪婪算法增加分流径路获得适度分流径路分配方案,以解决能力相对紧张的铁路运输网络的OD分配问题。大规模铁路OD分配实例计算表明,这些优化方法具有良好的优化质量和运算效率。

关 键 词:铁路运输组织  OD分配  合并径路  模拟退火算法  贪婪算法
文章编号:1001-4632(2004)04-0116-04
修稿时间:2003年8月18日

An Optimal Method for Railway Origin Destination Assignment
SHI Feng,LI Xin-hua,MO Hui-hui,YAN Xiang-li,LIAO Shi-yuan.An Optimal Method for Railway Origin Destination Assignment[J].China Railway Science,2004,25(4):116-119.
Authors:SHI Feng  LI Xin-hua  MO Hui-hui  YAN Xiang-li  LIAO Shi-yuan
Institution:SHI Feng~1,LI Xin-hua~1,MO Hui-hui~1,YAN Xiang-li~2,LIAO Shi-yuan~2
Abstract:The assignment problem is researched based on shortest path, merge path and appropriate diversion path. A simulated annealing algorithm for smartly structuring a neighbourhood system of the merge path and optimizing merge path assignment is used to solve the core problem of OD assignment. Subsequently, based on the merge path assignment, a greedy algorithm is employed to increase diversion flow path and obtain appropriate diversion path assignment options so that a solution may be found for OD assignment for a railway network without ample capacity. The calculation in a large-scale example of railway OD assignment shows this method of optimization results in good quality of optimization and high efficiency of calculation.
Keywords:Railway traffic organization  Railway origin destination assignment  Merge path  Simulated annealing algorithm  Greedy algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号