TRAFFIC ASSIGNMENT

TRAFFIC ASSIGNMENT

The final step in the transportation forecasting process

Traffic assignment is used to predict the actual routes and traffic volumes on
highways and streets

This method takes the origin-destination (O-D) pairs from earlier forecasting steps
and assigns each trip to a specific route, whether by car or transit. By summing up
the routes across all segments, planners can estimate the average daily or peak-
hour traffic volume for each route. This forecast helps determine the capacity andLET
’ S GO
potential congestion levels on urban transportation networks. !
TRAFFIC ASSIGNMENT
To carry out a trip assignment, the following data are required:

(1) number of trips that will be made from one zone to another (this information was
determined in the trip distribution phase),

(2) available highway or transit routes between zones,

(3) how long it will take to travel on each route,

(4) a decision rule (or algorithm) that explains how motorists or transit
users select a route, and

(5) external trips that were not considered in the previous

trip generation and distribution steps.
TRAFFIC ASSIGNMENT

1. Diversion Curves
2. Minimum Path Algorithm
3. All-or-nothing Assignment
4. Capacity Restrain Assignment
a. Incremental Method
b. Iterative Method
c. Equilibrium Assignment
User Equilibrium
System Optimization
5. Stochastic Method
DIVERSION CURVES
This method is similar in approach to
a mode choice curve. The traffic
between two routes is determined as
a function of relative travel time or
cost. Figure shown below illustrates a
diversion curve based on travel time
ratio.
MINIMUM PATH ALGORITHM
The minimum time path method assigns all trips to those links that comprise the
shortest time path between the two zones.

The minimum path assignment is based on the theory that a motorist or transit user
will select the quickest route between any O-D pair. In other words, the traveler will
always select the route that represents minimum travel time.

The results can be depicted as a tree, referred to as a skim tree. All trips from that
zone are assigned to links on the skim tree. Each zone is represented by a node in the
network which represents the entire area being examined.

To determine the minimum path, a procedure is used that finds the shortest path
without having to test all possible combinations.
MINIMUM PATH ALGORITHM
List possible paths from root node going to other nodes
You do not need to list all paths, especially if it is evident that it will not be the
shortest

Compare total travel time for each possible path; choose the paths with shortest
travel time

Draw the skim tree using the chosen shortest paths

DETERMINING MINIMUM PATH
Determine the minimum path for nodes 1, 5, and 3. Sketch the skim trees.

1 8 min 3
3 min
2
5 min

in
in 5m

7m
2 m in
1

5 6 min
4
DETERMINING MINIMUM PATH

Root/Home: Node 1 SKIM TREE:

To Node 2: To Node 4:
1-2 = 8 min 1-2-4 = 8 + 5 = 13 min 1 2 3
1-5-2 = 5 + 12 = 17 min 1-5-4 = 5 + 6 = 11 min

To Node 3: To Node 5:
1-2-3 = 8 + 3 = 11 min 1-5 = 5 min
1-2-4-3 = 8 + 5 + 7 = 20 min 1-2-5 = 9 + 12 = 20 min 5 4
1-5-4-3 = 5 + 6 + 7 = 18 min
DETERMINING MINIMUM PATH

Root/Home: Node 3 SKIM TREE:

To Node 1: To Node 4:
3-2-1 = 3 + 8 = 11 min 3-4 = 7 min 1 2 3
3-2-5-1 = 3 + 12 + 5 = 20 min 3-2-4 = 3 + 5 = 8 min

To Node 2: To Node 5:
3-2= 3 min 3-2-5 = 3 + 12 = 15 min
3-4-2 = 7 + 5 = 12 min 3-4-5 = 7 + 6 = 13 min 5 4
DETERMINING MINIMUM PATH

Root/Home: Node 5 SKIM TREE:

To Node 1: To Node 3:
5-1 = 5 min 5-4-3 = 6 + 7 = 13 min 1 2 3

To Node 2: To Node 4:
5-2= 12 min 5-4 = 6 min
5-4-2 = 6 + 5 = 11 min 5 4
ALL-OR-NOTHING ASSIGNMENT
ALL-OR-NOTHING ASSIGNMENT

ADVANTAGES DISADVANTAGES

Simple Assumes all traffic will

Inexpensive pass through one path
Results are easy Creates unrealistic flow
to understand patterns
ALL-OR-NOTHING ASSIGNMENT

100
CAPACITY RESTRAINT
The number of trips assigned to each link is compared with the capacity of the link to
determine the extent to which link travel times have been increased by the additional
volume placed on the formerly empty link.

Using relationships between volume and travel time (or speed), it is possible to
recalculate the new link travel time. A reassignment is then made based on these new
values. The iteration process continues until a balance is achieved, such that the link
travel time based on the loaded volume does not change with successive
assignments.
INCREMENTAL METHOD
Incrementally assign a portion of the trip exchanges (i.e. in chunks) between zone
pairs while updating the travel times between increments

New travel time = function of volume that is assigned thus far

STEPS:

1. Find path tree for each zone

2. Assign a portion of the trip exchange matrix (usually 40, 30, 20, and 10 percent) to
shortest paths
3. Update travel times after each increment
4. Repeat until all trips are assigned
5. Sum
INCREMENTAL METHOD
INCREMENTAL METHOD

40 40
7 = 10.32min

10 0 = 10 min
0

16 0 = 16 min
INCREMENTAL METHOD

7 40 = 10.32min

30
10 30 = 11.5 min
0

16 0
= 16 min
INCREMENTAL METHOD

+ 20 60 = 23.8 min
7

30 = 11.5 min
10
0

16 0 = 16 min
INCREMENTAL METHOD

7 60
= 23.8 min

+ 10 40
10 = 14.74 min

16 0
= 16 min
INCREMENTAL METHOD

14.74