CE5205 Week 6 - Trip Distribution
CE5205 Week 6 - Trip Distribution
1
Land use & socio economic
target-year allocation by zone
Target-year
estimates of Calibrated trip
interzonal distribution
impedances dij model
2
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 4
3
Trip Distribution
• Convert Production and Attraction Tables into
Origin ‐ Destination (O ‐ D) Matrices
Destinations
TAZ P A
Origins 1 2 3 4 5 6 Sum
1 15 22
1 T11 T12 T13 T14 T15 T16 O1
2 13 6
2 T21 T22 T23 T24 T25 T26 O2
3 26 5
3 T31 T32 T33 T34 T35 T36 O3
4 18 52
4 T41 T42 T43 T44 T45 T46 O4
5 8 2
5 T51 T52 T53 T54 T55 T56 O5
6 13 6
6 T61 T62 T63 T64 T65 T66 O6
Sum 93 93
Sum D1 D2 D3 D4 D5 D6
4
Trip Distribution, Methodology
• General Equation:
Tij = Ti P(Tj)
• Tij = calculated trips from zone i to zone j
• Ti = total trips originating at zone i
• P(Tj) = probability measure that trips will be attracted
to zone j
• Constraints:
• Singly Constrained
Sumi Tij = Dj OR Sumj Tij = Oi
• Doubly Constrained
Sumi Tij = Dj AND Sumj Tij = Oi
5
Trip Distribution Models
• Gravity Model You can consider this as the
a probability spatial distribution
Aj / C
ij
P(Tj)
Tij = Ti a
Sum (Ax / Cix)
6
Trip Distribution Models
• Intervening Opportunities Model, what does
it mean??
– The basic idea behind the intervening‐
opportunities model is that trip making is not
explicitly related to distance (or cost) but to the
relative accessibility of opportunities for satisfying
th objective
the bj ti off the
th trip.
ti
7
Trip Distribution Models
• Intervening Opportunities Model
8
Growth Factor Methods
• Type of growth factor methods
– Uniform growth method
– Single constrained growth factor method
– Double constrained growth factor method
9
Single constrained growth factor
method
• Consider the situation where information
available
il bl on the
th expected
t d growthth iin ttrips
i
originating in each zone, for example,
shopping trips.
10
Single constrained growth factor
method (cont’d)
j Sum Target
1 2 3 4
i over j Oi
11
Single constrained growth factor
method (cont’d)
j Sum Target
1 2 3 4
i over j Oi
12
Single constrained growth factor
method
• When information is available on the future
number
b off ttrips
i originating
i i ti andd tterminating
i ti in i
each zone, it implies:
– Different growth rates for trips in and out of each
zone
– Therefore, having two sets of growth factors for
each zone, for example, i and j
13
Advantages of Growth Factor
Methods
• Simple
• Make direct use of observed trip matrices and
forecasts of trip‐end growth
• Preserve as much as is consistent with the
information available on growth rates
14
Furness Method
• Balancing factors, Ai and Bj
Tij = tij i j Ai Bj
T
j
ij Oi
T
i
ij Dj
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 29
15
Furness Method (cont’d)
In plain English…
1. The base year matrix cells for one row are multiplied
by the growth for that zone and all rows are done in
turn. The matrix so obtained will have its origin trip
ends matching the future year origin trip ends which
is what we wanted to achieve, however the column
totals will not in general match the future year
destination tripp end,, so:
16
Furness Method (cont’d)
In plain English…
2. The matrix cells for each column are multiplied by the
ratio of the future year destination trip end to the
column total achieved in 1 above so that the resulting
matrix will have its column total matching its future
year destination trip end.
In plain English…
3. However its row total will not generally match its
future year origin trip end so Steps 1 and 2 are
repeated successively until the row and column total
are both close to the future year origin and
destination trip ends. The process stops when they
are close enough (e.g., to within a few trips).
17
j Sum Target
1 2 3 4
i over j Oi
18
j Sum Target
1 2 3 4
i over j Oi
1 400
2 460
3 400
4 702
Sum
1962
over i
Target
260 400 500 802 1962
Dj
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 36
Weaknesses of Furness
• If a cell in the matrix is zero, no matter how much it
is factored it always remains zero. Quite often a zone
would have few trips in the base year because it
does not have many people living there, nor jobs nor
shops etc so not many trips come from or go to
there. Whereas in the future the zone may be fully
developed with houses, shops, factories etc. No
matter how many trips are forecast to originate or
be destined for it, if most of the zone's cells are zero
in the base year, with Furness, they will remain zero
in the future.
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 37
19
Weaknesses of Furness
• One method for getting round this is to 'seed' all the
zero cells with a value (e
(e.g.,
g one trip
trip, or to assume a
distribution of trips from the zone in question to
every other zone and from every other zone to the
zone in question ).
• The resulting matrix for this zone is therefore
dependent on the input assumptions and it puts the
responsibility on the modeler to get the seeding
right.
Weaknesses of Furness
• The second weakness of the Furness is that it is not
sensitive to changes in the transport system
system. It is
known that if the transport system is improved
people will adjust their choice of destination to make
the most of additional destination opportunities
which have suddenly become much more accessible.
20
Weaknesses of Furness
• For example if a new road is built which now
connects you to a superstore
superstore, you are more likely to
use the new superstore.
• This second weakness is more intractable and one
generally adopts a more sophisticated model such as
the gravity model to overcome this weakness.
Gravity Models
• Gravity models are based on Newton’s law
of gravitation
gravitation.
• Gravity models estimate trips for each cell
in the trip matrix without directly using the
observed trip pattern. That’s why they are
sometimes called synthetic models.
• Gravity
G it models d l ill
illustrate
t t ththe macroscopic
i
relationships between places (e.g., homes
and workplaces).
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 41
21
Gravity Models (cont’d)
• The number of trips performed between O
andd D are directly
di tl proportional
ti l to
t the
th relative
l ti
attraction of each zone and inversely
proportional to some function of the spatial
separation between the two zones.
Pi Pj
Tij c
(1)
d ij
where
Pi trip production of origin i
Pj trip
p attraction of destination j
dij impedance between i and j
c parameters (constant)
proportionality factor
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 45
22
Gravity Models (cont’d)
• The trip‐production balance constraint:
Pi Tix (2)
x
23
Gravity Models (cont’d)
• Substituting Eq. (1) into (2) and taking the
t
terms nott involving
i l i theth index
i d x outside
t id the
th
summation:
Px
Pi Pi (3)
x d ixc
24
Gravity Models (cont’d)
• Substituting Eq. (4) into (1) leads to the
classical
l i l form
f off gravity
it model:
d l
c
Tij Pi
Pj d ij
(5)
P dc
x ix
x
c
Pj dij
P dc
x
x ix
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 51
25
Gravity Model (cont’d)
• The estimated target‐year trip attractions of a
t d as Pj* ) may b
zone j (denoted
(d be computed
t db
by
applying the following trip‐attraction balance
equation to the results of the model:
26
Gravity Model (cont’d)
• Finally, a set of socioeconomic factors kij can
b iintroduced:
be t d d
Pj f ij kij
Tij Pi Pi pij (8)
Pj f ij kij
j
Pj f ij kij
Tij Pi Pi pij ((8))
Pj f ij kij
j
27
Generalization
Generalization (cont’d)
28
Classical version of double
constrained gravity model
• To ensure trip conservation constraints, the
proportionality factor is replaced by two
sets of balancing factors Ai and Bj as in the
Furness model:
Tij Ai Oi B j D j f (cij )
Tij ai b j f (cij )
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 58
Ai 1/ D j f (cij )
j
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 59
29
Double constrained gravity model
• In the case of double constrained model
th values
the l off th
the balancing
b l i factors
f t are:
Ai 1/ B j D j f (cij )
j
B j 1/ Ai Oi f (cij )
i
Balancing factors
• Ai and Bj are independent.
• An iterative process similar to Furness’s can
be adopted: given set of values of deterrence
function f(cij), start with all Bj = 1, solve for Ai
and then use these values to re‐estimate the
Bj’s,, repeat
p until convergence
g is reached.
30
Gravity Model Process
1. Create Shortest Path Matrix
‐ Minimize link cost between centroids
2. Estimate Friction Factor Parameters
‐ Function of trip length characteristics by trip purpose
3. Calculate Friction Factor Matrix
4. Convert Productions and Attractions to Origins and
Destinations
5. Calculate O‐D Matrix
6. Enforce Constraints on O‐D Matrix
‐ Iterate between enforcing total origins and destinations
31
Example: travel time matrix for 6 TAZs
• Inverse Power:
f(cij) = cij- b b>0
• Gamma:
f(cij) = a cij- b e- c (cij) a > 0, b > 0, c > 0
Trip Purpose a b c
HBW 28507 0.020 0.123
HBP 139173 1.285 0.094
NHB 219113 1.332 0.010
ref. NCHRP 365 / TransCAD UTPS Manual pg. 80
32
Example friction factors using
travel times alone
Zone ID 1 2 3 4 5 6
1 1.349859 1.822119 2.459603 3.320117 4.481689 6.049647
2 1.822119 1.349859 1.568312 1.822119 2.459603 3.320117
3 2.459603 2.459603 1.822119 1.822119 1.822119 2.459603
4 3.320117 3.320117 2.459603 1.349859 1.822119 2.459603
5 4.481689 4.481689 3.320117 2.459603 1.349859 1.822119
6 6.049647 6.049647 4.481689 3.320117 3.320117 1.349859
33
Trip Conversion (Approximate)
• Home Based Trips: Non ‐ Home Based Trips:
Oi = (Pi + Ai) / 2 Oi = Pi
Di = (Pi + Ai) / 2 D i = Ai
• Oi = origins in zone i (by trip purpose)
• Di = destinations in zone i (by trip purpose)
• Pi = productions in zone i (by trip purpose)
• Ai = attractions in zone i (by trip purpose)
34
O‐D Matrix Calculation
Destinations
Origins 1 2 3 4 5 6 Sum
1 T11 T12 T13 T14 T15 T16 O1
2 T21 T22 T23 T24 T25 T26 O2
3 T31 T32 T33 T34 T35 T36 O3
4 T41 T42 T43 T44 T45 T46 O4
5 T51 T52 T53 T54 T55 T56 O5
6 T61 T62 T63 T64 T65 T66 O6
Sum D1 D2 D3 D4 D5 D6
Attraction/friction matrix
Aj/friction factor Table
Zone ID 1 2 3 4 5 6 Total
1 16.298 3.293 2.033 15.662 0.446 0.992 38.724
2 12.074 4.445 3.188 28.538 0.813 1.807 50.865
3 8.945 2.439 2.744 28.538 1.098 2.439 46.203
4 6.626 1.807 2.033 38.523 1.098 2.439 52.526
5 4.909 1.339 1.506 21.142 1.482 3.293 33.670
6 3.637 0.992 1.116 15.662 0.602 4.445 26.453
35
Gravity model probability
Gravity Model Probability
Zone ID 1 2 3 4 5 6 Total
1 0 421
0.421 0.085
0 085 0.052
0 052 0.404
0 404 0.012
0 012 0.026
0 026 1
2 0.237 0.087 0.063 0.561 0.016 0.036 1
3 0.194 0.053 0.059 0.618 0.024 0.053 1
4 0.126 0.034 0.039 0.733 0.021 0.046 1
5 0.146 0.040 0.045 0.628 0.044 0.098 1
6 0.137 0.037 0.042 0.592 0.023 0.168 1
Aj / frictionij
Sum (Ax / frictionix)
For each cell value we apply the gravity equation once ‐ in this
iteration ‐ after this we use the ratio to adjust the values in the
cells ‐ until row and column targets are satisfied
36
Trip interchange ‐ iteration 2
TIJ iteration 2
Zone ID 1 2 3 4 5 6 Total Oi Ratio
1 7.4
7 4 3.0
3 0 3.4
3 4 4.6
4 6 0.6
0 6 0.8
0 8 19 8
19.8 18.5
18 5 0 9355882
0.9355882
2 2.1 1.6 2.1 3.3 0.4 0.6 10.1 9.5 0.9430955
3 2.8 1.6 3.2 5.9 1.0 1.5 15.9 15.5 0.9732926
4 4.2 2.3 4.7 15.8 1.9 2.9 31.8 35 1.1000923
5 0.7 0.4 0.8 1.9 0.6 0.9 5.2 5 0.956075
6 1.2 0.7 1.4 3.5 0.6 2.8 10.2 9.5 0.9329658
Total 18.5 9.5 15.5 35 5 9.5 93
Using the ratios from before we succeed in getting the targets for the
sums off cells
ll ffor each
h column
l - look
l k att the
th other
th ratios
ti
37
Trip interchange ‐ iteration 4
TIJ iteration 4
Zone ID 1 2 3 4 5 6 Total Oi Ratio
1 7.1 2.9 3.2 4.2 0.5 0.8 18.6 18.5 0.993094
2 2.1 1.5 2.0 3.0 0.4 0.6 9.5 9.5 0.997665
3 2.8 1.5 3.1 5.6 0.9 1.4 15.5 15.5 1.000101
4 4.7 2.6 5.2 17.1 2.1 3.2 34.9 35 1.003991
5 0.7 0.4 0.7 1.8 0.5 0.8 5.0 5 1.001637
6 1.2 0.6 1.3 3.2 0.5 2.7 9.5 9.5 1.000214
Total 18.5 9.5 15.5 35 5 9.5 93
Example 1
• Perform an application of the basic gravity model for
trips between a proposed site (attractor) and three
surrounding zones. This site receives 1,524 incoming
trips during morning peak. Assume that all incoming
trips are from the surrounding zones. Average travel
times from each zone to the site as well as the
population of each zone are given in the figure next
page Estimate the number of trips from each zone
page.
to the site.
38
Zone 1 Zone 2
Population 3000 Population 4500
ts3 =15
Zone 3
Population 7500
Solution:
(1524)(3000)
1
G1s 381,000
12
(1524)(4500)
G2 s 428,625
16
(1524)(7500)
G3 s 762,000
15
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 79
39
The sum of all “gravities” should be equal to the
number of trips destined to the site. Thus,
G1s G2 s G3 s 1524
which yields 0.0009697, thus
G1s 369
G2 s 416
G3 s 739
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 80
Zone 1 Zone 2
369 416
Site
739
Zone 3
40
Example 2
• The target year productions and relative
attractiveness
tt ti off a 4‐zone
4 city
it hhas b
been
estimated to be as follows:
Example 2 (cont’d)
• The calibration of the gravity model for this city
estimated the parameter c to be 2 2.0
0 and all
socioeconomic adjustment factors to be 1.0. Apply
the gravity model to estimate all target interchanges
Tij and to estimate the total target‐year attractions
of each zone given that the target‐year interzonal
impedances
p dij will be shown in the followingg table.
41
i j 1 2 3 4
1 5 10 15 20
2 10 5 10 15
3 15 10 5 10
4 20 15 10 5
1 0 0.0400 1 0 0 0
42
Solution: i =3, P3 =2600
1 0 0.0044 1 0 0 0
43
The solution can be summarized by the
following trip table:
i j 1 2 3 4 Sum
2 0 0 0 0 0
4 0 0 0 0 0
44
Derivation
3 1 1 5 4 0 1 5
5 2 1 8 3 2 3 8
2 2 4 8 3 3 2 8
10 5 6 21 10 5 6 21
Derivation (cont’d)
• Assume that Oi and Dj are known, there exist
many possible trip matrices that add up to the
number of Os and Ds.
• The last two tables are only two of a large
number of possible Tij .
• Each Tij represents a macro‐state that can be
produced
d d with ith a large
l number
b off micro‐states.
i t t
45
Derivation (cont’d)
• The problem is to find the Tij that is associated
with
ith th
the maximum
i number
b off micro‐states,
i t t
assuming a priori that they are all equally
likely.
Derivation (cont’d)
• Consider the following constraints:
T j
ij Oi (10)
T i
ij Dj ((11))
46
Defining T as the total number of trips :
T Tij , the total number of combinations
ij
(C T c
j ij
ij ij ) (14)
47
i' and "j are " Lagrangian multiplers. The
Tijj s which maxmize L and which are therefore
the most probable distribution of trips are the
solution of :
L
ln Tij i' "j cij 0 (15)
Tij
Therefore, Tij exp( i' "j cij ) (16)
48
For convenienc e, we define :
Ai exp( i' ) / Oi (19)
B j exp( "j ) / D j (20)
So, Tij Ai Oi B j D j exp( cij ) 0 (21)
Eq. (21) is actually t he classical gravity model.
The value of balancing factors can be derived :
Ai B D exp( c )
j j j ij
1
(22)
Bj A O exp( c )
i i i ij
1
(23)
Derivation (cont’d)
• Eqs. (21)‐(23) represent the entropy
maximizing
i i i spatial
ti l interaction
i t ti model
d l in
i its
it
most general form (Wilson, 1970, 1974).
49
Properties of Gravity Model
• A more rigorous representation
• Tools available in mathematical programming
• Physical interpretation
• match the assumption
Calibration
• Parameters: Ai , Bj , , etc.
• Calibration for linear regression model can be
solved by a relatively easy minimization of the
sum of squared derivatives.
• Calibration of gravity model is an iterative
process
process.
50
Calibration (cont’d)
• Step 1: Set initial parameter values
• Step 2: Assessed by best known base year
data
• Step 3: Compare computed and observed
values (trip‐length frequency distribution)
• Step 4:
4 Convergence
Model Comparison
Model Advantages Disadvantages
Growth Factor Simple Does not reflect changes in the
Easy to balance origin and frictions between zones
destination trips at any Does not reflect changes in the
zone network
Gravity Specific account of friction Requires extensive calibration
and interaction between Long iterative process
zones
Intervening - Does not require origin - Accounts for only relative
Opportunities destination data changes in time - distance
Claimed to bear a better relationship between zones
“fit” to actual traffic Arbitrary choice of
probability factor
New: Destination choice models build on intervening opportunities
51
Practical Considerations
• Sparse matrices
– An attribute usually found in realistic matrices
– Likely to cause problem in matrix operation and
computer implementation
– Fail to capture the truth when it is being
expanded
52
Practical Considerations (cont’d)
• Intra‐zonal
Intra zonal trips
– In practice, intra‐zonal trips are taken out from
considerations.
– Intra‐zonal trips are not loaded to the network
in later steps (TA).
– Require special treatment only for rather
coarse zoning systems.
• Trip purposes
– In practice, trips to work/school are modeled
by double constrained gravity model;
shopping/social trips are modeled by single
constrained model.
– The
Th reason, accurate t ttrip
i attractions
tt ti are
difficult captured straightforward.
53
Practical Considerations (cont’d)
• Generations/Attractions;
Origins/Destination
– The synthetic model is developed under the
assumption that each trip has a generation and
an attraction end.
– Remember that the generation end for HB
trips is always the home.
– Inconsistent with the realization of O & D.
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 108
Production Attraction
Production Attraction
Work
W Shop
S p
Attraction Production
54
Practical Considerations (cont’d)
• Generations/Attractions;
Origins/Destination
– In practice, it is necessary to convert into
proper OD matrices for shorter period of time
(e.g., peak periods) based on single purpose
(e g to
(e.g., to‐work).
work)
55
K Factors
• Even after calibration, there will typically still be
discrepancies between the observed & calculated data
• To “fine‐tune”
fine‐tune the model
model, some employ socioeconomic
adjustment factors, also known as K‐Factors
– The intent is to capture special local conditions between some
zonal pairs such as the need to cross a river
1-Xi
Kij = Rij
1 - XiRij
K Factor Example
Observed Qij 300
Rij = = R13 = = 1.20
C l l t d Qij
Calculated 249
56
The Problem with K‐Factors
• Although K‐Factors may improve the model
in the base year
year, they assume that these
special conditions will carry over to future
years and scenarios
– This limits model sensitivity and undermines the
model’s ability to predict future travel behavior
• The need for K
K‐factors
factors often is a symptom of
other model problems.
– Additionally, the use of K‐factors makes it more
difficult to figure out the real problems
CE5205 - Trip Distribution DH Lee © 2013, All rights reserved 114
57
Practical Considerations (cont’d)
• Multiple Matrices
– For each trip purpose obtain different Origin‐
Destination Tij matrices
– Usually these are 24 hour Matrices (number of
trips from one zone to another in a 24 hour
period)
– In assignment we will need a matrix of vehicles
moving from a zone to another during a specific
period (peak usually) in a typical day
58
Limitations of the Gravity Model
• The skim table impedance factors are often
too simplistic to be realistic
– Typically based solely upon vehicle travel times
• At most, this might include tolls and parking costs
– Almost always fails to take into account how things
such as good transit and walkable neighborhoods
affect trip distribution
– No obvious connection to behavioral decision‐
making
59
End of This File
60