大规模路网上空车调配的区段中心优化法

The Section Center Optimization Method of Empty Car Adjustment on Large-scale Railway Network

针对大规模铁路网上的空车调配问题 ,提出了一种网络变换方法。作为一般小规模的空车调配问题 ,其数学模型属于一类特殊的线性规划问题 ,即运输问题 ,表上作业法具有很好的求解效果。但由于该算法的计算量随着所需处理问题的规模的扩大呈几何速度增加 ,所以对于我国这样拥有数千个装卸站的路网来说 ,直接用计算机求解具有几千个节点的运输问题是相当困难的。文中提出了一种区段中心优化法 ,对于主要支点站周边的中间站进行车流归并 ,以压缩节点的数量 ,从算例上可以看出 ,区段中心优化法在解决大规模路网同构变换问题时具有比较明显的优点 ,节约了计算中所需的时间和空间 ,是解决大规模路网上空车调配问题的有效途径。

This paper proposes a kind of network switching method aiming at solving the problem of empty car distribution on a large scale railway network. As for a small scale empty car distribution its math model attributes to a kind of linear programming, i e., transportation problem. And the table task method can generate a good solution. But the calculation workload increases with the problem scale at a geometrical speed. As a railway network with thousands of loading and unloading stations, it is impossible to solve the problem with computer directly addressing several thousands of nodes. The section center optimization method is brought about to reduce the quantity of nodes by merging the empties flow of the neighboring intermediate stations of the main node stations, resulting in fewer nodes. Seen from calculation example, the section center optimization method has obvious advantages in solving the problem of empties distribution on large scale railway network by isomorphism transfer method , thus saving lots of time and space in calculation. So it is an effective approach to solve the problem of empties distribution on large scale railway network. A calculation case is provided at the end of the paper.