TRANSPORTATION

ENGINEERING
AND PLANNING
(110 401367)
Spring 2021-2022
Module No. 4
4.4_ Traffic Assignment

Dr. Hamza Alkuime

1

Review

Study area
2

1
 Review
5
1

4
3

Zoning
3

Review
Attracted trips 5
1

The land use within

Zone 1 are 2

 120 office space

500 factory 3
4

50 educational seats

100 shopping center

2
 Review
Balanced Trip 5

Productions and 1

Attractions Ta= 620

6 Ta= 650

Tp= 250 Ta= 1200 Tp= 550

Balanced trips
Zone ID Tp= 800
Production Attraction 2

1 250 403 Ta= 560

2 320 364 Tp= 400
3 150 228 4
3
4 400 273 Tp= 320
5 550 423 Ta= 420
Ta= 350
6 800 780
Tp= 150
Total trips 2470 2470

Review
Tp= 250
5

4
3

Trip distribution
6

3
 Example
Trip distribution
5
Destination zone
Origin 1 Compute
Given P
zone 1 2 3 4 5 6 dp
6 Ta= 650
1 63 20 20 Ta= 620
35 62 50 250 250
2 41 22 63 50 80 64 Ta=320
1200 320 Tp= 550
Tp= 250
3 18 22 26 60 14 10 150 150
Tp= 800
4 40 70 60 90 60 80 400 400
5 63 80 60 100 2 137 110 550 550
6 90 80 180 150
Ta= 560 140 160 800 800
Tp= 400

 Model split Tp= 320

3
4

42 % by car Ta= 350

Ta= 420

58% by bus
Tp= 150

Generated trips
Origin
Destination zone
zone
1 2 3 4 5 6
1 63 20 20 35 62 50
2 41 22 63 50 80 64
3 18 22 26 60 14 10
4 40 70 60 90 60 80
5 63 80 60 100 137 110
6 90 80 180 150 140 160

mode choice 41% mode choice 58%

Origin Trips by Car ( 41% of trip generated ) Origin Trips by Bus ( 58% of trip generated )
zone Distination zone zone Distination zone
1 2 3 4 5 6 1 2 3 4 5 6
1 26 8 8 15 26 21 1 37 12 12 20 36 29
2 17 9 26 21 34 27 2 24 13 37 29 46 37
3 8 9 11 25 6 4 3 10 13 15 35 8 6
4 17 29 25 38 25 34 4 23 41 35 52 35 46
5 26 34 25 42 58 46 5 37 46 35 58 79 64
6 38 34 76 63 59 67 6 52 46 104 87 81 93

4
 Review
Travel Forecasting Process
 Four-step process”
 Trip generation
 How many trips
 Trip distribution
 From where to where
 Modal choice
 On what mode
 Traffic assignment
 On what route

Traffic Assignment (Rout choice)

10

10

5
 Traffic assignment

 Goal
What path or route will a person choose?
What influences the choice of route?
 Path that minimizes travel cost, time, distance, speed

 Inputs
Origin- destination matrix (trip table)
 Output
 Path table
 Used to
 Determine the actual street and highway routes that will be used
 The number of automobiles and buses trips that can be expected on each highway segment
11

11

Traffic assignment
Data needed
 Number of trips that will be made from one zone to another
 Determined in the trip distribution step
 Available highway or transit routes between zones
 How long it will take to travel on each route
 A decision rule (or algorithm) that explains how motorists or transit users select a route
 External trips that were not considered in the previous trip generation and distribution
steps

12

12

6
 Traffic assignment
Approaches
 Three basic approaches can be used for traffic assignment purposes:
1. Diversion curves
2. Minimum time path (all-or-nothing) assignment
 Commonly used
 Generally, produces accurate results
 Adequately demonstrates the basic principles involved
3. Minimum time path with capacity restraint

13

13

Traffic assignment
1. Diversion curves
 Travel Time Ratio versus
Percentage of Travel on
Route B

14

14

7
 Traffic assignment
2. Minimum time path (all-or-nothing) Algorithm
 Assumption
The traveler will always select the route that represents minimum travel time between any
O-D pair.
This method assigns all trips to those links that comprise the shortest time path between
the two zones.

15

15

Traffic assignment
Minimum time path (all-or-nothing) assignment
 In this method,
 All trips are assigned on the shortest route
which is the minimum travel time or cost
between zones
 To determine which route that will be,
 It is necessary to find the shortest
route from the zone of origin to all
other destination zones.
 The results can be depicted as a
tree, referred to as a skim tree

16

16

8
 Traffic assignment
Skim tree
 Nodes
 Each zone is represented by a node in the network which
represents the entire area being examined.
 Links
 Zones are interconnected by links,
 which represent the physical characteristics of the road
segments and facilities of the transportation network
 Path
 Represented through a series of links, each with its own set
of attributes and characteristics
 These attributes can include
 length, speed limit, travel time, capacity, functional
classification, and a host of other variables used to
describe the characteristics and expected
performance of the link
The problem is finding the minimum-travel-
 The link attributes are translated to the path through a
process called skimming time paths connecting each O-D pair for a
given set of link travel time

17

17

Traffic assignment
Skim tree
 If evaluating a trip with
 origin in zone 1
 destination in zone 4
 The path is represented
A. 1 4
B. 1  3-3  4
C. 1  5-5  4
D. 1  2-2  4
E. 1 2-2  5-5  4
 Figure 2.14 amends the previous example by adding link travel times (in
minutes) for each zone-to-zone connection
 It appears that link 1  4 is indeed the shortest travel time between zones 1 and
4 at 2 min

21

21

9
 Skim Tree
Example No. 1

22

22

Find the shortest path from node 1 to all other nodes (from Garber and Hoel)

1 1 2 3 3 6 4

Here’ 4 2
2 1
s how
…

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

NHI 6 Trip Dist.ppt (live.com)

23

10
 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

NHI 6 Trip Dist.ppt (live.com)

24

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

NHI 6 Trip Dist.ppt (live.com)

25

11
 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

NHI 6 Trip Dist.ppt (live.com)

26

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

NHI 6 Trip Dist.ppt (live.com)

27

12
 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

28

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

NHI 6 Trip Dist.ppt (live.com)

29

13
 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

NHI 6 Trip Dist.ppt (live.com)

30

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

NHI 6 Trip Dist.ppt (live.com)

31

14
 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

NHI 6 Trip Dist.ppt (live.com)

32

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 >= 10
NHI 6 Trip Dist.ppt (live.com)

33

15
 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

NHI 6 Trip Dist.ppt (live.com)

34

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

NHI 6 Trip Dist.ppt (live.com)

35

16
 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 3 1 1
12 >= 10
1 1
6 8
2 2
13 4 14 4 15 4 16
1
0 Eliminate

36

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
1 1
6 8
2 0
13 4 14 4 15 4 16
1
0 Eliminate
NHI 6 Trip Dist.ppt (live.com)

37

17
 FINAL
1 4
1 2 3 4
9

2 6 8
5 6 7 8
4

4 9
7 7
9 10 11 12

6 8 10
13 14 15 16
10

NHI 6 Trip Dist.ppt (live.com)

38

Skim tree
Example No. 2 (Example 12.10) : Using of
Skim tree

39

39

18
 Example No. 1 (Example 12.10) : Using of Skim tree
1. Assign the vehicle trips shown in the O-D trip table to the network shown in Figure below
using the all-or-nothing assignment technique.
2. Make a list of the links in the network and indicate the volume assigned to each.
3. Calculate the total vehicle minutes of travel.
4. Show the minimum path and assign traffic for each of the five nodes.

Trips between Zones

From/to 1 2 3 4 5
1 - 100 100 200 150
2 400 - 200 100 500
3 200 100 - 100 150
4 250 150 300 - 400
5 200 100 50 350 -

40

40

Example No.1 (Example 12.10) : Using of Skim tree

Travel time between zones

41

41

19
 Solution of Example No.1 (Example 12.10) : Using of Skim tree

 Steps:
Step 1: Find the shortest paths between zones
Step 2: Find total cumulative travel time for shortest paths between zones
Step 3: Find traffic volumes (or estimated trips) for shortest paths between zones
 from O-D matrix
Step 4: Find total trips (volume) on each link
Step 5: Find total vehicle minutes of travel on each link
Step 6: Assign traffic for each of the five nodes
Step 7: Draw the minimum path (skim trees) at each node

42

42

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 1: Find the shortest paths between zones
Nodes Shortest Path
From To Path ID
2
3
1
4
5
1
3
2
4
5
1
2
3
4
5
1
2
4
3
shortest path = The path with
5 minimum cumulative travel time
1
2
5
3
4
43

43

20
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 1: Find the shortest paths between zones
Nodes Shortest Path
From To Path ID
2 1-2 1
3 1-2,2-3 2
1
4 1-5,5-4 3
5 1-5 4
1 2-1 5
3 2-3 6
2
4 2-4 7
5 2-4,4-5 8
1 3-2,2-1 9
2 3-2 10
3
4 3-4 11
5 3-4,4-5 12
1 4-5,5-1 13
2 4-2 14
4
3 4- 15
shortest path = The path with
5 4-5 16 minimum cumulative travel time
1 5-1 17
2 5-4,4-2 18
5
3 5-4,4-3 19
4 5-4 20
44

44

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 2: Find total cumulative travel time for shortest paths between zones
Nodes Shortest Path Cumlative Travel Time
From To Path ID (min)
2 1-2 1
3 1-2,2-3 2
1
4 1-5,5-4 3
5 1-5 4
1 2-1 5
3 2-3 6
2
4 2-4 7
5 2-4,4-5 8
1 3-2,2-1 9
2 3-2 10
3
4 3-4 11
5 3-4,4-5 12
1 4-5,5-1 13
2 4-2 14
4
3 4- 15 shortest path = The path with
5 4-5 16 minimum cumulative travel
1 5-1 17
2 5-4,4-2 18 time
5
3 5-4,4-3 19
4 5-4 20
45

45

21
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 2: Find total cumulative travel time for shortest paths between zones
Nodes Shortest Path Cumlative Travel Time
From To Path ID (min)
2 1-2 1 8
3 1-2,2-3 2 11
1
4 1-5,5-4 3 11
5 1-5 4 5
1 2-1 5 8
3 2-3 6 3
2
4 2-4 7 5
5 2-4,4-5 8 11
1 3-2,2-1 9 11
2 3-2 10 3
3
4 3-4 11 7
5 3-4,4-5 12 13
1 4-5,5-1 13 11
2 4-2 14 5
4
3 4- 15 7 shortest path = The path with
5 4-5 16 6 minimum cumulative travel
1 5-1 17 5
2 5-4,4-2 18 11 time
5
3 5-4,4-3 19 13
4 5-4 20 6
46

46

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 3: Find traffic volumes (or estimated trips) for shortest paths between zones ( from O-D matrix)
Nodes Shortest Path Cumlative Travel Time Traffic volume on
From To Path ID (min) shortest paths
2 1-2 1 8
3 1-2,2-3 2 11
1
4 1-5,5-4 3 11
5 1-5 4 5
1 2-1 5 8
3 2-3 6 3
2
4 2-4 7 5
5 2-4,4-5 8 11
1 3-2,2-1 9 11
2 3-2 10 3 Trips between Zones
3
4 3-4 11 7
5 3-4,4-5 12 13 From/to 1 2 3 4 5
1 4-5,5-1 13 11 1 - 100 100 200 150
2 4-2 14 5
4 2 400 - 200 100 500
3 4- 15 7
5 4-5 16 6 3 200 100 - 100 150
1 5-1 17 5 4 250 150 300 - 400
2 5-4,4-2 18 11
5
3 5-4,4-3 19 13
5 200 100 50 350 -
4 5-4 20 6
47

47

22
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 3: Find traffic volumes (or estimated trips) for shortest paths between zones ( from O-D matrix)
Nodes Shortest Path Cumlative Travel Time Traffic volume on
From To Path ID (min) shortest paths
2 1-2 1 8 100
3 1-2,2-3 2 11 100
1
4 1-5,5-4 3 11 200
5 1-5 4 5 150
1 2-1 5 8 400
3 2-3 6 3 200
2
4 2-4 7 5 100
5 2-4,4-5 8 11 500
1 3-2,2-1 9 11 200
2 3-2 10 3 100 Trips between Zones
3
4 3-4 11 7 100
5 3-4,4-5 12 13 150 From/to 1 2 3 4 5
1 4-5,5-1 13 11 250 1 - 100 100 200 150
2 4-2 14 5 150
4 2 400 - 200 100 500
3 4- 15 7 300
5 4-5 16 6 400 3 200 100 - 100 150
1 5-1 17 5 200 4 250 150 300 - 400
2 5-4,4-2 18 11 100
5
3 5-4,4-3 19 13 50
5 200 100 50 350 -
4 5-4 20 6 350
48

48

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 4: Find total trips (volume) on each link
Estimated
Used in Paths Cumulative trips Nodes
Link Shortest
Path ID
trips
with ID on link From To Path between
zones
1-2 2 1-2 1 100
3 1-2,2-3 2 100
1
4 1-5,5-4 3 200
2-1 5 1-5 4 150
1 2-1 5 400
3 2-3 6 200
2
4 2-4 7 100
5 2-4,4-5 8 500
1 3-2,2-1 9 200
2 3-2 10 100
3
4 3-4 11 100
5 3-4,4-5 12 150
4 5-4 20 350

49

49

23
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 4: Find total trips (volume) on each link
Estimated
Used in Paths Cumulative trips Nodes
Link Shortest
Path ID
trips
with ID on link From To Path between
zones
1-2 1 and 2 =100+100=200 2 1-2 1 100
3 1-2,2-3 2 100
1
4 1-5,5-4 3 200
2-1 5 and 9 =400+200=600 5 1-5 4 150
1 2-1 5 400
3 2-3 6 200
2 4 2-4 7 100
5 2-4,4-5 8 500
1 3-2,2-1 9 200
2 3-2 10 100
3
4 3-4 11 100
5 3-4,4-5 12 150
4 5-4 20 350

50

50

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 4: Find total trips (volume) on each link (Cont.)
Nodes Shortest Path Cumlative Travel Time Traffic volume on
Used in Paths Culmlative trips on Link travel time From To Path ID (min) shortest paths
Selected Link 2 1-2 1 8 100
with ID link (min [from
1-2 3 1-2,2-3 2 11 100
1
4 1-5,5-4 3 11 200
2-1 5 1-5 4 5 150
1-5 1 2-1 5 8 400
5-1 3 2-3 6 3 200
2
2-5 4 2-4 7 5 100
5 2-4,4-5 8 11 500
5-2
1 3-2,2-1 9 11 200
2-3 2 3-2 10 3 100
3
3-2 4 3-4 11 7 100
2-4 5 3-4,4-5 12 13 150
4-2 1 4-5,5-1 13 11 250
2 4-2 14 5 150
3-4 4
3 4- 15 7 300
4-3 5 4-5 16 6 400
4-5 1 5-1 17 5 200
5-4 2 5-4,4-2 18 11 100
5
3 5-4,4-3 19 13 50
4 5-4 20 6 350
51

51

24
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 4: Find total trips (volume) on each link (Cont.)
Used in Paths Colmlative trips on Link travel time
Selected Link
with ID link (min [from
1-2 1, 2 =100+100=200 8
2-1 5, 9 =400+200=600 8
1-5 3, 4 =200+150=350 5
5-1 3 450 5
2-5 0 0 5
5-2 0 0 12
2-3 3,6 =200+200=400 3
3-2 9,10 300 3
2-4 7,8 600 5
4-2 14,18, 250 5
3-4 12, 250 7
4-3 19 350 7
4-5 8,12,13,16 1300 6
5-4 18,19,20 700 6
52

52

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 5: Find total vehicle minutes of travel on each link

Used in Paths Colmlative trips on Link travel time Total vehicle minutes of
Selected Link
with ID link (min [from figure) travel
1-2 1, 2 200 8.00
2-1 5, 9 600 8.00
1-5 3, 4 350 5.00
5-1 3 450 5.00
2-5 0 0 5.00
5-2 0 0 12.00
2-3 3,6 400.00 3.00
3-2 9,10 300 3.00
2-4 7,8 600 5.00
4-2 14,18, 250 5.00
3-4 12, 250 7.00
4-3 19 350 7.00
4-5 8,12,13,16 1300 6.00
5-4 18,19,20 700 6.00
0
53

53

25
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 5: Find total vehicle minutes of travel on each link
Used in Paths Colmlative trips on Link travel time Total vehicle minutes of
Selected Link
with ID link (min [from figure) travel
1-2 1, 2 200 8.00 1600.00
2-1 5, 9 600 8.00 4800.00
1-5 3, 4 350 5.00 1750.00
5-1 3 450 5.00 2250.00
2-5 0 0 5.00 0.00
5-2 0 0 12.00 0.00
2-3 3,6 400.00 3.00 1200.00
3-2 9,10 300 3.00 900.00
2-4 7,8 600 5.00 3000.00
4-2 14,18, 250 5.00 1250.00
3-4 12, 250 7.00 1750.00
4-3 19 350 7.00 2450.00
4-5 8,12,13,16 1300 6.00 7800.00
5-4 18,19,20 700 6.00 4200.00
32950

54

54

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 6: Assign traffic for each of the five nodes
Total vehicle
minutes of
Link 900
travel ( column
2 X column 3) 1600

1-2 1600
2-1 4800 4800
900
1-5 1750
5-1 2250
2-5 0
5-2 0
2-3 900
3-2 900
2-4 3000
4200
4-2 1250
3-4 1750
4-3 2450
4-5 7800
5-4 4200
4500
Total 32650

55

55

26
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 6: Assign traffic for each of the five nodes
Trips between Zones
Cumulative trips on From/to 1 2 3 4 5 Total
Link
link 1 - 100 100 200 150
2 400 - 200 100 500
1-2 200 3 200 100 - 100 150
2-1 600 4 250 150 300 - 400
1-5 350 5 200 100 50 350 -
5-1 450 Total 1050 450 650 750 1200
2-5 0
5-2 0
Node Attracted trips Volume Assigned
2-3 300
3-2 300 1 600+450 1050
2-4 600 2 200+300+250 750
4-2 250 3 300+350 650
3-4 250
4-3 350 4 600+250+700 1550
4-5 1300 5 350+1300 1650
5-4 700
Total
56

56

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 7: Draw the minimum path (skim trees) at each node

Nodes Shortest
Path ID
From To Path
2 1-2 1
3 1-2,2-3 2
1
4 1-5,5-4 3
5 1-5 4

57

57

27
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 2-1 5
3 2-3 6
2
4 2-4 7
5 2-4,4-5 8

58

58

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 2-1 5
3 2-3 6
2
4 2-4 7
5 2-4,4-5 8

59

59

28
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 3-2,2-1 9
2 3-2 10
3
4 3-4 11
5 3-4,4-5 12

60

60

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 3-2,2-1 9
2 3-2 10
3
4 3-4 11
5 3-4,4-5 12

61

61

29
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 4-5,5-1 13
2 4-2 14
4
3 4-3 15
5 4-5 16

62

62

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 4-5,5-1 13
2 4-2 14
4
3 4- 15
5 4-5 16

63

63

30
 Solution of Example No.1 (Example 12.10) : Using of Skim tree
Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 5-1 17
2 5-4,4-2 18
5
3 5-4,4-3 19
4 5-4 20

64

64

Solution of Example No.1 (Example 12.10) : Using of Skim tree

Step 7: Draw the minimum path (skim trees) at each node (cont.)

Nodes Shortest
Path ID
From To Path
1 5-1 17
2 5-4,4-2 18
5
3 5-4,4-3 19
4 5-4 20

65

65

31
 What Next

 The process of calculating the travel demand for an

urban transportation system is now completed.
 The results of this work will be used to
Determine where improvements will be needed in the system
Make economic evaluations of project priority
Assist in the geometric and pavement design phases

66

66

32