针对大规模铁路网上的空车调配问题 ,提出了一种网络变换方法。作为一般小规模的空车调配问题 ,其数学模型属于一类特殊的线性规划问题 ,即运输问题 ,表上作业法具有很好的求解效果。但由于该算法的计算量随着所需处理问题的规模的扩大呈几何速度增加 ,所以对于我国这样拥有数千个装卸站的路网来说 ,直接用计算机求解具有几千个节点的运输问题是相当困难的。文中提出了一种区段中心优化法 ,对于主要支点站周边的中间站进行车流归并 ,以压缩节点的数量 ,从算例上可以看出 ,区段中心优化法在解决大规模路网同构变换问题时具有比较明显的优点 ,节约了计算中所需的时间和空间 ,是解决大规模路网上空车调配问题的有效途径。文末给出了具体算例 Aiming at the problem of empty car deployment on large scale railway network, a network transformation method is proposed. As a general small-scale deployment of empty vehicles, its mathematical model belongs to a special type of linear programming problem, that is, transport problems, table operation method has a good solution. However, since the computational complexity of the algorithm increases with the increase of the scale of the problem to be dealt with, the problem of transportation with thousands of nodes is directly solved by the computer for a road network with thousands of loading and unloading stations in our country It is quite difficult. In this paper, a section center optimization method is proposed, which is used to reduce the number of nodes in the middle stations around the main fulcrum station. From the example, it can be seen that the section center optimization method is effective in solving the problem of large-scale road network isomorphism Transforming the problem has obvious advantages, saving the time and space required in the calculation, which is an effective way to solve the problem of empty car deployment on large-scale road network. The end of the article gives a specific example