铁路OD分配优化方法

An Optimal Method for Railway Origin Destination Assignment

基于最短径路、合并径路、适度分流径路三种径路形式研究铁路OD分配问题。通过巧妙地构造合并径路邻域系,设计优化合并径路分配方案的模拟退火算法,解决铁路OD分配的核心问题。进而在合并径路分配方案的基础上,采用贪婪算法增加分流径路获得适度分流径路分配方案,以解决能力相对紧张的铁路运输网络的OD分配问题。大规模铁路OD分配实例计算表明,这些优化方法具有良好的优化质量和运算效率。

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.