Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
TRANSPORTATION
PLANNING AND
FORECASTING
1
Topic Outlines
- Trip Generation
- Trip Distribution
- Model Choice
- Trip Assignment
2
Learning Outcomes
3
TOPIC 2.1
Basic Elements of
Transportation Planning
4
Transportation Planning
5
Cont.
1. Situation definition
2. Problem definition
3. Search for solutions
4. Analysis of performance
5. Evaluation of alternatives
6. Choice of project
7. Specification and construction
6
Transportation Planning Process of a New Bridge (pg.585)
7
Transportation Planning Process: Elements
Elements Description
Preliminary studies to understand the situation that
Situation Definition
caused the need for transportation improvement.
8
Transportation Planning Process: Elements (cont.)
Elements Description
10
Cont.
11
12
Cont.
Establish goals – identify deficiencies of existing system & what is the
desired improvement.
1. Population-Economic activity:
Age, sex & composition of the family
Employment statistics
Income
Vehicle ownership
2. Land-use:
Travel characteristics are closely related to land-use pattern.
Classified into land-use activity such as:
i. Residential
ii. Industrial
iii. Commercial
iv. Recreational, etc.
13
Cont.
14
Cont.
Identify:
i. Where & when trips begin / end
ii. Trip purpose
iii. Mode of travel
iv. Social & economic characteristics of trip maker
15
TOPIC 2.2
Forecast of Future
Travel Demand
16
Introduction
Travel demand is expressed as the number of persons or vehicles
per unit time that can be expected to travel on a given segment of
a transportation system under a set of given land-use, socioeconomic and
environmental conditions.
17
Factors Affecting Travel Demand
18
Travel Forecasting Process
19
Cont.
Step 2: Land use analysis: determines where the activities will be located
21
Four Step Process
22
Four Step Model
23
How many trips will people
make?
i = origin
j = destination
24
1. Trip Generation
The process of determining the number of trips that will begin or end in
each traffic analysis zone within a study area.
Each trip has two ends (described in terms of trip purpose): trips are
either produced by a traffic zone or attracted to a traffic zone.
25
Cont.
Trip Production
Trip Attractions
26
Cont.
Example:
a home to work trip would be considered to have a trip end
produced in the home zone & attracted to the work zone
Common method:
• Cross classification
• Rates based on activity units
• Regression analysis
27
Cross-Classification analysis
• To determine the number of trips that begin or end at the
home (developed by FHWA).
• Home based trip generation is a useful value - represent a
significant proportion of all trips.
• The 1st step: develop a relationship between socioeconomic
measures & trip production.
• Two variables most commonly used: average income & auto
ownership. Other variables: household size
• The relationships are developed based on income data and
results of O-D surveys.
• Ex. 12.1& 12.2 (pp. 628)
Where,
Y = Dependent variables (Trip)
x1, x2 = Independent variables relating to Y (Ex.: land use,
socio-economic factors, etc.)
a1, a2= Coefficients of the respective independent variables
29
Cont.
30
Multiple Regression: Example
31
Solution
32
Rates Based on Activity Units
33
Rate Based on Activity Units: Example
34
Rate Based on Activity Units: Solution
35
2. Trip Distribution
36
Cont.
Methods:
2. Gravity Model
Assumptions:
37
Trip Matrix
38
1. Growth Factor Model
Growth Factor Models assume that there is basic trip matrix exist
39
Cont.
The goal is then to estimate the matrix at some point in the future
For example, what would the trip matrix look like in 2 years time?
40
Uniform Growth Factor
Tij = τ tij
= (1.2)(5)
=6
Trip Matrix, T
(2018)
41
2. Gravity Model
Expressed as:
Tij = no. of trips that are produced in zone i and attracted to zone j
Pi = total no. of trips produced in zone i
Aj = no. of trips attracted to zone j
Fij = a value which is an inverse functions of travel time
Kij = socioeconomic adjustment factor for interchange ij
42
Example 1: Gravity Model
Zone 1 2 3 Total
Pi 14 33 28 75
Aj 33 28 14 75
Pi = Trips Produced
Aj = Trips Attracted 43
Friction factor
Zone 1 2 3
1 13 82 41
2 50 26 39
3 50 20 41
44
Modified Equation
45
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
1st iteration: CALCULATION
T11 = 14 x 33 x 13 = 1.82
(33x13) + (28x82) + (14x41)
T12 = 14 x 28 x 82 = 9.74
(33x13) + (28x82) + (14x41)
T13 = 14 x 14 x 41 = 2.44
(33x13) + (28x82) + (14x41)
46
1st iteration: CALCULATION
T21 = 33 x 33 x 50 = 18.62
(33x50) + (28x26) + (14x39)
T22 = 33 x 28 x 26 = 8.22
(33x50) + (28x26) + (14x39)
T23 = 33 x 14 x 39 = 6.16
(33x50) + (28x26) + (14x39)
47
1st iteration: CALCULATION
T31 = 28 x 33 x 50 = 16.59
(33x50) + (28x20) + (14x41)
T32 = 28 x 28 x 20 = 5.63
(33x50) + (28x20) + (14x41)
T33 = 28 x 14 x 41 = 5.77
(33x50) + (28x20) + (14x41)
48
1st iteration: RESULT
Singly constrained. The total trip productions match with the predicted
value, however the attractions do not equal with the predicted attractions.
Further iterations are necessary.
49
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
2nd iteration: FORMULA
Doubly
constrained
50
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
2nd iteration: Adjusted Attraction
51
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
2nd iteration: CALCULATION
52
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
2nd iteration: CALCULATION
53
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
2nd iteration: CALCULATION
54
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
2nd iteration: RESULT
55
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
3rd iteration: Adjusted Attraction
56
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
3rd iteration: CALCULATION
57
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
3rd iteration: CALCULATION
58
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
3rd iteration: CALCULATION
59
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
3rd iteration: CALCULATION
60
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
3rd iteration: RESULT
61
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Example 2: Gravity Model
62
63
64
65
2nd iteration, Doubly constrained : RESULT
Computed Given
Zone 1 2 3
P P
1 34 68 38 140 140
Computed
303 268 179 750 750
A
Given
300 270 180 750
A
66
Fratar Method: EQUATION
68
69
ZONE tij Gj ti Gi Σ(tixGx) Tij
AB 400 1.1 1.2 446
AC 100 1.4 600 1.2 710 142
AD 100 1.3 1.2 132
71
Fratar method: Exercise
1 - 4 6 7 17 32
2 5 - 5 4 14 24
3 5 5 - 3 13 20
4 8 7 4 - 19 25
Total
Present Trip 18 16 15 14
A
Trip A in 5 72
Years 26 25 25 25
3. Modal Choice (Modal Split)
73
Factors influencing the choice of mode
74
Cont.
(a) The trip purpose; for example, the journey to work is normally easier
to undertake by public transport than other journeys because of its
regularity and the adjustment possible in the long run;
(b) Time of the day when the journey is undertaken.
(c) Late trips are more difficult to accommodate by public transport.
75
Cont.
A good mode choice should include the most important of these factors.
76
Types of Mode choice models
77
Logit Models
78
Cont.
If two modes, auto (A) and transit (T) are being considered, the
probability of selecting the auto mode A can be written as
p(A) = eUA
e UA + e UT
79
Utility Function
um = Bm + a1 X1 + a2 X2 + ….. ar Xr + ε0
Where
um – utility function for mode m
Bm – mode specific parameter
pm = eUm
Σ eUm
pm = probability that mode m is chosen
81
Logit Model: Exercise (Example 12.10)
where T1 = total travel time (min), T2 = waiting time (min), C = cost (cents)
82
Multinomial logit Model: Example
u = Bm - 0.30C - 0.02T
TB = 0.112 x 500 = 56
TR = 0.176 x 500 = 88
TA = 0.712 x 500 = 356
85
4. Trip Assignment
86
Data required for trip assignment:
1. number of trips that will be made from one zone to another (from
trip distribution)
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
5. external trips that were not considered in the previous trip
generation and distribution steps.
87
Trip Assignment: Method
Methods:
3. Diversion curve
Similar to mode choice. The traffic between 2 routes is determined as a
function of relative travel time/cost. Ex. A graph of percent travel on route B
vs. travel time ratio (time on route A/ time on route B)
88
Minimum time path
Thus, it is necessary to find the shortest route from the zone of origin
to all other destination zones → develop skim tree.
Unrealistic → only one path between every O-D pair is utilized even
if there is another path with the same or nearly same travel
time/cost.
89
Minimum time path: Example 1
Starting Centrod 1:
T1-20 = 3 25
T1-20-25 = 6
T1-17-19 = 5 3
19 1
T1-17 = 3 18 20 21
2
T1-20-21 = 7 3 4
T1-17-13 = 6 16 17 1
2 3
T1-20-19 = 4 3
T1-17-16 = 5
13
90
Minimum time path: Example 2
All-or-nothing:
- Simplest technique.
- Combination of many parameters.
Example:
1 2 2500
1 3 3000
1 4 4000
91
Example 2: cont.
+4000
+3000 +3000
18 3
+4000
+3000
1 11 15 +4000
+2500
+3000 +2500
+4000
12 2
+2500
92
Example 2: cont.
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 -
94
http://www.webpages.uidaho.edu/niatt_labmanual/chapters/traveldemandforecasting/exampleproblems/TrafficAssignment.htm
Cont.
Time in minutes
95
http://www.webpages.uidaho.edu/niatt_labmanual/chapters/traveldemandforecasting/exampleproblems/TrafficAssignment.htm
Solution
The all-or-nothing technique simply assumes that all of the
traffic between a particular origin and destination will take the
shortest path (with respect to time).
96
Solution
97
Cont.
98
Multipath Assignment
Does not assume that all traffic will use the minimum path
- the path with the minimum impedance (ex. travel time) will get the
most traffic followed by paths with higher impedance.
This method is still limited by the fact that the impedance is based
on free flow assumptions and the impedance value is not changed
to reflex the level of traffic loading.
99
Multipath Assignment: Example
The details of travel time and capacity of different links
of a road network is as follows.
Link Travel time (min) Practical capacity (pcu/h)
1 - 11 3 9000
11 - 15 2 7000
11 - 12 2 8000
12 - 16 4 9000
15 - 18 3 8000
16 - 20 2 7000
18 - 20 2 6000
100
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Multipath Assignment: Example
101
Solution
1. 1 – 11 – 15 – 18 – 20 = 10 min
2. 1 – 11 – 12 – 16 – 20 = 11 min
t = to [1 + 0.15 (v/c)4]
t1-5 = 2 [1 + 0.15 (485/500)4]
= 2.27 minutes
104
TOPIC 2.3
Transportation System
Management
105
Introduction
Transportation systems management (TSM) is the term used to describe
the operational planning process to operate the major transportation
facilities at their most productive and efficient levels.
Some other terms associated with the TSM concept are “transportation
demand management” and “transportation supply management”.
6. Implementation
108
TSM: Strategy
109
TSM: Action/technique
110
Cont.
111
Cont.
112
End Of Chapter 2
113