Highway Notes
Highway Notes
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
Preliminary studies to understand the situation
Situation Definition that caused the need for transportation
improvement.
To describe the problem in terms of objectives
& translate objectives into criteria that can be
quantified.
Problem Definition Objectives: statements of purpose, etc. Reduce
traffic congestion
Criteria: measures of effectiveness, etc. Travel
time
Search for Solutions Brainstorming stage, many options (variety of
ideas, designs, locations, system configurations)
may be proposed for further testing and
evaluation.
Transportation Planning Process: Elements (cont.)
Elements Description
To estimate how each proposed alternatives
Analysis of Performance would 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)
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/
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
• To determine the number of trips that begin or end
at the home (developed by FHWA).
Given the high correlations that typically exist between trip rates
and socio-economic variables.
2. Gravity Model
Assumptions:
Source: MIT
Growth Factor Models
Growth Factor Models assume that there is basic
trip matrix exist
Tij = τ tij
= (1.2)(5)
=6
Trip Matrix, T
(2018)
Expressed as:
Zone 1 2 3 Total
Pi 14 33 28 75
Aj 33 28 14 75
Zone 1 2 3
1 13 82 41
2 50 26 39
3 50 20 41
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
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)
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)
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)
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.
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Doubly
constrained
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
Source: Prof. Dr. V. Thamizh Arasan, Department of Civil Engineering Indian Institute of Technology, Madras
The number of productions and attractions has
been computed for each zone by methods described
in the section on trip generation, and the average
travel times between each zone have been
determined. Refer table 12.8 & 12.9. Determine the
number of zone to zone trips through two
iterations.
“Type a quote here”
–Johnny Appleseed
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
Tij = (tiGi) tijGj
ΣtixGx
Tij = no. of trips estimated from zone i to zone j
ti = present trip generation in zone i
Gx = growth factor of zone x
tiGi = future trip generation in zone i
tix = no. of trips between zone i and other zones x
tij = present trip between zone i and zone j
Gj = growth factor of zone j
Example:
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
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
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
Qualitative factors which are less easy to measure are:
(a) comfort and convenience
(b) reliability and regularity
(c) protection, security
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
pm = probability that mode m is chosen
The utility functions for auto and transit are as follows.
Auto: UA = - 0.46 - 0.35T1 - 0.08T2 - 0.005C
Transit: UT = - 0.07 - 0.05T1 - 0.15T2 - 0.005C
where T1 = total travel time (min), T2 = waiting time (min), C = cost (cents)
Auto Transit
T1
T2
C
A market segment consists of 500 individuals. A multinomial logit
mode choice model is calibrated for this market segment, resulting in
the following utility function:
u = Bm - 0.30C - 0.02T
where C is out of pocket cost (RM), T is travel time (min). Values of Bm are
Bus transit 0.00
Rail transit 0.40
Auto 2.00
For a particular origin-destination pair, the cost of an auto trip, which
takes 15 min is RM2.50. Rail transit trips, which take 20 min, cost
RM1.50. Bus transit takes 30 min and costs RM1.00. Predict the number
of trips by each mode from this market segment.
Determine utility functions:
TB = 0.112 x 500 = 56
TR = 0.176 x 500 = 88
TA = 0.712 x 500 = 356
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:
+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.
• 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
98
loading.
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
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
t = to [1 + 0.15 (v/c)4]
t1-5 = 2 [1 + 0.15 (485/500)4]
= 2.27 minutes
103
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