A minimum-time algorithm can be used to generate realistic highway routes between specific origins and destinations. Minimizing distances on links will not produce realistic railroad routes if links bear any resemblance to physical trackage. There are also multiple routes between two points since each carrier has its own philosophy. This paper outlines a systematic method of preparing information such that a computer algorithm can generate realistic routes for single- or multiple-carrier movements. (ERA citation 05:007312)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Algorithmic Generation of Railroad and Highway Routes


    Contributors:
    J. T. Low (author) / R. C. Bushnell (author) / R. Shannon (author) / R. Borsos (author) / J. Graham (author)

    Publication date :

    1979


    Size :

    24 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Overseas railroad becomes highway

    Duncan, B.M. | Engineering Index Backfile | 1938



    Making highway-railroad crossings safer

    Benesch, A. | Engineering Index Backfile | 1938


    Highway construction produces railroad traffic

    Harrison, J.L. | Engineering Index Backfile | 1933


    Railroad-highway grade crossing handbook

    Bolon, Lucien M. | SLUB | 1978