Distributing empty freight cars throughout a railroad system in anticipation of future requirements is an allocation problem. the actual movement of cars can be examined in terms of a space-time diagram. An inductive network flow algorithm for solving this problem utilizing the network underlying the space-time diagram is developed and illustrated by an example. A computer program implementing this algorithm is discussed, along with the context in which it might be used. Possible extensions are also presented.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A network algorithm for empty freight car allocation


    Contributors:

    Published in:

    IBM Systems Journal ; 8 , 2 ; 147-169


    Publication date :

    1969


    Size :

    23 Seiten, 10 Bilder, 12 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Network algorithm for empty freight car allocation

    White, W.W. / Bomberault, A.M. | Engineering Index Backfile | 1969


    Fleet Sizing and Empty Freight Car Allocation

    Hungerländer, Philipp / Steininger, Sebastian | British Library Conference Proceedings | 2018


    Improved Empty Freight Car Distribution

    Holmberg, Kaj | Online Contents | 1998


    Empty and load freight brake

    Engineering Index Backfile | 1915


    Improved Empty Freight Car Distribution

    Holmberg, K. / Joborn, M. / Lundgren, J. T. | British Library Online Contents | 1998