Scribd
Upload
62 views

CE-751Urban Transportation Systems Planning: Traffic Assignment - TRC Method

This document describes the traffic assignment TRC method. It is an iterative process where travel times are calculated based on current traffic volumes, and volumes are assigned to routes based on updated travel times, recalculating until volumes and times converge. The document provides an example assignment problem with two routes, shows the calculation steps over multiple iterations, and concludes that the TRC method efficiently converges to a solution for traffic assignment on networks with multiple paths and nodes.

Uploaded by

Aryanth Reddy
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
62 views

CE-751Urban Transportation Systems Planning: Traffic Assignment - TRC Method

This document describes the traffic assignment TRC method. It is an iterative process where travel times are calculated based on current traffic volumes, and volumes are assigned to routes based on updated travel times, recalculating until volumes and times converge. The document provides an example assignment problem with two routes, shows the calculation steps over multiple iterations, and concludes that the TRC method efficiently converges to a solution for traffic assignment on networks with multiple paths and nodes.

Uploaded by

Aryanth Reddy
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

CE-751Urban Transportation Systems Planning

AssignmentNo:12

Traffic Assignment TRC method

Dateof Submission:14/10/2013

Submitted by:
SrinivasThadoju
133040009

Contents
12

Traffic Assignment TRC method........................................................................... 3

12.1 Introduction .............................................................................................................. 3


12.2 TRC Method ............................................................................................................ 3
12.3 Assignment Problem ................................................................................................ 4
12.4 Calculations.............................................................................................................. 4
12.5 Conclusion ............................................................................................................... 6

Assignment No. 12

12 Traffic Assignment TRC method


12.1 Introduction
Travel Demand Modeling consists of four stages which include trip generation,trip
production, model split ,traffic assignment. Traffic assignment is nothing but assigning
the volumes on different routes of a network.

12.2 TRC Method


TRC method is the one of popular method for calculating the traffic assignment based
on congestion.
It is a iterative procedure.
First we calculate the travel time based on current congestion.
Based on travel time volumes on corresponding route is derived.
For every volume we will recalculate the travel time which to be used in next iteration.
This doesnt imply that it does dynamic Traffic Assignment (DTA) but that average
volume on a link remains constant on the link throughout an iteration performed for a
particular duration time for which the data is provided.
The formulation of the given model can be done in following manner

where
tr = travel time on route r (minutes)
trc = unit travel time at the critical volume (min/mile)
d = delay parameter (min/mile)

0.50
1.0

Vr = Volume of traffic on route r (veh/hr/lane)


Vc = Critical volume for the route r (veh/hr/lane)

Lr = length of the route r (miles)


Calculation of volume is based on this formula
1

where
Vr = Volume of traffic on route r (veh/hr/lane)
tr =travel time on route r (minutes)
V =the total volume of trips from zone I to j on all routes

12.3 Assignment Problem


Table 12. 1:Assignment Problem

Critical
Volume

Critical
Travel
Time
(min/mile)

Travel Time
with no
volume
(min/mile)

Route
No.

No. of
Lanes

Speed
Limit
(mph)

30

600

2.5

50

1100

1.5

Signals/mile

Length
(km)

Total traffic volume to be assigned = 1200 veh/lanes/hr

12.4 Calculations
Here travel time with no volume already given.
So tr1=2.5*3*0.621
=2.5*1.86=4.6588
tr2=1.5*4*0.621
=1.5*2.49=3.726

1200=533

Vr1=
.

1200 =667

Vr2=
.

= 3
= 2

*1.86=5.479

*667=4.488

Similarly this procedure is repatriated until tr=tr2


Iteration 1
Route
1
2

tr
4.658
3.726

1/tr
0.21471
0.26838
0.48309

Vr
533
667

tr'
5.477
4.490

tr'
5.477
4.490

1/tr'
0.18259
0.22274
0.40533

Vr'
541
659

tr''
5.488
4.481

tr''
5.488
4.481

1/tr''
0.18222
0.22315
0.40537

Vr''
539
661

tr'''
5.486
4.483

tr'''
5.486
4.483

1/tr'''
0.18228
0.22308
0.40536

Vr'''
540
660

tr''''
5.486
4.482

tr''''
5.486
4.482

1/tr''''
0.18227
0.22309
0.40536

Vr''''
540
660

tr
5.486
4.482

Iteration2
Route
1
2
Iteration3
Route
1
2
Iteration4
Route
1
2

Iteration5
Route
1
2

12.5 Conclusion
TRC method is Very efficiently converges the solution for multiple paths and multiple
nodes

References
Dhingra, S.L., Trip Distribution and Assignment Module 3
<http://www.civil.iitb.ac.in/~dhingra/ce751/Module3.pdf> accessed on October 13,
2013.

You might also like