TRIP (TRAFFIC) ASSIGNMENT

1
PURPOSE:

1. Determining route to be travelled.

2. Assigning Inter Zonal Flows to the selected
routes.

2
 Trip assignment inputs and outputs.

QIJK

Network description links Network assignment

and nodes model

QIJKP and qij

3
 APPLICATIONS

1.To determine deficiencies in existing transportation system by

assigning future trips to the existing system.

2.To evaluate the effects of improvements to the existing

transportation system.

3.To develop construction priorities for intermediate years.

4.To test alternative transportation system proposals.

5.To derive design-hour traffic volumes on highways and turning

movements on junctions.

4
 Significance of Traffic Assignment

TRANSPORT HIGHWAY
PLANNER DESIGNER

To evaluate For Geometric

how system design of
works in terms of individual links
travel time / L.o.S. & Intersections

5
 Pre- Requisites For Traffic Assignment

• Interzonal Vehicle Trips: Trip Distribution

• Diurnal patterns of demand

Trip Assignments by the time of the day and directional distribution

 Morning Peak Hours Off Peak Hours After Peak Hours

6
 Traffic Assignment Procedure

1. Coding of network for each mode

o Nodes of Links
o Centroidal Connectors.
o Road Network, Rail network, Bus Route Network.

2. Driver / Traveler Route selection criteria.

3. Tree building which selects vehicle routes through

the coded network.

4. Allocating vehicle trip interchanges between the

routes

7
Fig Hypothetical network
8
 Route Selection ~ a human decision based on :
1. Journey time
2. Journey Length.
3. Convenience
4. Cost
5. Comfort
6. Safety

9
 Minimum path ‘ Tree’ Concept

~Moore’s Algorithm.
• Figures in bracket are time of travel between nodes
• ‘______’ minimum path to a node from the Zone Centroid

10
 Route Choice Behaviour
User Equilibrium:
Each user goes on the shortest path.
System Equilibrium:
Total cost of using the system is minimized.
Stochastic Equilibrium:
Shortest Path (route) selection based on user’s
perception.

11
 Traffic Assignment Techniques

1. Diversion Curves

2. All or Nothing Assignment ( Free Assignment or

Desire Assignment)

3. Multiple Route Assignment

4. Capacity Restraint Assignment

12
 Diversion Curves

 Empirically derived relationships showing the proportion of traffic

likely to be diverted on a new facility
 Data collected from the pattern of road usage in the past used
to build up diversion curves

Variables used in forming the curves:

o Travel time saved.
o Travel time ratio.
o Travel time and distance.
o Distance and speed ratio.
o Travel cost Ratio
o Distance saved ratio
o Distance Ratio

13
California Diversion Curve:

P= 50+ 50(d+0.5t)___
2 0.5
[(d-0.5t) +4.5]
Where,
D= Distance saved in miles
T = time saved in minutes

14
 B.P.R.,US,Formula

P= 1006
1+TR
Where,
P = Percentage traffic diverted to new facility
TR= Travel time Ratio = Travel time on New Facility
Travel time on old Facility

15
All or Nothing (Free) Assignment

16
Fig Hypothetical network
17
 Table Stage Impedance Calculations for Tree Building

Stage N Links Compute new Compare to tree Decision

path impedance table stage N-1
I j
II 1 6 0+5=5 5<∞ Accept
III 6 7 5+8=13 13<∞ Accept
9 5+5=10 10<∞ Accept
10 5+4=9 9<∞ Accept
IV 7 2 13+2=15 15<∞ Accept
8 13+4=17 17<∞ Accept
10 13+7=20 ---------------- Reject
9 10 10+3=13 13>∞ Accept
12 10+7=17 17<∞ Accept
10 7 9+5=14 14>13 Accept
9 9+3=12 12>10 Accept
11 9+5=14 14<∞ Accept
V 8 3 17+4=21 21<∞ Accept
11 4 14+4=18 18<∞ Accept
8 14+5=19 19>17 Accept
13 14+8=22 22<∞ Accept
14 14+5=19 19<∞ Accept
12 5 17+2=19 19<∞ Accept
13 17+6=23 ---------------- Reject
VI All links emanating from nodes 3,4,5,13 and 14 are rejected; the list is now empty and
the procedure ends. 18
 Table Final Tree Table

Node Total impedance Node

(j) to node j preceding j

1 0 -
2 15 7
3 21 8
4 18 11
5 19 12
6 5 1
7 13 6
8 17 7
9 10 6
10 9 6
11 14 10
12 17 9
13 22 11
14 19 11
19
To 2 3 4 5

T1-j 800 500 600 200

Skim Tree & AON Assignment

20
Illustration

Find the shortest path from node 1 to all other nodes

and assign the following trip from node 1 to nodes 4,
10, 14 and 16 , on the shortest path.

From Node 1 to Total Trips

Node 4 200
Node 10 350
Node 14 550
Node 16 300
Find the shortest path from node to
1 all other nodes (from Garber and Hoel)

1 1 2 3 3 6 4

2 4 2 1

5 2 6 3 7 2 8

2 3 1 1

9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16

Yellow numbers 3 represent link travel times in minutes

STEP 1
1
1 1 2 3 3 6 4

2 4 2 1

2
5 2 6 3 7 2 8

2 3 1 1

9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16
STEP 2
1 4
1 1 2 3 3 6 4

2 4 2 1

2 5
5 2 6 3 7 2 8

2 3 1 1

9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16
STEP 3
1 4
1 1 2 3 3 6 4

2 4 2 1

2 5
5 2 6 3 7 2 8
4

2 3 1 1

4
9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16
STEP 4
1 4
1 1 2 3 3 6 4

Eliminate
2 4 2 1
5>4
2 5
5 2 6 3 7 2 8
4

2 3 1 1

4
9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16
STEP 5
1 4 1
0
1 1 2 3 3 6 4

2 4 2 1

2 6
5 2 6 3 7 2 8
4

2 3 1 1

4
9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16
STEP 6
1 4 1
0
1 1 2 3 3 6 4

2 4 2 1

2 6
5 2 6 3 7 2 8
4 7
Eliminate
7>6
2 3 1 1

4 7
9 4 10 3 11 3 12

2 3 1 1

13 4 14 4 15 4 16
STEP 7
1 4 1
0
1 1 2 3 3 6 4

2 4 2 1

2 6
5 2 6 3 7 2 8
4

2 3 1 1

4 7
9 4 10 3 11 3 12
8
Eliminate
8>7
2 3 1 1

6
13 4 14 4 15 4 16
STEP 8
1 4 1
0
1 1 2 3 3 6 4

2 4 2 1

2 6 8
5 2 6 3 7 2 8
4

2 3 1 1

4 7 7
9 4 10 3 11 3 12

2 3 1 1

6
13 4 14 4 15 4 16
STEP 9
1 4 1
0
1 1 2 3 3 6 4

2 4 2 1

2 6 8
5 2 6 3 7 2 8
4

2 3 1 1

4 7 7
9 4 10 3 11 3 12

2 3 1 1

1
6 0
13 4 14 4 15 4 16
STEP 10
1 4 1
0
1 1 2 3 3 6 4

2 4 2 1

2 6 8
5 2 6 3 7 2 8
4

2 3 1 1

4 7 7
9 4 10 3 11 3 12
1
Eliminate 0
Eliminate 10 > 7
2 3 1 1

1
6 0
13 4 14 4 15 4 16
1
0
10 = 7
STEP 11
1 4 1
0
1 1 2 3 3 6 4

2 4 2 1

2 6 8
5 2 6 3 7 2 8
4

2 3 1 1

1
4 7 7 0
9 4 10 3 11 3 12

2 3 1 1

6 8
13 4 14 4 15 4 16
1
0
 Eliminate 10 > 9
STEP 12
1 4 1
0
1 1 2 3 3 6 4
9

2 4 2 1

2 6 8
5 2 6 3 7 2 8
4

2 3 1 1
10 > 9
1 9
4 7 7 0
9 4 10 3 11 3 12

Eliminate
2 3 1 1

6 8
13 4 14 4 15 4 16
1
0
STEP 13
1 4
1 1 2 3 3 6 4
9

2 4 2 1

2 6 8
5 2 6 3 7 2 8
4

2 3 1 1

4 9
7 7
9 4 10 3 11 3 12

2 5 1 1
12 > 10
1
6 8 12
2
13 4 14 4 15 4 16
10
Eliminate
STEP 14
1 4
1 1 2 3 3 6 4
9

2 4 2 1

2 6 8
5 2 6 3 7 2 8
4

2 3 1 1

4 9
7 7
9 4 10 3 11 3 12

2 3 1 1
12 > 10

6 8 12 10
13 4 14 4 15 4 16
10
Eliminate
FINAL
200 + 550 1 200 + 550 4
+ 300 + 300
1 2 3 4
= 1050 = 1050 9
200
350 + 550 200
= 1050 + 300

2 6 200 + 300
8
5 6 7 8
4 = 500

350 550 300

4 9
7 7
9 10 11 12

350 550 300

6 8 10
13 14 15 16
350 10
Limitations
 Time alone is used as governing factor for
deriving the of minimum path.

 Too many vehicles assigned to more attractive

routes resulting in to congestion.

 Unequal utilization of facilities of the network.

 Tendency of people to use superior facilities even

at higher cost & time is not reflected.

38
 Multiple Route Assignment
 Consists of assigning the interzonal flow to series of routes.

 The proportion of the total flow assigned to each route being a

function of the length of the route in relation to the shortest
route.

 The driver; not knowing the “actual link time”; associated with each
link a supposed time.

 The driver is assumed to select the route which minimizes the

sum of his “Supposed Link Times”.

 This method yields more accurate assignment.

 Use of discrete choice modeling approach: logit formulations
39
Capacity Restraint Assignment

40
 Fundamental Vehicle Stream Flow Relations

q= u. k

q= Flow or Volume (veh/hr)

u= Speed (Km/hr)
k= Density( Concentration)( veh/Km)
MFS=Mean free Speed

41
 Fundamental Traffic flow Relationships
Vfs A
Vfs FREEFLOW SPEED
S
P
S
E
V=A-B*K P
E Vfs/2
E
D
E

Vs D
A/B Vs
Kj/2 Kj Jam Density FLOW Qmax
DENSITY
Capacity Q
Qmax
F
L
Vs=Vsf – (Vsf/Kj) x K
O
W
Qmax = (Vsf x Kj)/4

Q
Optimal Density
Kj/2 Kj
DENSITY Greenshield (1932)
K
42
 Free LOS = Level of Service
Speed LOS A
Free Flow Regime
LOS B
LOS C
LOS D
Speed LOS E

LOS F

Forced Flow Regime

0 1.0
Volume-Capacity Ratio Capacity
Updation of Link Travel Impedance

 Travel Resistance of a link is increased according to a relation

between the practical capacity of Link and the volumes assigned
to the Link.

 Redistribution of traffic to realistic alternative Path.

Smock method:
Link travel times modified by the formula;
(V/C-1)
TA =To. e

Where, To = Original Travel Time (when v=c)

TA = Adjusted Travel Time
V = Assigned Volume
C = Computed Link Capacity

44
1.15ŵ
ŵ

qmax

BPR Link Capacity Function

45
Procedure for CRTA

1. Partition the interzonal trip matrices.

2. Develop skim tree considering travel impedance.
corresponding to FF condition.
3. Assign the part - interzonal trips.
4. Revise the travel impedance.
5. Develop new skim tree with revised impedance.
6. Go to step III till all part – interzonal trips are
assigned.
…………..Later………..
47