IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v21y1987i5p359-393.html
   My bibliography  Save this article

Regularities and a descriptive algorithm of the trip to work distribution

Author

Listed:
  • Blechman, I.

Abstract

This paper presents the results of a study whose aim was to identify the actual regularities of the trip-to-work distribution and to apply them in an algorithm of trip prediction, using descriptive parameters instead of unknown control factors. It was shown that the observed trip length distributions (TLD), which reflect the probability of a trip to a t-radius ring of an urban area, may be approximated by multiplication of a basic probability of a trip to an infinitesimal area G(t) and attraction points masses M(t) in the ring. Using this relation, on the basis of actual TLD of 24 cities, a real shape of G(t) was obtained and it was established that it corresponds to the seminormal Gauss Law. It was found that in the base formula of trip demand beside the Gauss Law and the masses of interactive zones three important factors must be also taken into consideration for correct trip prediction: (a) the differences between zones' quality, (b) work zones' professional acceptability, and (c) the change of the part of walk in the intrazonal trip because of demand pressure. The influence of the differences in the quality of the origin-destination zones is quantitative estimated by a factor, which expresses an overlap of quality distributions of these two zones. It was shown that household income, which was taken to represent the zonal quality factor, can be simply described by the Rayleigh distribution, which gives an easy way for this overlap calculation. A technique for treatment by the two other factors is also proposed. Regarding the use of the account regularities, a basic descriptive model of iterative trip prediction was created and tested, with mathematical and numerical demonstration of its convergence. An important factor in the full algorithm of trip-to-work prediction is the starting value of the average distance T of the trips for entire urban area. Based on a study of T-response functions, a solution for calculation of the starting value of T for each transport mode was given. The descriptive algorithm of trip prediction complies with the following principles: (a) it is the same for all urban areas and all transport modes; (b) it is based on a unitary seminormal Gauss Law of trip density distribution; (c) it operates in each range of the distances for a discontinuous, nonhomogeneous, local unbalanced urban area and does not require data on trips in the past; (b) it is based on a minimal number of zonal descriptive macro-characteristics of the population, work places, and distances. The test of the established algorithm, carried out in the case of two cities at different periods with completely different social and transport systems, revealed good agreement between predicted and observed trips and showed that the diversity of the TLD pattern can be explained by the variety of the quality, of the professional acceptability, mode split and of the zonal mass scattering, without requiring different G(t) functions. Consequently, a real TLD cannot be described as a general algebraic function of distances, but can be predicted correctly.

Suggested Citation

  • Blechman, I., 1987. "Regularities and a descriptive algorithm of the trip to work distribution," Transportation Research Part B: Methodological, Elsevier, vol. 21(5), pages 359-393, October.
  • Handle: RePEc:eee:transb:v:21:y:1987:i:5:p:359-393
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(87)90036-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:21:y:1987:i:5:p:359-393. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.