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)
Algorithmic Generation of Railroad and Highway Routes
1979
24 pages
Report
Keine Angabe
Englisch
Railroad Transportation , Road Transportation , Transportation & Traffic Planning , Cargo , Railways , Roads , Transportation sector , Algorithms , Computerized simulation , Decision making , Distance , Ethics , Maps , Regional analysis , Statistical models , Time dependence , Trains , Transport , Trucks , Usa , ERDA/320200 , ERDA/290000 , ERDA/290100
Overseas railroad becomes highway
Engineering Index Backfile | 1938
|Railroad/Highway Accident Reports
NTIS | 1982
Highway construction produces railroad traffic
Engineering Index Backfile | 1933
|Railroad-highway grade crossing handbook
SLUB | 1978
|Illumination of highway-railroad crossings
Engineering Index Backfile | 1937
|