Figure below shows a simple highway network consisting of three zones (1, 2, and 3) and four links (AB, AC, BC, and CD).

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

Figure below shows a simple highway network consisting of three zones (1, 2, and 3) and four links (AB, AC, BC, and CD).

Post by answerhappygod »

Figure below shows a simple highway network consisting of three
zones (1, 2, and 3) and four links (AB, AC, BC, and CD). Note the
arrows on each link indicating that the link is a two-way or
one-way link. The link performance functions for each link are also
provided below. The inter-zonal travel demand is as follows: 1 to
2, 600 trips; 1 to 3, 1000 trips; and 2 to 3, 400 trips.
Figure Below Shows A Simple Highway Network Consisting Of Three Zones 1 2 And 3 And Four Links Ab Ac Bc And Cd 1
Figure Below Shows A Simple Highway Network Consisting Of Three Zones 1 2 And 3 And Four Links Ab Ac Bc And Cd 1 (76.83 KiB) Viewed 24 times
TAB = 8.0 + 0.005(VAB)
TAC = 10.0 + 0.02(VAC)
TBC = 6.0 + 0.004(VBC)
TCD = 12.0 + 0.02(VCD)
Where: T = Travel Time on Link
V = Traffic Flow on Link
Based on the information provided above, calculate the
following:
[a] Calculate the traffic flows on each link of the network
using a minimum path (all or nothing) traffic assignment
method.
Calculate the traffic flows on each link of the network
using an incremental capacity-constrained traffic assignment model
for the traffic flow between Zone 1 and Zone 3 with four iterations
consisting of 40%, 30%, 20%, and 10% of the traffic flow loading
per iteration. Assume a minimum path assignment for the remaining
zone pairs and load those volumes on the network after the second
increment of the 1 to 3 flows have been assigned.
[c] Calculate the traffic flows on each link of the network
using Wardrop’s First Principle of traffic assignment traffic
assignment model for the traffic flow between Zone 1 and Zone 3.
Assume a minimum path assignment for the remaining zone pairs and
load those volumes on the network first.
[d] Calculate the traffic flows on each link of the network
using Wardrop’s Second Principle of traffic assignment traffic
assignment model.
[e] Calculate the total system travel time for each of the
methods analyzed in Part [a] through [d] and discuss your findings.
Which method results in the most optimal system travel time?
4 -→3 D A ठी
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply