Improving the Estimation of Travel Demand for Traffic Simulation: Part II
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Improving the Estimation of Travel Demand for Traffic Simulation: Part II
Authors
Published Date
2004-12
Publisher
Type
Abstract
This report examined several methods for estimating Origin- Destination (OD) matrices for freeways using loop detector data. Least squares based methods were compared in terms of both off- line and on- line estimation. Simulated data and observed data were used for evaluating the static and recursive estimators. For off- line estimation, four fully constrained least squares methods were compared. The results showed that the variations of a constrained least squares approach produced more efficient estimates. For on- line estimation, two recursive least squares algorithms were examined. The first method extends Kalman Filtering to satisfy the natural constraints of the OD split parameters. The second was developed from sequential quadratic programming. These algorithms showed different capabilities to capture an abrupt change in the split parameters. Practical recommendations of the choice of different algorithms are given.
Keywords
Description
Replaces
License
Collections
Series/Report Number
Funding information
ITS Institute
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
CTS 04-11, Part II
Suggested citation
Wu, Yao; Davis, Gary; Levinson, David. (2004). Improving the Estimation of Travel Demand for Traffic Simulation: Part II. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/808.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.