Ceg552 - Chapter 6
Ceg552 - Chapter 6
TRANSPORTATION PLANNING
AND FORECASTING
CONTENTS
1. Basic Elements of Transportation Planning
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
Transportation Planning Process of a New Bridge (pg.585)
Transportation Planning Process: Elements
Elements Description
Elements Description
To estimate how each proposed alternatives would
Analysis of Performance
perform under present and future conditions.
To determined how well each alternative will
Evaluation of achieve the objectives as defined by the criteria
Alternatives
(Including cost-benefit analysis)
Decision to proceed with one of the alternatives.
Choice of Project Project selection after considering all factors
involved.
Produced detailed design (each of the components
Specification & of the facility is specified: physical location,
Construction geometric dimensions, structural configuration) →
contractors to estimate cost → built.
Urban Transportation Planning
1. Population-Economic activity:
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.
cont.
i = origin
j = destination
Source: http://www.et.byu.edu/~msaito/CE565MS/
2.2.1 Trip Generation
The decision to travel for a given purpose is called trip
generation.
Trip Production
Trip Attractions
Common method:
• Cross classification
• Rates based on activity units
• Regression analysis
2.2.1.1 Cross-Classification analysis
Given the high correlations that typically exist between trip rates
and socio-economic variables.
2. Gravity Model
Assumptions:
∑T ij
D1 D2 D3 … Dj … DJ ∑∑
i j
Tij = T
i
Source: MIT
Growth Factor Models
Growth Factor Models assume that there is basic trip
matrix exist
TAZ 1 2 3 4
1 5 50 100 200
2 50 5 100 300
3 50 100 5 100
4 100 200 250 20
TAZ 1 2 3 4 TAZ 1 2 3 4
1 5 50 100 200 1 ? ? ? ?
2 50 5 100 300 2 ? ? ? ?
3 50 100 5 100 3 ? ? ? ?
4 100 200 250 20 4 ? ? ? ?
Zone 1 2 3 Total
Pi 14 33 28 75
Aj 33 28 14 75
Friction factor
Zone 1 2 3
1 13 82 41
2 50 26 39
3 50 20 41
e Time: 00:59)
Modified equation
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)
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)
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)
e Time: 01:46)
1st iteration: Result
Doubly
constrained
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
2nd iteration: Adjusted attraction
r Slide Time: 06:09)
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
j for each of zonal pairs clear.
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
lide Time: 09:39)
2nd iteration: Calculation
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
ide Time: 09:59)
2nd iteration: Calculation
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
e Time: 10:28)
2nd iteration: Result
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
ired numbers, whereas here it is not so, we need to continue our iteration.
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
de Time: 13:54)
3rd Iteration: calculation
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
s our target.
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
e Time: 14:36)
3rd Iteration: calculation
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
lide Time: 14:44)
3rd Iteration: calculation
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Time: 15:02)
3rd Iteration: result
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
GRAVITY MODEL: EXAMPLE II
–Johnny Appleseed
2nd iteration, Doubly
constrained:RESULT
A small study area consists of 4 zones: Zone 1,2,3 and 4. An origin-destination survey
indicates that the number of trips between each zone is as shown in the following table.
Distribute the trips for future conditions using the FRATAR MODEL until second
iteration.
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 A 18 16 15 14
Trip A in 5
Years 26 25 25 25
2.2.3 Mode choice (Modal split)
(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.
(a) relative travel time: in-vehicle, waiting and walking times by each mode;
(b) relative monetary costs (fares, fuel and direct costs);
(c) availability and cost of parking
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
Utility Function
A utility function takes the following form
um = Bm + a1 X1 + a2 X2 + ….. ar Xr + ε0
Where
um – utility function for mode m
Bm – mode specific parameter
Norman W. Garrick
Multinomial Logit Model
pm = eUm
Σ eUm
where T1 = total travel time (min), T2 = waiting time (min), C = cost (cents)
Auto Transit
T1 20 30
T2 8 6
C 320 100
Example 12.12
TB = 0.112 x 500 = 56
TR = 0.176 x 500 = 88
TA = 0.712 x 500 = 356
A reduction in the price of fuel has changed the out-of-pocket cost for both
modes to RM1.50. Analyse the mode-share, taking into account the change
for the out-of-pocket cost and comment on the results obtained.
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)
80
Minimum time path: Example II
All-or-nothing:
Simplest technique.
Combination of many parameters.
Example:
1 2 2500
1 3 3000
1 4 4000
83
Example II: cont.
+4000
+3000 +3000
18 3
+4000
+3000
1 11 15 +4000
+2500
+3000 +2500
+4000
12 2
+2500
84
Example II: 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 -
http://www.webpages.uidaho.edu/niatt_labmanual/chapters/traveldemandforecasting/exampleproblems/TrafficAssignment.htm
cont.
8 3
1 2 3
12 5
5 7
5 4
6
Time in minutes
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).
http://www.webpages.uidaho.edu/niatt_labmanual/chapters/traveldemandforecasting/exampleproblems/
TrafficAssignment.htm
cont.
Link Volume Link Volume
http://www.webpages.uidaho.edu/niatt_labmanual/chapters/traveldemandforecasting/exampleproblems/TrafficAssignment.htm
Multipath Assignment
• Does not assume that all traffic will use the minimum
path
- traffic is assigned to the various paths between the
two zones based on their relative impedance.
- the path with the minimum impedance (ex.Travel
time) will get the most traffic followed by paths
with higher impedance.
103
Multipath Assignment: Example
The details of travel time and capacity of different
links of a road network is as follows.
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
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Multipath Assignment: Example
Assign a traffic volume of 9000 pcu/h between
nodes 1 and 20 by multiple route assignment
technique. (Draw the link diagram)
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Multipath Assignment: Solution
Two alternative routes from 1 to 20:
1. 1 – 11 – 15 – 18 – 20 = 10 min
2. 1 – 11 – 12 – 16 – 20 = 11 min
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Capacity Restrained
1.2
Travel time on link
1
0.8
0.6 β
& ,V ) #
0.4 t = t0 $1 + α * ' !
0.2 $% + C ( !"
0
0 500 1,000 1,500 2,000 2,500
Volume in Vehicles/hour
α = 0.15, β = 4.0
V=volume, C=capacity, t0=free flow travel time
Capacity restrained:Example
In example 12.16, the volume on link 1 to 5 was 485, and the
travel time was 2 minutes. If the capacity of the link is 500,
determine the link travel time that should be used for the next
traffic assignment iteration
t = to [1 + 0.15 (v/c)4]
t1-5 = 2 [1 + 0.15 (485/500)4]
= 2.27 minutes
108
TOPIC 2.3
TRANSPORTATION SYSTEM
MANAGEMENT
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”.
The main objective is to create more efficient use of existing facilities through
improved management and operation of vehicles and the roadway.
TSM: framework