Multi-type empty car dynamic distribution method based on capacity constraints
ZHANG Hongbin
DONG Baotian
SUN Yuanyun
Abstract：Empty car service network of time and space is proposed to cater for the dynamic char-acteristic of railway transportation system,and the dynamic programming model based on capaci-ty constraints is proposed considering the actual transport capacity constraints in the production. Empty car stranded costs and unsatisfied demand penalty costs related to time factor,car substi-tution costs are considered in obj ect function.Railway network arc carrying capacity,empty car supporting and needing stations'capacity are all concluded in the restrain conditions of the formu-lation.A simulated annealing (SA)algorithm integrating K shortest path algorithm is designed, and a two steps optimization strategy is proposed to solve the problem.Finally,a simple network is to verify the model,and the results indicate that the integrating K shortest path algorithm can get preferable revenue under capacity constraints.
Keywords：railway transportationcapacity constraintsmulti-type empty car dynamic distribu-tionservice network of time and spacesimulated annealing algorithm
Publication Date：2016-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 50-56 )