Real-Time Dynamic Origin-Destination Matrix Adjustment with Simulated and Actual Link Flows in Urban Networks
Abstract
The efficiency and robustness of different real-time dynamic origin–destination (O-D) matrix adjustment algorithms were investigated when implemented in large-scale transportation networks. The proposed algorithms produce time-dependent O-D trip matrices based on the maximum-entropy trip departure times with simulated and actual observed link flows. Implementation of the algorithms, which are coupled with a quasi-dynamic traffic assignment model, indicated their convergent behavior and their potential for handling realistic urban-scale network problems in terms of both accuracy and computational time. The main factors influencing the numerical performance of each algorithm were identified and analyzed. Their relative efficiency was found to be particularly dependent on the level at which the assigned flows approximate the observed link flows. These results may provide insights into the suitability of each algorithm for diverse application domains, including freeways, small networks, and large-scale urban networks, where a different quality of O-D information is usually available.
Get full access to this article
View all access and purchase options for this article.
References
1. Tatineni M. R., Lupa M. R., Englund D. B., and Boyce D. E. Transportation Policy Analysis Using a Combined Model of Travel Choice. In Transportation Research Record 1452, TRB, National Research Council, Washington, D.C., 1994, pp. 10–17.
2. Ben-Akiva M., Bierlaire M., Koutsopoulos H. N., and Mishalani R. DynaMIT: A Simulation-Based System for Traffic Prediction and Guidance Generation. Proc., TRISTAN III. San Juan, Puerto Rico, 1998.
3. Chang T-H., and Li Z-Y. Optimization of Mainline Traffic Via an Adaptive Coordinated Ramp-Metering Control Model with Dynamic OD Estimation. Transportation Research C, Vol. 10, No. 2, 2002, pp. 99–120.
4. Cremer M., and Keller H. A New Class of Dynamic Methods for the Identification of Origin-Destination Flows. Transportation Research B, Vol. 21, No. 2, 1987, pp. 117–132.
5. Chang G. L., and Wu J. Recursive Estimation of Time-Varying Origin-Destination Flows from Traffic Counts in Freeway Corridors. Transportation Research B, Vol. 28, 1994, pp. 141–160.
6. Ziliaskopoulos A. K., and Peeta S. Review of Dynamic Traffic Assignment Models. Networks and Spatial Economics, Vol. 1, 2001, pp. 233–267.
7. Stathopoulos A., Polak J., Tillis A., Mitropoulos S., and Ryan B. Parking Management and Control. Advanced Telematics in Road Transport, Vol. 1: Proceedings of the DRIVE Conference, Brussels, Belgium, Feb. 4–6, 1991, Elsevier, Oxford, 1991.
8. PARCMAN. Parking Management, Control and Information System. Final Report, The PARCMAN Consortium, Athens, 1992.
9. Lamond B., and Stewart N. F. Bregman’s Balancing Method. Transportation Research B, Vol. 15, 1981, pp. 239–248.
10. Bregman L. The Relaxation Method of Finding the Common Point of Convex Sets and Its Application to the Solution of Problems in Convex Programming. USSR Computational Mathematics and Mathematical Physics, Vol. 7, 1967, pp. 200–217.
11. Murchland J. D. The Multi-Proportional Problem. Research Note JDM-263, University College London, London, 1977.
12. Van Zuylen H. J., and Willumsen L. G. The Most Likely Trip Matrix Estimated from Traffic Counts. Transportation Research B, Vol. 14, No. 4, 1980, pp. 281–293.
13. Janson B. N., and Southworth F. Estimating Departure Times from Traffic Counts Using Dynamic Assignment. Transportation Research B, Vol. 26, No. 1, 1992, pp. 3–16.
14. Gordon R., Bender R., and Hermann G. T. Algebraic Reconstruction Techniques (ART) for Three-Dimensional Electron Microscopy and X-Ray Photography. Journal of Theoretical Biology, Vol. 29, 1970, pp. 471–481.
15. Darroch J. N., and Ratcliff D. Generalised Iterative Scaling for Log-Linear Models. Annals of Mathematical Statistics, Vol. 43, 1972, pp. 1470–1480.
16. Schneider M. H., and Zenios S. A. A Comparative Study of Algorithms for Matrix Balancing. Operations Research, Vol. 38, No. 3, 1990, pp. 439–455.
17. Leurent F. Dual Solution of the Multiproportional Problem. Proc., 6th Meeting of the EURO Working Group on Transportation, Gothenburg, Sweden, Sept. 9–11, 1998.
18. Wu J. A Real-Time Origin-Destination Matrix Updating Algorithm for On-Line Applications. Transportation Research B, Vol. 31, No. 5, 1997, pp. 381–396.
19. Hall M., Van Vliet D., and Willumsen L. SATURN—A Simulation-Assignment Model for the Evaluation of Traffic Management Schemes. Traffic Engineering and Control, No. 4, 1980.
20. Van Vliet D. Improved Shortest Path Algorithm for Transport Networks. Transportation Research, Vol. 12, 1978, pp. 7–20.
21. Willumsen L. G. Estimating Time-Dependent Trip Matrices from Traffic Counts. Proc., 9th International Symposium on Transportation and Traffic Theory (Volmüller J. and Hamerslag R., eds.), VNU Science Press, Utrecht, 1984.
22. Taylor N. B. CONTRAM5: An Enhanced Traffic Assignment Model. TRRL Research Report 241. Transport and Road Research Laboratory, Department of the Environment, Crowthorne, Berkshire, U.K., 1990.
Cite article
Cite article
Cite article
OR
Download to reference manager
If you have citation software installed, you can download article citation data to the citation manager of your choice
Information, rights and permissions
Information
Published In
Article first published: January 2003
Issue published: January 2003
Authors
Metrics and citations
Metrics
Journals metrics
This article was published in Transportation Research Record: Journal of the Transportation Research Board.
VIEW ALL JOURNAL METRICSArticle usage*
Total views and downloads: 17
*Article usage tracking started in December 2016
Altmetric
See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores
Articles citing this one
Receive email alerts when this article is cited
Web of Science: 0
Crossref: 22
- Estimating urban freight flow using limited data: The case of Delhi, I...
- A Multiclass Tour Flow Model and Its Role in Multiclass Freight Tour S...
- Semi-dynamic Markovian path flow estimator considering the inconsisten...
- Time Coefficient Estimation for Hourly Origin-Destination Demand from ...
- HOURLY OD FLOW ESTIMATION FROM OBSERVED TRAFFIC FLOWS BASED ON TIME CO...
- An optimization method for sustainable traffic control in urban areas
- Urban metabolism and climate change: A planning support system
- Testing Traffic Control Strategies in Gaborone Using Dynamic Traffic A...
- Using O–D matrices for decision making in road network management
- Urban CO2 Planning: A Decision Support System
- Dynamic OD Estimation under Automated Vehicle Identification Environme...
- Efficient Methodology for Benchmarking Dynamic Origin–Destination Dema...
- A Novel OD Estimation Method Based on Automatic Vehicle Identification...
- Towards a Planning Decision Support System for Low-Carbon Urban Develo...
- Updating Dynamic Origin-destination Matrices using Observed Link Trave...
- Treating Uncertain Demand Information in Origin–Destination Matrix Est...
- PRELIMINARY ANALYSIS ON UPDATING DYNAMIC ORIGIN-DESTINATION MATRICES U...
- Gravity models for dynamic transport planning: Development and impleme...
- Methodology for Validating Dynamic Origin–Destination Matrix Estimatio...
- Quasidynamic Network Assignment Procedure with Transient Demand Matric...
- Enhanced Dynamic Origin-Destination Matrix Updating with Long-Term Flo...
- Combined Genetic Computation of Microscopic Trip Demand in Urban Netwo...
Figures and tables
Figures & Media
Tables
View Options
Get access
Access options
If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:
loading institutional access options
Alternatively, view purchase options below:
Purchase 24 hour online access to view and download content.
Access journal content via a DeepDyve subscription or find out more about this option.
