铁路网货车车流经路分配的优化模型及算法

THE OPTIMIZATION MODEL AND ALGORITHM OF THE DISTRIBUTION OF CARS' PATHS IN A RAILWAY NETWORK

提出了铁路网车流经路选择的优化模型,它是一个线性规划问题。模型以路网总的运营费用最低作为目标函数,同时考虑了线路、车站的能力约束。由于LP模型的规模大,因此提出一种近似的网络算法,并通过实例计算,证明了方法的实用性。

We propose an optimization model for the distribution of cars' paths in a railway network. It is a linear programming problem with minimizing the total operational cost as its object function and taking the restraint of are and node capacities into consideration.In view of the large scale of the LP model, we propose an approximative graphic algorithm, which proves effective in application.