Beruflich Dokumente
Kultur Dokumente
1
PURPOSE:
2
Trip assignment inputs and outputs.
QIJK
3
APPLICATIONS
4
Significance of Traffic Assignment
TRANSPORT HIGHWAY
PLANNER DESIGNER
5
Pre- Requisites For Traffic Assignment
6
Traffic Assignment Procedure
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
12
Diversion Curves
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
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
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
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
4 9
7 7
9 10 11 12
6 8 10
13 14 15 16
350 10
Limitations
Time alone is used as governing factor for
deriving the of minimum path.
38
Multiple Route Assignment
Consists of assigning the interzonal flow to series of routes.
The driver; not knowing the “actual link time”; associated with each
link a supposed time.
40
Fundamental Vehicle Stream Flow Relations
q= u. k
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
0 1.0
Volume-Capacity Ratio Capacity
Updation of Link Travel Impedance
Smock method:
Link travel times modified by the formula;
(V/C-1)
TA =To. e
44
1.15ŵ
ŵ
qmax