3. The image below shows a network for Ryans World. The zone names are shown inside the boxes and the interzonal travel times are indicated on the links. Use incremental assignment and assume two increments of loading, 50% each. Only consider the link volumes based on the trips from zone A to all other zones. Use the capacity constraint information provided to determine the shortest routes for each increment. The shortest paths should be developed using the network labeling method from class. To complete this problem, you will have to complete this process twice; once for existing travel times and a second time using travel times that are adjusted based on the congestion caused by the first 50% of the traffic. Show all of your work. Does your answer satisfy Wardrops equilibrium criteria? Why or why not?

2 5 n! E F G 3 1 WF1 A 3 2 N 4 3 ol le Pk-Hr. From Zone To Zone Trips 2 2 A B 40 B C 60 11 D 120 2_4_2 2 E 100 F 120 G 20 A 2 H 110 3 2 3 1 90 J 40 K 20 L 100 M 70 N 60 0 20 P 30 Al link capacities can be assumed to be 300 vehicle trips per hour. You should use the following volume-to-capacity adjustment factors: Adjustment VIC Ratio Factor 0.0 -0.70 1.0 0.71 -0.85 1.8 0.86 - 1.00 2.5 >1.00 3.0 2 5 n! E F G 3 1 WF1 A 3 2 N 4 3 ol le Pk-Hr. From Zone To Zone Trips 2 2 A B 40 B C 60 11 D 120 2_4_2 2 E 100 F 120 G 20 A 2 H 110 3 2 3 1 90 J 40 K 20 L 100 M 70 N 60 0 20 P 30 Al link capacities can be assumed to be 300 vehicle trips per hour. You should use the following volume-to-capacity adjustment factors: Adjustment VIC Ratio Factor 0.0 -0.70 1.0 0.71 -0.85 1.8 0.86 - 1.00 2.5 >1.00 3.0