铁路集装箱空箱安全高效调拨的计算机算法

Computerized Calculation of Safe and Efficient Allocating of Vacant Containers in Railway Network

铁路集装箱安全运输的重要内容是确保集装箱运输的连续性 ,而集装箱空箱的高效率、低成本的调拨是铁路集装箱运输连续性的重要前提。为此 ,笔者提出了一种解决铁路路网上集装箱空箱调拨问题的计算机算法 ,该算法将此类问题视为一种特定的运输问题去求解 ,其目标是使得调拨集装箱的运输费用 (箱·公里 )最小 ,费用系数是两个相关站点的最短运输距离 ,并给出集装箱调拨的算例 ,实例证明了该算法是富有效率且可行性好 ,能够满足铁路集装箱运输的高效、快速、便捷运输要求。

The most important task of the railway container transportation is to keep the transportation continuity. The prerequisite of continuity for railway container transportation is to allocate the vacant containers with highest efficiency and lowest cost. A computerized calculation is developed to solve this problem, in which the problem is taken as a special transportation problem with an objective of minimum transportation cost (unit·kilometer), taking the shortest path between two relative cargo terminals as the cost coefficient. A calculation example of vacant container allocation is provided. The exemplified case proves that this method is feasible and effective, which would meet the transportation requirements of high efficiency, speed, and easy operation.