Trip distribution
≈ 13 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Trip distribution (or destination choice or zonal interchange analysis) is the second component (after trip generation, but before mode choice and route assignment) in the traditional four-step transportation forecasting model. This step matches tripmakers’ origins and destinations to develop a “trip table”, a matrix that displays the number of trips going from each origin to each destination. Historically, this component has been the least developed component of the transportation planning model. Where: T ij = trips from origin i to destination j. Note that the practical value of trips on the diagonal, e.g. from zone 1 to zone 1, is zero since no intra-zonal trip occurs. Work trip distribution is the way that travel demand models understand how people take jobs. There are trip distribution models for other (non-work) activities such as the choice of location for grocery shopping, which follow the same structure.
Trip distribution (or destination choice or zonal interchange analysis) is the second component (after trip generation, but before mode choice and route assignment) in the traditional four-step transportation forecasting model. This step matches tripmakers’ origins and destinations to develop a “trip table”, a matrix that displays the number of trips going from each origin to each destination. Historically, this component has been the least developed component of the transportation planning model. Where: T ij = trips from origin i to destination j. Note that the practical value of trips on the diagonal, e.g. from zone 1 to zone 1, is zero since no intra-zonal trip occurs. Work trip distribution is the way that travel demand models understand how people take jobs. There are trip distribution models for other (non-work) activities such as the choice of location for grocery shopping, which follow the same structure. At this point in the transportation planning process, the information for zonal interchange analysis is organized in an origin-destination table. On the left is listed trips produced in each zone. Along the top are listed the zones, and for each zone we list its attraction. The table is n x n, where n = the number of zones. Each cell in our table is to contain the number of trips from zone i to zone j. We do not have these within-cell numbers yet, although we have the row and column totals. With data organized this way, our task is to fill in the cells for tables headed t = 1 through say t = n. Actually, from home interview travel survey data and attraction analysis we have the cell information for t = 1. The data are a sample, so we generalize the sample to the universe. The techniques used for zonal interchange analysis explore the empirical rule that fits the t = 1 data. That rule is then used to generate cell data for t = 2, t = 3, t = 4, etc., to t = n. The first technique developed to model zonal interchange involves a model such as this: T_{ij} = T_i\frac{{A_j f\left( {C_{ij} } \right)K_{ij} }} {{\sum_{j' = 1}^n {A_{j'} f\left( {C_{ij'} } \right)K_{ij'} } }} where: T_{ij} : trips from i to j. T_i : trips from i, as per our generation analysis A_j : trips attracted to j, according to generation analysis f(C_{ij}) : travel cost friction factor, say = C_{ij}^b K_{ij} : Calibration parameter Zone i generates T i trips; how many will go to zone j? That depends on the attractiveness of j compared to the attractiveness of all places; attractiveness is tempered by the distance a zone is from zone i. We compute the fraction comparing j to all places and multiply T ;i by it. The rule is often of a gravity form: T_{ij} = a\frac where: P_i; P_j : populations of i and j a; b : parameters C_{ij} : travel cost (e.g. distance, money, time) But in the zonal interchange mode, we use numbers related to trip origins (T ;i ) and trip destinations (T ;j ) rather than populations. There are many model forms because we may use weights and special calibration parameters, e.g., one could write say: T_{ij} = a\frac or T_{ij} = \frac where: a, b, c, d are parameters C_{ij} : travel cost (e.g. distance, money, time) T_j : inbound trips, destinations T_i : outbound trips, origin T_{ij} = K_i K_j T_i T_j f(C_{ij} ) \sum_j {T_{ij} = T_i } ,\sum_i {T_{ij} = T_j } K_i = \frac{1} {{\sum_j {K_j T_j f(C_{ij} )} }},K_j = \frac{1} {{\sum_i {K_i T_i f(C_{ij} )} }} where T_{ij} = Trips between origin i and destination j T_i = Trips originating at i T_j = Trips destined for j C_{ij} = travel cost between i and j K_i, K_j = balancing factors solved iteratively. See Iterative proportional fitting. f = distance decay factor, as in the accessibility model It is doubly constrained, in the sense that for any i the total number of trips from i predicted by the model always (mechanically, for any parameter values) equals the real total number of trips from i. Similarly, the total number of trips to j predicted by the model equals the real total number of trips to j, for any j. w\left( {T_{ij} } \right) = \frac = 1260 where 0! = 1. That configuration can appear in 1,260 ways. We have calculated the number of ways that configuration of trips might have occurred, and to explain the calculation, let’s recall those coin tossing experiments talked about so much in elementary statistics. The number of ways a two-sided coin can come up is 2^n , where n is the number of times we toss the coin. If we toss the coin once, it can come up heads or tails, 2^1 = 2 . If we toss it twice, it can come up HH, HT, TH, or TT, four ways, and 2^2 = 4 . To ask the specific question about, say, four coins coming up all heads, we calculate 4!/(4!0!) = 1 . Two heads and two tails would be 4!/(2!2!) = 6 . We are solving the equation: w = \frac An important point is that as n gets larger, our distribution gets more and more peaked, and it is more and more reasonable to think of a most likely state. However, the notion of most likely state comes not from this thinking; it comes from statistical mechanics, a field well known to Wilson and not so well known to transportation planners. The result from statistical mechanics is that a descending series is most likely. Think about the way the energy from lights in the classroom is affecting the air in the classroom. If the effect resulted in an ascending series, many of the atoms and molecules would be affected a lot and a few would be affected a little. The descending series would have many affected not at all or not much and only a few affected very much. We could take a given level of energy and compute excitation levels in ascending and descending series. Using the formula above, we would compute the ways particular series could occur, and we would conclude that descending series dominate. That is more-or-less Boltzmann's Law, p_j = p_0 e^{\beta e_j } That is, the particles at any particular excitation level j will be a negative exponential function of the particles in the ground state, p_0 , the excitation level, e_j , and a parameter \beta , which is a function of the (average) energy available to the particles in the system. The two paragraphs above have to do with ensemble methods of calculation developed by Gibbs, a topic well beyond the reach of these notes. Returning to the O-D matrix, note that we have not used as much information as we would have from an O and D survey and from our earlier work on trip generation. For the same travel pattern in the O-D matrix used before, we would have row and column totals, i.e.: Consider the way the four folks might travel, 4!/(2!1!1!) = 12; consider three folks, 3!/(0!2!1!) = 3. All travel can be combined in 12×3 = 36 ways. The possible configuration of trips is, thus, seen to be much constrained by the column and row totals. We put this point together with the earlier work with our matrix and the notion of most likely state to say that we want to \max w\left( {T_{ij} } \right) = \frac {{\prod_{ij} {T_{ij}!} }} subject to \sum_j {T_{ij} = T_i } ; \sum_i {T_{ij} = T_j } where: T = \sum_j {\sum_i {T_{ij} } } = \sum_i {T_i } = \sum_j {T_j } and this is the problem that we have solved above. Wilson adds another consideration; he constrains the system to the amount of energy available (i.e., money), and we have the additional constraint, \sum_i {\sum_j {T_{ij} C_{ij} = C} } where C is the quantity of resources available and C_{ij} is the travel cost from i to j. The discussion thus far contains the central ideas in Wilson’s work, but we are not yet to the place where the reader will recognize the model as it is formulated by Wilson. First, writing the \Lambda function to be maximized using Lagrangian multipliers, we have: \Lambda(T_{ij},\lambda_i,\lambda_j) = \frac + \sum_i {\lambda _i \left( {T_i - \sum_j {T_{ij} } } \right)} + \sum_j {\lambda _j \left( {T_j - \sum_i {T_{ij} } } \right) + \beta \left( {C - \sum_i {\sum_j {T_{ij} C_{ij} } } } \right)} where \lambda_i, \lambda_j and \beta are the Lagrange multipliers, \beta having an energy sense. Second, it is convenient to maximize the natural log (ln) rather than w(T_{ij}) , for then we may use Stirling's approximation. \ln N! \approx N\ln N - N so \frac \approx \ln N Third, evaluating the maximum, we have \frac \ln T_{ij} = - \lambda _i - \lambda _j - \beta C_{ij} T_{ij} = e^{ - \lambda _i - \lambda _j - \beta C_{ij} } Finally, substituting this value of T_{ij} back into our constraint equations, we have: \sum_j {e^{ - \lambda _i - \lambda _j - \beta C_{ij} } } = T_i; \sum_i {e^{ - \lambda _i - \lambda _j - \beta C_{ij} } } = T_j and, taking the constant multiples outside of the summation sign e^{ - \lambda _i } = \frac {{\sum_j {e^{ - \lambda _j - \beta C_{ij} } } }};e^{ - \lambda _j } = \frac {{\sum_i {e^{ - \lambda _i - \beta C_{ij} } } }} Let \frac T_{ij} = A_i B_j T_i T_j e^{ - \beta C_{ij} } which says that the most probable distribution of trips has a gravity model form, T_{ij} is proportional to trip origins and destinations. The constants A_i , B_j , and \beta ensure that constraints are met. Turning now to computation, we have a large problem. First, we do not know the value of C, which earlier on we said had to do with the money available, it was a cost constraint. Consequently, we have to set \beta to different values and then find the best set of values for A_i and B_j . We know what \beta means – the greater the value of \beta , the less the cost of average distance traveled. (Compare \beta in Boltzmann's Law noted earlier.) Second, the values of A_i and B_j depend on each other. So for each value of \beta , we must use an iterative solution. There are computer programs to do this. Wilson's method has been applied to the Lowry model.
Footnotes
References
Allen, B. 1984 Trip Distribution Using Composite Impedance Transportation Research Record 944 pp. 118–127 Ben-Akiva M. and Lerman S. 1985 Discrete Choice Analysis, MIT Press, Cambridge MA Boyce, D., Lupa, M. and Zhang, Y.F. 1994 Introducing “Feedback” into the Four-Step Travel Forecasting Procedure vs. the Equilibrium Solution of a Combined Model presented at 73rd Annual Meeting of Transportation Research Board Haney, D. 1972 Consistency in Transportation Demand and Evaluation Models, Highway Research Record 392, pp. 13–25 1972 Hansen, W. G. 1959. How accessibility shapes land use. Journal of the American Institute of Planners, 25(2), 73–76. Heanue, Kevin E. and Pyers, Clyde E. 1966. A Comparative Evaluation of Trip Distribution Procedures, Levinson, D. and Kumar A. 1995. A Multi-modal Trip Distribution Model. Transportation Research Record #1466: 124–131. Portland MPO Report to Federal Transit Administration on Transit Modeling Reilly, W.J. (1929) “Methods for the Study of Retail Relationships” University of Texas Bulletin No 2944, Nov. 1929. Reilly, W.J., 1931. The Law of Retail Gravitation, New York. Ruiter, E. 1967 Improvements in Understanding, Calibrating, and Applying the Opportunity Model Highway Research Record No. 165 pp. 1–21 Stewart, J.Q. (1948) “Demographic Gravitation: Evidence and Application” Sociometry Vol. XI Feb.–May 1948 pp 31–58. Stewart, J.Q., 1947. Empirical Mathematical Rules Concerning the Distribution and Equilibrium of Population, Geographical Review, Vol 37, 461–486. Stewart, J.Q., 1950. Potential of Population and its Relationship to Marketing. In: Theory in Marketing, R. Cox and W. Alderson (Eds) ( Richard D. Irwin, Inc., Homewood, Illinois). Stewart, J.Q., 1950. The Development of Social Physics, American Journal of Physics, Vol 18, 239–253 Voorhees, Alan M., 1956, "A General Theory of Traffic Movement," 1955 Proceedings, Institute of Traffic Engineers, New Haven, Connecticut. Whitaker, R. and K. West 1968 The Intervening Opportunities Model: A Theoretical Consideration Highway Research Record 250 pp. 1–7 Wilson, A.G. A Statistical Theory of Spatial Distribution Models Transportation Research, Volume 1, pp. 253–269 1967 Wohl, M. 1963 Demand, Cost, Price and Capacity Relationships Applied to Travel Forecasting. Highway Research Record 38:40–54 Zipf, G. K., 1946. The Hypothesis on the Intercity Movement of Persons. American Sociological Review, vol. 11, Oct Zipf, G. K., 1949. Human Behaviour and the Principle of Least Effort. Massachusetts
Text derived from https://en.wikipedia.org/w/index.php?oldid=1336278973 under CC BY-SA 4.0; modifications have been made.