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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A network algorithm for empty freight car allocation


    Beteiligte:
    White, W.W. (Autor:in) / Bomberault, A.M. (Autor:in)

    Erschienen in:

    IBM Systems Journal ; 8 , 2 ; 147-169


    Erscheinungsdatum :

    1969


    Format / Umfang :

    23 Seiten, 10 Bilder, 12 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    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