Author
Abstract
A spectrum of traffic engineering and modern transportation planning problems requires the knowledge of the underlying trip pattern, commonly represented by dynamic Origin- Destination (OD) trip tables. In view of the fact that direct survey of trip pattern is technically problematic and economically infeasible, there have been a great number of methods proposed in the literature for updating the existing OD tables from traffic counts and/or other data sources. Unfortunately, there remain several common theoretical and practical aspects which impact the estimation accuracy and limit the use of these methods from most real-world applications. This dissertation itemizes and examines these critical issues. Then, the dissertation presents the developments, evaluations, and applications of two new frameworks intended to be used with the current and near-future data, respectively. The first framework offers a systematic and practical procedure for preparing dynamic demand inputs for microscopic traffic simulation under planning applications with an estimation module based solely on traffic counts. Under this framework, the traditional planning model is augmented with a filter traffic simulation step, which captures important spatial-temporal characteristics of route and traffic patterns within a large surrounding network, to improve the flow estimates entering and leaving the final microscopic simulation network. A new bounded dynamic OD estimation model and a solution algorithm for solving a large problem are also proposed. The second framework utilizes additional information from small probe samples collected over multiple days. There are two steps under this framework. The first step includes a suite of empirical and hierarchical Bayesian models used in estimating time dependent travel time distributions, destination fractions, and route fractions from probe data. These models provide multi-level posterior parameters and tend to moderate extreme estimates toward the overall mean with the magnitude depending on their precision, thus overcoming several problems due to non-uniform (over time and space) small sampling rates. The second step involves a construction of initial OD tables, an estimation of route-link fractions via a Monte Carlo simulation, and an updating procedure using a new dynamic OD estimation formulation which can also take into account the stochastic properties of the assignment matrix.
Suggested Citation
Jintanakul, Klayut, 2009.
"Dynamic Demand Input Preparation for Planning Applications,"
University of California Transportation Center, Working Papers
qt0jf93827, University of California Transportation Center.
Handle:
RePEc:cdl:uctcwp:qt0jf93827
Download full text from publisher
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:cdl:uctcwp:qt0jf93827. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucbus.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.