It is shown that any traffic assignment by shortest path method based on time alone is out of balance because procedure always assigns too many trips to high-speed facility and too few trips to slow-speed facility; method is presented of assigning weights to time and to distance in factor to bring about necessary balance in assignment; proportion of time and distance which assigned same volumes to freeway (or bypass) as measured volumes also gave average speed of network close to weighted average measured speed of network.
Traffic assignment by shortest path method using TD factor
Traffic Quarterly
Traffic Quarterly ; 21 , n 4
1967
15 pages
Article (Journal)
English
© Metadata Copyright Elsevier B. V. All rights reserved.
Evaluation of shortest path algorithms in a distributed traffic assignment environment
Tema Archive | 2003
|Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment
British Library Conference Proceedings | 2003
|Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment
SAE Technical Papers | 2003
|Evaluation of shortest path algorithms in a distributed traffic assignment environment
Automotive engineering | 2003
|