Transportation Planning (CE-863)

Spring Semester 2020

 
Dr. Kamran Ahmed
buet99@Hotmail.com , Office Room#110, Tel: 05190854153, Cell:
0301-5630831

National Institute of Transportation (NIT)

School of Civil & Environmental Engineering (SCEE)
National University of Science and Technology (NUST)
NUST Campus, Sector H-12, Islamabad
Traffic Assignment Models
Diversion Curves

All or Nothing Traffic Assignment

Capacity Restrained Assignment

 Diversion Curves

Origin = SCEE, NUST, Islamabad

Destination = Lahore Airport
Route 1
Using M-2 (Lahore – Islamabad Motorway)
= 375 KM (254 Minutes)
Route 2
N-5 = 315 KM ( 345 Minutes)
All or Nothing Traffic Assignment

Allocates all volume between zones to

minimum path based on free-flow link
impedances
Does not update as the network loads
Becomes unreliable as volumes and
travel time increases
 Using Free Flow/All-or-Nothing Assignment - Example

Trip Exchange
1 2 J 1 2 3
2 2 2 3 Q1j 200 400 800
10
4 5 Q2j 150 200 100
6
Q3j 300 600 350
2
4
4

3
3

3
6 2

Norman W. Garrick
Minimum Tree – Zone 1

1 2
2 2 2 3
10
4 5
6

3
3

3
6 2

Norman W. Garrick
 Free Flow/All-or-Nothing Assignment – Zone 1

Trip Exchange
1 1200 2 J 1 2 3
400800 Q1j 200 400 800
400
Q2j 150 200 100
4 5
400 Q3j 300 600 350

80
0

3
6 800
Norman W. Garrick
Minimum Tree – Zone 2

1 2
2 2 2 3

4 5

2
4
4

3
3

3
6 2

Norman W. Garrick
Minimum Tree – Zone 3

1 2
2 2 2 3

4 5

2
4
4

3
3

3
6 2

Norman W. Garrick
 1 2 Trip Assignment
5 5 8 2 3 4 4

6 3
10 8
7
3 6 4
6 5 5 5
2 5 7
8
8 8 11
9 4
10 7
7 7
3
7 7 5 5
8 2
8
12

13 14
5 5 7 7
J 1 2 3 4 5
5 Q1j 100 200 300 200 150
Q2j 250 750 300 100 250
Q3j 350 450 350 250 100
Q4j 150 350 500 100 250
 Capacity Restraint
Once vehicles begin selecting the minimum
path between a set of nodes, volume increase
and so do travel times
Original minimum paths may no longer be
the minimum path
Capacity restraint assigns traffic iteratively,
updating impedance at each step
 Capacity Restraint
  q  
4

w  w1  0.15  
  qmax  
w  impedance of a given link at flow q
w  free - flow impedance of the link
q  link flow
q max  link capacity
 1 2 Capacity Restrain Method
8 4

5 6 7
10
6
3 5 5
5 4 7
8 8
3
8 9 10
4 7

J 1 2 3

Capacity of Link is 500 vph

Q1j 100 1000 300

Use 50% for loading traffic Q2j 250 750 300

Q3j 350 850 350

Step 1
Find the Minimum Path Tree
Origin 1 (Loading 50% Traffic
J 1 2 3
1 2 Q1j 100 1000 300

Q2j 250 750 300

500
Q3j 350 450 350
150

3
150 150
Step 2
Calculating new Impedance (Travel Time)

  q  
4

w  w1  0.15  
  qmax  
  200  
4

w  101  0.15    10.03

  500  

No Change in Impedance so keep the same Minimum

path and load next 50%