Traffic Counting Location and Error Bound in Origin-Destination Matrix Estimation Problems
Publication: Journal of Transportation Engineering
Volume 131, Issue 7
Abstract
Estimating origin-destination trip matrices from link traffic counts has been a subject of substantial research. It is well known that the accuracy of the resulting estimated origin-destination (O-D) matrix largely depends on the employed estimation approach itself, errors of the input data, and an appropriate set of links from which flow information should be collected. Previous studies have overwhelmingly focused on the development of various estimation models, while paying very limited attention to the traffic counting location and error bound issues. Recognizing their interdependence, this study makes a joint investigation of the traffic counting location, estimation method, and error bound in an integrated manner, while taking into account the effects of various route choice assumptions made in the traffic assignment models and the levels of traffic congestion on the network. A few useful properties of the counting location rules and error bound measures for the O-D matrix estimation problem are demonstrated theoretically and numerically.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The writers are grateful for the helpful comments of the anonymous reviewers on an earlier version of the paper. The research described in this paper was substantially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. HKUST6036/01E).
References
Bianco, L., Confessore, G., and Reverberi, P. (2001). “A network-based model for traffic sensor location with implications on O/D matrix estimates.” Transp. Sci., 35, 50–60.
Bierlaire, M. (2002). “The total demand scale: A new measure of quality for static and dynamic origin-destination trip tables.” Transportation Research B, 36, 837–850.
Erlander, S., and Stewart, N. (1990). The gravity model in transportation analysis: Theory and extensions, VSP, Utrecht, The Netherlands.
Gan, L., and Yang, H. (2001). “Integer programming model for optimal selection of screen lines in road networks.” Proc., 6th Conf., Hong Kong Society for Transportation Studies, Hong Kong, 122–130.
Horst, R., and Pardalos, P. (1995). Handbook of global optimization, Kluwer, Dordrecht, The Netherlands.
Sheffi, Y. (1985). Urban transportation networks: Equilibrium analysis with mathematical programming methods, Prentice-Hall, Englewood Cliffs, N.J.
Yang, H. (1995). “Heuristic algorithms for the bilevel origin-destination matrix estimation problem.” Transportation Research B, 29, 231–242.
Yang, H., Iida, Y., and Sasaki, T. (1991). “An analysis of the reliability of an origin-destination trip matrix estimated from traffic counts.” Transportation Research B, 25, 351–363.
Yang, H., Meng, Q., and Bell, M. G. H. (2001). “Simultaneous estimation of the origin-destination matrices and travel-cost coefficient for congested networks in a stochastic equilibrium.” Transp. Sci., 35, 107–123.
Yang, H., Sasaki, T., Iida, Y., and Asakura, Y. (1992). “Estimation of origin-destination matrices from link traffic counts on congested networks.” Transportation Research B, 26, 417–434.
Yang, H., Yang, C., and Gan, L. (2004). “Models and algorithms for the screen line based traffic counting location problems.” Comput. Oper. Res., in press.
Yang, H., and Zhou, J. (1998). “Optimal traffic counting locations for origin-destination matrix estimation.” Transportation Research B, 32, 109–126.
Information & Authors
Information
Published In
Copyright
© 2005 ASCE.
History
Received: Nov 4, 2003
Accepted: Sep 28, 2004
Published online: Jul 1, 2005
Published in print: Jul 2005
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.