针对大规模路网上的空车调配问题，提出了一种网络变换方法-振荡法。
The reiterative adjusting method is introduced in the paper to solve the problem of empty wagon distribution on large scale railway network.
以消耗的车公里数最小为目标，建立大规模路网上空车调整问题的数学模型。
The mathematics model of empty car adjustment on large scale railway network was established which aimed at the minimization of consuming wagon-kilometers.
在对经典路径优化算法性能进行分析的基础上，指出了现有路径优化算法在大规模路网条件下实时性差的问题。
The analysis of the traditional traffic path optimization algorithms showed that their realtime capability appear insufficient under the largescale road network conditions.
路网结构的复杂性和运输生产的动态性，决定了要获得较大规模的实际空车调配问题的最优解是不可能或非常困难的。
Because of the complexity and dynamic nature of the railway transportation network, it is difficult, or even impossible, to find an optimal solution for an actual large scale empty car distribution.
道路网络通常是大规模和复杂的网络，而一般的最短路径算法需要大量的计算时间。
Road networks are usually large scale and complicated networks. Therefore, general algorithms of shortest path are not appropriate because they require much computation time.
道路网络通常是大规模和复杂的网络，而一般的最短路径算法需要大量的计算时间。
Road networks are usually large scale and complicated networks. Therefore, general algorithms of shortest path are not appropriate because they require much computation time.
应用推荐