Railway empty cars distribution is a complicated problem of flow distribution in railway network. Because empty cars are insufficient in China, the directions of empty cars flow have been arranged under a very strict daily plan. Combined with the conditions of empty cars supply-demand equilibrium, the linear programming model for distribution of empty cars is established in order to realize empty cars running distance minimum. To solve the model, the problem of railway empty cars distribution is converted into single source and sink network through dummy source node and dummy sink node. The optimal scheme of railway empty cars distribution can be reached by finding a maximum-flow of minimum-cost from the source node to the sink node of the network. In this paper, we firstly find the maximum of the network and constantly adjust increment cycle so as to decrease the cost of the network, eventually obtain the optimal solution. Experimental results show that the feasibility and validity of railway network of empty cars distribution model.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Minimum-Cost and Maximum-Flow Algorithm for Railway Empty Cars Distribution


    Contributors:

    Conference:

    Second International Conference on Transportation Engineering ; 2009 ; Southwest Jiaotong University, Chengdu, China



    Publication date :

    2009-07-29




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    The Minimum-Cost and Maximum-Flow Algorithm for Railway Empty Cars Distribution

    Guo, Q. / Li, C. / Chen, D. et al. | British Library Conference Proceedings | 2009



    The UK's empty railway?

    Glover, John | IuD Bahn | 2005


    Distribution of empty transport units in railway network

    Gottfried, G. | Engineering Index Backfile | 1968


    MOTION PROFILE FOR EMPTY ELEVATOR CARS AND OCCUPIED ELEVATOR CARS

    HSU ARTHUR / GINSBERG DAVID / PASINI JOSE MIGUEL | European Patent Office | 2018

    Free access