This page is open for editing because it is part of the Incubator. Have something to add? Please register so you can contribute. Have an option you would like to share? Please click on the 'Talk' button to enter the dialogue. The TF Resource Volunteers appreciate your feedback and interest.

This page is part of the Category Destination Choice Models.

Three primary theoretical starting points for developing destination choice models dominate current practice:

  • Gravity models.
  • Entropy maximization (also known as information minimization) models.
  • Random utility models.

These three modeling approaches are, under appropriate assumptions, mathematically equivalent, and so are special cases of what can be generally called spatial interaction models. All these models attempt to address the same problem, as illustrated in Figure 1, in which spatial interactions (usually trips) between locations in space (typically traffic zones) are to be predicted, given limited, more macro, information concerning these interactions, such as the number of trips originating in each zone and/or the number of trips destined to each zone.

Figure 1: The Spatial Interaction Problem


Gravity Models

Gravity models have been in use by geographers, market researchers, transportation modelers and many others for well over a hundred years. The starting point for these models, as the name implies, is Newton’s Law of Gravity:

(1)

$$F_{ij}={Gm_i}{m_j}{{d_{ij}}^{-2}}$$

where \(F_{ij}\) is the gravitation force between bodies i and j, \(m_x\) is the mass of body x, \(d_{ij}\) is the distance between bodies i and j, and G is the gravitational constant. That is, the gravitational force (or interaction) between the bodies is proportional to their masses (size) and inversely related to the distance between them: bigger bodies closer together have a greater interaction.

Gravity models of human spatial interaction adopt the same assumption: the amount of interaction between two locations (usually represented by trips, but could also be flows of money, information, etc.) is proportional to the “size” (“attractiveness”) of the two locations and the extent of their physical separation (measured in distance or travel time). That is, gravity models assume: $$T_{ij}∝{X_i}$$ $$T_{ij}∝{X_j}$$ $$T_{ij}∝{f_{ij}}$$

or,

$$T_{ij}=k{X_i}{X_j}{f_{ij}}$$

where \(T_{ij}\) is the number of trips between origin i and destination j, \(X_i\) is some measure of the “size” of location i, \(f_{ij}\) is a measure of the “impedance” (difficulty of travel) between locations i and j, and k is a constant of proportionality. \(F_{ij}\) is an inverse function of distance or travel time; that is, for example if \(t_{ij}\) is the travel time from i to j, then:

(2)

$${df_{ij}\over{d}{t_{ij}}}<{0}$$

The constant k is chosen so that (2) satisfies known constraints on the interactions being predicted. If, for example, \(X_i\)= \(O_i\), the number of shopping trips predicted by a trip generation model to originate in zone i, then it is reasonable to impose the constraint on our model that:

(3)

$${∑_{j'}}{T_{i'j}}={O_j}{∀ i}$$ Substituting (2) into (3) and solving for k yields:

(4)

$${k}={{1}\over{∑_{j'}}{X_{j'}}{f_{ij'}}}$$ or $${T_{ij}}={{{O_i}{X_j}{f_{ij}}} \over{{∑_{j'}}{X_{j'}}{f_{ij'}}}}$$

Equation (4) is called a singly-constrained gravity model, since only a single constraint (equation (3)) has been imposed on the model. Very many examples of singly-constrained destination choice models exist, in a variety of applications. In particular, note that instead of constraining the predicted trips to match predetermined trip origin totals (an origin-constrained model), it would have been possible to constrain the trips to sum to predetermined trip destination totals instead (a destination constrained model).

In some cases, such as predicting work locations, it may make sense to constrain the predicted origin-destination (O-D) trips to equal both trip origin and trip destination totals (as typically determined by trip generation models). In this case, \(X_j\) is usually defined as \(D_j\), the predetermined number of trips destined to location j, and, in addition to constraint (3), a second constraint is added that equation (2) must also satisfy:

(5)

$${∑_{i'}}{T_{i'j}}={D_j}{∀ j}$$

Imposing both constraints (3) and (5) on the model results in a doubly-constrained gravity model, which can be expressed as:

(6)

$${T_{ij}}={{{O_i}{{D_j}^{*}}{f_{ij}}} \over{{∑_{j'}}{{D_{j'}}^{*}}{f_{ij'}}}}$$

where \({D_{j}}^{*}\) is a modified attraction term that is iteratively defined so that constraint (5) is satisfied for all destinations j.

Entropy Maximization Models

While it is intuitively plausible that should trips go to “bigger” (more attractive) destinations as well as to destinations that are closer to, rather than farther from, the trip origin, gravity models have always been criticized for their apparently ad hoc derivation: why should human interactions necessarily follow the same “law” as gravitational bodies? Beginning with Alan Wilson’s seminal paper in 1967,[1] a sound statistical theory underlying gravity models was developed. Wilson showed that the statistically most likely trip matrix, T, is given by maximizing the entropy function:

(7)

$${max_T}{⁡∑_i}{∑_j}{T_{ij}}{ln⁡}{[T_{ij}]}$$

subject to known constraints. In the case of a doubly-constrained model, at a minimum, these are constraints (3) and (5), plus typically a third constraint which often takes the form:

(8)

$${{{∑_i}{∑_j}{T_{ij}}{t_{ij}}}\over{T}}={t ̅ ∀ i , j}$$

where T is the (known) total number of trips in the system, and t ̅ is the observed average travel time. In other words, equation (8) states that a feasible predicted trip matrix is one in which the predicted average travel time (the left-hand side of (8) equals the observed average travel time).

Solving this mathematical program yields the following trip distribution model:

(9)

$${T_{ij}}={A_{i}}{B_{j}}{O_{i}}{D_j}{e^{ẞt_{ij}}}$$

where \(ẞ<{0}\) is an estimated parameter and \(A_i\) and \(B_j\) are “balancing factors” that are iteratively defined so that constraints (3) and (5) are both satisfied:

(10.1)

$${A_{i}}={{1}\over{{∑_{j'}}{B_{j'}}{D_{j'}}{e^{ẞt_{ij'}}}}}$$

(10.2)

$${B_{j}}={{1}\over{{∑_{i'}}{A_{ij'}}{O_{ij'}}{e^{ẞt_{i'j}}}}}$$


It can be shown that \(B_j\)\(D_j\) = \({D^*}_j\), the “modified attraction term” in the gravity model formulation, equation (6). Noting this and substituting (10.1) into (9) yields:

(11)

$${T_{ij}}={{{O_i}{{D^*}_{j}}{e^{βt_{ij}}}}\over{{∑_{j'}}{{D^*}_{j'}}{e^{βt_{ij'}}}}}$$

This is exactly the doubly-constrained gravity model (equation (6)) with the specific impedance function \(f_{ij}\) = \(e^{{βt}_{ij}}\). In other words, the “ad hoc” gravity model, “properly specified” is the statistically most likely model of a trip O-D matrix, given known constraints. This provides very strong theoretical support for “gravity-like” spatial interaction models. Other important points to note include: A specific entropy model specification is determined by the choice of constraints imposed on the model. The general procedure for specifying an entropy model is defined below. Arbitrarily complex specifications can be generated, providing that an appropriate constraint set can be specified. In particular, the impedance functional form derives from the constraint(s) written concerning transportation level-of-service variables. In the example above, imposing the constraint that the predicted system-wide average travel should equal the observed average time in the base data yields a negative exponential impedance function. If instead, one wrote a constraint in which the predicted average of \(ln{(T_{ij})}\) equals the observed average value, then the resulting impedance function would take the form of a negative power function \({(t_{ij})}^{-b}\).

Random Utility Models

By far the most common type of destination choice model used in practice is some form of random utility model, usually a multinomial logit model or a nested logit model (e.g., a nested destination-mode choice model). Random utility (discrete choice) models are used throughout travel demand modeling given their strong theoretical foundations in microeconomic theory and their practical and efficient analytical function forms.

A typical logit destination choice model for the probability that destination j is chosen given trip origin i \((P_{j|i})\) is often generically expressed as:

(12)

$${P_{j|i}}={{e^{V_{j|i}}}\over{{∑_{j'}}{e^{V_{j'|i}}}}}$$

where \(V_{j|i}\) is the systematic utility of destination j given origin i. Logit destination choice models are widely used for a variety of reasons including: Flexibility in specifying the utility function (any relevant variable can be readily included). Readily available parameter estimation software. Familiarity with the method. Computational efficiency. Support for both disaggregate (person-level) and aggregate (trip flows) formulations.

Detailed discussion of the specification and use of logit destination choice models is provided on many other pages throughout this wiki.

Mathematical Equivalence of Gravity, Entropy and Logit Models

It is commonplace in the literature to state that “destination choice” (i.e., disaggregate logit) models are superior in performance to “gravity models”. This, however, is a somewhat misleading statement in that it reflects the common practice in terms of how “gravity” and “logit” models are typically implemented, rather than fundamental differences in the mathematics of the two approaches. In practice, “gravity” models are often aggregate (based on O-D flows instead of individual trips) and very simply specified in terms of both attraction/size variables and impendence functions (including sometimes the use of distance rather than travel times). “Logit” models, on the other hand, are usually disaggregate (based on individual trips) and can have an extensive set of explanatory attraction variables in the utility function. Given this typically more extensive set of explanatory variables, it is not surprising that such “logit” models outperform the more simply specified “gravity” models.

But, as Daly (1982),[2] first observed, gravity models can be shown to be a special case of nested logit models where the nests are degenerate, aggregate alternatives. Simiilarly, Anas (1983)[3] observed, “gravity” models as derived through entropy maximization can be formulated at the disaggregate (individual trip) level as well, and can incorporate any number of explanatory variables. In particular, any linear-in-the-parameters utility function typically used in logit destination choice models can be replicated in an entropy model. Further, if consistently defined at the same level of aggregation, the same set of explanatory variables and the same base data are used for parameter estimation, then it can be shown that the estimated parameters for the two models will be identical. Thus, logit and entropy (gravity) models are, in fact, not different models but are mathematically the same model.

As a simple illustration of this, equation (4) can be rearranged to yield:

$${T_{ij}}={O_i}[{{{X_j}{f_{ij}}}\over{{∑_{j'}}{X_{j'}}{f_{ij'}}}}]={{O_i}{P_{j|}}}$$

where:

(13)

$${P_{j|i}}={{{X_j}{f_{ij}}}\over{{∑_{j'}}{X_{j'}}{f_{ij'}}}}={{e^{{ln⁡{X_j}}+{ln⁡{f_{ij}}}}}\over{{∑_{j'}}{e^{{ln⁡{X_{j'}}}+{ln⁡{f_{ij'}}}}}}}$$

If we assume that: $${f_{i}}j={e^{{βt}_{ij}}}$$ then equation (13) becomes:

(14)

$${P_{j|i}}={{{e^{{ln{X_j}}+{{βt}_{ij}}}}}\over{{∑_{j'}}{e^{{ln⁡{X_{j'}}}+{{βt}_{ij'}}}}}}$$

Equation (14) is a simple logit destination choice model.

This mathematical equivalency with entropy models only holds for multinomial logit models, not for random utility models in general. The ability to theoretically derive logit models from two very different starting points, one behavioral (people choose alternatives so as to maximize their personal utility) and one statistical (deriving most likely choice probabilities given known constraints on these probabilities), however, is striking and arguably reinforces the case for use of logit models in applications where the underlying assumptions of the model (e.g., statistical independence of the alternatives) holds.

Other Destination Choice Model Formulations

Historically, other approaches to destination choice models have been developed, including intervening opportunities models and competing opportunities models. In general, these approaches tend to be computationally more intensive without generating improved fits to observed data than more conventional methods and so are rarely used in current practice. Brief descriptions of these methods are provided here for historical documentation.

Intervening Opportunities Models

Intervening opportunities models were proposed early on (Stouffer, 1940) and may continue to be used by a small number of agencies. [Eric Miller to provide more?]

Competing Opportunities Models

Competing destinations models (Fotheringham, 1983) have received a fair amount of attention in the geography literature. They have been used in practice by at least one transportation planning agency. Fotheringham’s technique, which introduces an accessibility measure, has now become a common best practice in destination choice modeling (following Bhat et al., 1998).

[Eric Miller to provide more?]

Doubly-Constrained Gravity/Entropy Models

Gravity Formulation

Given observed or predicted trip origins, Oi and destinations, \(D_j\), for a set of zones, the spatial interaction modeling problem is to predict the origin-destination trips, \({T_{ij}}\), between every origin zone i and destination zone j. The predicted trips must satisfy the following two constraints:

(15)

$${∑_{j'}}{T_{ij'}}={O_i} ∀ i$$

(16)

$${∑_{i'}}{T_{i'j}}={D_j} ∀ j$$

If we assume that these trips are proportional to a zone-to-zone impedance function, \({f_{ij}}\), then the following gravity model will always satisfy constraint (15);

(17)

$${T_{ij}}={{{O_i}{D_j}{f_{ij}}}\over{{∑_{j'}}{D_{j'}}{f_{ij'}}}}$$

Equation (17), however, will not satisfy constraint (16) except, perhaps, in the most trivial cases. The only way that a spatial interaction model can satisfy both the “row constraints” (15) and the “column constraints” (16) is through an iterative solution procedure in which the actual “attraction term” \(D_j\) is replaced by a “modified attraction term” \({{D_j}^{*,k}}\) :

(18.1)

$${{D_j}^{{*,}{k+1}}}={{D_j}^{*,k}}[{{D_j}\over{{∑_i}{{T_{ij}}^k}}}]$$

(18.2)

$${{D_j}^{*,0}}={D_j}$$

(19)

$${{T_{ij}}^{k+1}}={{{O_i}{{D_j}^{*,k}}{f_{ij}}}\over{{{∑_j'}{{D_{j'}}^{*,k}}{f_{ij'}}}}}$$

Where \({{T_{ij}}^k}\) is the predicted trips from zone i to zone j in the kth iteration and the procedure iterates until:

(20)

$${{D_j}\over{{∑_i}{{T_{ij}}^k}}} ≤ ϵ ∀ j $$

Entropy Formulation

The equivalent entropy formulation involves solving the following mathematical program:

(21)

$${{max}_┬}{∑_i}{∑_j}{T_{ij}}{{ln⁡}{T_{ij}}}$$ Subject to: Constraints (15) and (16)

(22)

$${{{∑_i}{∑_j}{T_{ij}}{t_{ij}}}\over{T}}= {{t ̅ }{∀ i,j}}$$

Using the method of Lagrange to maximize (21) subject to the equality constraints (15), (16) and (22) eventually yields the solution:

(23)

$${T_{ij}}={A_i}{B_j}{O_i}{D_j}{e^{{βt}_{ij}}}$$

where β is an estimated parameter (\({β<0}\))and \({A_i}\) and \({B_j}\) are "balancing factors" that are iteratively defined so that constraints (3) and (5) are both satisfied:

(24.1)

$${A_i}={{1}\over{{∑_{j'}}{B_{j'}}{D_{j'}}{e^{{βt}_{ij'}}}}}$$

(24.2)

$${B_j}={{1}\over{{∑_{i'}}{A_{ij'}}{O_{ij'}}{e^{{βt}_{i'j}}}}}$$

To numerically compute the balancing factors, the Bj terms can be initialized to 1.0, the Ai terms can be computed given these Bj’s, and the algorithm iterates until the factors converge to stable values.

A common criticism of doubly-constrained gravity models is the supposedly ad hoc nature of the balancing procedure using the “modified attraction terms” described above. As shown by the entropy model formulation, however, a doubly-constrained matrix can only be computed iteratively: no analytical closed-form solution is possible. Further, with manipulation, it can be shown that \({B_j}{D_j}={{D_j}^*}\), the “modified attraction term” in the gravity model formulation, equation (19). Hence the gravity model balancing procedure is not, in fact “ad hoc” but rather the correct method for computing a doubly-constrained matrix.

Estimating Gravity/Entropy Model Parameters

Various ad hoc procedures are sometimes used to estimate gravity model parameters. Given the entropy interpretation of the gravity model, however, the method for parameter estimation is unambiguous: parameters must be chosen so that the underlying constraints of the model hold. For example, for the simple doubly-constrained model given by equation (23) the parameter  must be chosen so that associated constraint generating this parameter, equation (22) holds. This problem can be solved using the standard Newton-Raphson root-finding method to find the value of  that satisfies equation (22).

Further, in the case of singly-constrained models gravity/entropy models the set of constraints generating the set of parameters to be estimated are exactly the set of equations defining the first-order conditions for maximizing the long-likelihood function for the corresponding multinomial logit model. Thus, standard logit model parameter estimation procedures can be used.

Developing an Entropy Model

Explanatory variables are entered into an entropy model by writing a constraint for each variable. In the sections above, travel time was entered into the model by writing a constraint involving it (predicted average time = observed average time). This can be repeated for as many variables as desired. As an example, consider a singly- (origin-) constrained shopping destination choice model in which one wants the following explanatory variables to enter the impedance (utility) function: ln(Fj) (where Fj is the amount of retail floorspace in zone j) A “dummy variable” CBDj (where CBDj = 1 if zone j is in the city’s central business district).

The full mathematical program to solve to generate this model is:

(25)

$${{max}_┬}{∑_i}{∑_j}{T_{ij}}{{ln⁡}{T_{ij}}}$$ Subject to:

(26)

$${∑_{j'}}{T_{ij'}}={O_i} ∀ i $$

(27)

$${∑_i}{∑_j}{T_{ij}}{{CBD}_j}={¯CBD}={"Total trips destined for the CBD"}$$

(28)

$${∑_j}{T_{ij}}{ln⁡({F_j})}= {¯F} ={"Total weighted"{ln⁡(floorspace)}visited"}$$

(29)

$${{{∑_i}{∑_j}{T_{ij}}{t_{ij}}}\over{T}}= {{t ̅ }{∀ i,j}}$$ To solve this, construct the Lagrangian equation:

$${{max}_┬}{S}={{∑_i}{∑_j}{T_{ij}}{ln⁡{T_{ij}}}} - {∑_i}{λ_i}[{{∑_{j'}}{T_{ij'}} - {O_i}]} - {{μ}[{∑_i}{∑_j}{T_{ij}}{{CBD}_j} - {¯CBD}]} - {{γ}[{∑_j}{T_{ij}}{{ln}{F_j}} - { ¯F}]} - {{β}[{∑_i}{∑_j}{T_{ij}}{t_{ij}} - {T¯t}]}$$

To maximize, solve the first-order optimality conditions:

$${{∂S}\over{∂T}_{ij}}=0=ln{T_{ij}} -1- {λ}_{i} - μ{CBD}_j - {γ}ln{F_{j}} - β{t_{ij}}$$ which yields:

(30)

$${T_{ij}}=e^{1+{λ}_i + μ{CBD}_j + γ{ln{F_j}+{βt}_{ij}}}$$

Substituting (30) into (26) and solving for \({1+{λ_i}}\) yields:

(31)

$${e^{1+{λ}_i}}={{O_i}\over{{∑_{j'}}{e^{μ{CBD}_{j'}+γ{ln{F_{j'}}+{βt}_{ij'}}}}}}$$

Substituting (31) into (30) yields:

(32)

$${T_{ij}}={{{O_i}{e^{μ{CBD}_j + γ{ln{F_j}} + {βt}_{ij}}}}\over{{{∑_{j'}}{e^{μ{CBD_{j'}} + γ{ln{F_{j'}}} + {βt}_{ij'}}}}}}$$

Equation (32) is the desired singly-constrained entropy trip destination model. Note that it can be rewritten as:

(33)

$${T_{ij}}={{O_i}{{F_j}^γ}{e^{μ{CBD}_j} + {βt}_{ij}}}\over{{∑_{j'}}{{F_{j'}}^γ}{e^{{μ{CBD}_{j'}} + {βt}_{ij'}}}$$

which is often the format used for “gravity” models.

Equation (32) also defines the destination probability choice model:

(34)

P_(j|i)= e^(μ〖CBD〗_j + γln(F_j )+βt_ij ) / ∑_j'▒e^(μ〖CBD〗_j' + γln(F_j' )+βt_ij' )

As previously discussed, equation (33) is a multinomial logit model, which can be estimated using standard logit estimation software.

References

Content Charrette: Destination Choice Models

  1. Wilson, A.G., “A Statistical Theory of Spatial Distribution Models”, Chapter 3 in R. Quandt (ed) The Demand for Travel: Theory and Measurement, Lexington, Mass: Lexington Books, 1970, . 55-82.
  2. Daly, A. (1982) 'Estimating Coice Models Containing Attraction Variables', "Transportation Research, Part B: Methodological" Vol. 16, No. 1, pp. 5-15
  3. Anas, A., “Discrete choice theory, information theory, and the multinomial logit and gravity models”, Transportation Research B 17, 1983, 13-23.