A Grid Travel Time Model

Edward A. Beimborn
Additional contact information
Edward A. Beimborn: Department of Systems-Design, University of Wisconsin, Milwaukee, Wisconsin

Transportation Science, 1970, vol. 4, issue 2, 123-137

Abstract: A model is developed to determine travel times between points in an urban area with a limited amount of input. The model uses a network consisting of grid shaped links and high speed, freeway links. The travel time over the grid shaped links is computed internally using a macroscopic description of travel velocities and paths. A minimum time algorithm is applied to the network to find the minimum travel times between all points in the network. A test of the procedure showed that the results of the grid travel time model closely agreed with travel times produced by the standard detailed network method. The grid model uses substantially less input and performs its computations in a very short period of time. It is possible to develop a model that closely agrees with the detailed network model with even greater simplification. The procedure developed seems to have promise for a number of applications in the transportation planning process.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.4.2.123 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:4:y:1970:i:2:p:123-137

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().