线路通过能力限制下的变参数空车调配模型研究

ombined with the restrictive conditions of cars supply-demand equilibrium and line carrying capacity, and the variable cost parameter for each empty car flow delivering with multi route selection, the programming model for distribution of empty cars is established aiming at the minimization of consuming car-kilometer, which is solved by LINGO. In practice, the more balance car-flow distributed on the lines, the more effective utilize of every line carrying capacity. Applied result has testified the feasibility and validity and high efficient of railway network empty cars distribution model.