Scribd
Upload
67 views

CIVL 365 Tutorial 9 Question

This document contains two questions regarding traffic assignment and route equilibrium. Question 1 involves computing the traffic volumes and travel times on three routes between two zones in equilibrium, given the link performance functions. Question 2 asks to compute the equilibrium traffic volumes and travel times on two routes between two zones using both a graphical solution and an iterative procedure with step-by-step instructions.

Uploaded by

Ivs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
67 views

CIVL 365 Tutorial 9 Question

This document contains two questions regarding traffic assignment and route equilibrium. Question 1 involves computing the traffic volumes and travel times on three routes between two zones in equilibrium, given the link performance functions. Question 2 asks to compute the equilibrium traffic volumes and travel times on two routes between two zones using both a graphical solution and an iterative procedure with step-by-step instructions.

Uploaded by

Ivs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

t13

23 = t31
32 = 4
2

UNIVERSITY OF WINDSOR
Department of Civil and Environmental Engineering

Transportation and Traffic Engineering Summer 2021


87-365 Thank you for your time

Assignment 9
Aug 04, 2021

Question 1:
Consider two traffic zones – zone A is a residential area and zone B is a commercial area. The
commercial area mainly includes job places for the workers who live in the residential area in
zone A. There are currently two routes from zone A to zone B (called “route 1” and “route 2”).
Each route has the following link performance function:

V2
t 2=4 . 25+25 (2000 )
where t1 and t2 = travel times on routes 1 and 2, respectively (min), and V 1 and V2 = volumes on
routes 1 and 2, respectively (veh/hour). A total volume from zone A to zone B is 4400 veh/hour.

Route 1

Zone A: Zone B:
Residential Commercial
Area Route 2 Area

(a) Compute the traffic volume and travel time on the two routes in the equilibrium condition.

1
t13
23 = t31
32 = 4
2

(b) To relieve the congestion on the existing two routes, the city government considers building
a new route (called “route 3”) as shown in the figure below.

Route 1

Zone A: Route 3 Zone B:


Residential Commercial
Area Route 2 Area

Route 3 has the following link performance function:

V3
t 3 =0 . 40+ 16 ( )
2000

where t3 = travel time on route 3 (min) and V3 = volumes on routes 3 (veh/hour).

Compute the new traffic volumes and travel time on the three routes in the equilibrium
conditions using the user equilibrium assignment such that the travel times on all routes are
equal (any methods will be O.K).

Question 2:
Consider two traffic zones – zone A is a residential area and zone B is a commercial area. The
commercial area mainly includes job places for the workers who live in the residential area in
zone A. There are currently two routes from zone A to zone B (called “route 1” and “route 2”).
Each route has the following link performance function:

v1 4 v2 4
t 1=10(1+0.15∗
2000 ( )
) t 2=12(1+0.15∗ ( )
2500
)

where t1 and t2 = travel times on routes 1 and 2, respectively (min), and v1 and v 2= volumes on
routes 1 and 2, respectively (veh/hour). A total volume from zone A to zone B is 3953 veh/hour.

Route 1

Zone A: Zone B:
Residential Commercial
Area Route 2 Area

2
(a) Compute the traffic volume and travel time on the two routes in the equilibrium condition
using a graphical solution. (use the Excel)

(b) Compute the traffic volume and travel time on the two routes in the equilibrium condition
using the following steps. (use the Excel)

Step0. At iteration 0, the volume is zero on each route, calculate the travel time for each route
with zero volume
Step1. Divide each O/D demand into the following
(20%, 15%, 15%, 10%, 10%, 10%, 5%, 5%, 5%, 5%) portions
Step 2. Load the first fraction of O/D demand in the first iteration
(The first portion of the traffic volume (20%) is assigned to the link with the shortest travel time
Step 3. Update the link travel times
Step 4. Another portion of the traffic volume to be assigned is allocated to the link that now has
the shortest travel time
Step 5. The travel time for all links are calculated and revised if changes result.
Step 6. If all of the O/D demand is loaded, stop. If not, update iteration number and go to step 3.

You might also like