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)


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Network algorithm for empty freight car allocation


    Weitere Titelangaben:

    IBM Syst J


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

    Erschienen in:

    Erscheinungsdatum :

    1969


    Format / Umfang :

    23 pages


    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch


    Schlagwörter :


    A network algorithm for empty freight car allocation

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


    Empty and load freight brake

    Engineering Index Backfile | 1915