Traffic and Highway Engineering
Traffic and Highway Engineering
5th Edition
ISBN: 9781305156241
Author: Garber, Nicholas J.
Publisher: Cengage Learning
Question
Book Icon
Chapter 12, Problem 26P
To determine

The minimum path from zone to zone using all-or-nothing assignment.

Blurred answer
Students have asked these similar questions
Example: The figure represents travel times on the link connecting six zonal centroids. Determine the minimum path from each zone to each other zone. Use the all-or-nothing assignment method to determine the total trips for each link after all of the trips from the following two-way trip table have been loaded onto the network. From/To 1 1 0 2 3 4 5 6 3.3 4.3 5 4.8 3 Trips Between Zones 2 1000 0 7.2 2.2 3 1100 1050 0 12.6 6 7.8 5.0 4 400 700 5 1000 1100 1200 1150 0 800 0 5.0 1 8.4 2 6 1300 1200 1600 400 700 0
Given the following transportation network and the production/attraction data in each zone. 3 min 3 3 min 4 min 3 min 4 min 2 min 4 min 2 7 min Production/Attraction Table Zone 1 2 3 4 5 Production 600 1000 500 Attraction 300 200 350 400 The number of trips that originates from Zone 3 and ends in Zone 1 is 13 88 29 None of the above
Given the following transportation network with travel time in minutes: 3 2 2. 3 4 3 The trip production from TAZ 3 is 1,000. The trip attractions from TAZ 3 to all other zones are shown below: From/To 1 500 2 300 4 Trip Attraction 300 The minimum path from zone 3 to zone 1 is: Links 3-4, 4-1 5 min Links 3-2, 2-1 Link 3-1
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Traffic and Highway Engineering
Civil Engineering
ISBN:9781305156241
Author:Garber, Nicholas J.
Publisher:Cengage Learning