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


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Network algorithm for empty freight car allocation


    Additional title:

    IBM Syst J


    Contributors:

    Published in:

    Publication date :

    1969


    Size :

    23 pages


    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English


    Keywords :


    A network algorithm for empty freight car allocation

    White, W.W. / Bomberault, A.M. | Tema Archive | 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