Strategies for selecting additional traffic counts for improving O-D trip table estimation

Transportmetrica

Volumn 3, Issue 3, 2007, Pages 191-211

  Chen, Anthony ^a   Pravinvongvuth, Surachet ^b   Chootinan, Piya ^c   Lee, Ming ^c   Recker, Will ^d  

^a Utah State University   (United States)

^b CAMBRIDGE SYSTEMATICS INC   (United States)

^c Bureau of Planning   (Thailand)

^d Irvine   (United States)

Author keywords

Integer program; Origin destination estimation; Path flow estimator; Route choice; Traffic counting location

Indexed keywords

EID: 49049111106     PISSN: 18128602     EISSN: None     Source Type: Journal    
DOI: 10.1080/18128600708685673     Document Type: Article

References (42)

1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, New Jersey.
2. Ashok, K. and Ben-Akiva, M.E. (1993) Dynamic origin-destination matrix estimation and prediction for real-time management systems. Proceedings of the 12th International Symposium on Transportation and Traffic Theory, Berkeley, California.
3. Bell, M.G.H., Shield, C.M., Busch, F., and Kruse, G. (1997) A stochastic user equilibrium path flow estimator. Transportation Research Part C, 5, 197-210.
4. Bell, M.G.H. (1984) The estimation of junction turning volumes from traffic counts: the role of prior information. Traffic Engineering and Control, 25, 279-283.
5. Bell, M.G.H. and Iida, Y. (1997) Transportation Network Analysis, John Wiley and Sons, Inc, New York.
6. Bell, M.G.H. and Shield, C.M. (1995) A log-linear model for path flow estimation. Proceedings of the 4th International Conference on the Applications of Advanced Technologies in Transportation Engineering, Carpi, Italy, pp. 695-699.
7. Bertsekas, D.P. (1998) Network Optimization: Continuous and Discrete Models, Athena Scientific, Belmont, Massachusetts.
8. Bianco, L., Confessore, G. and Reverberi, P. (2001) A network based model for traffic sensor location with implications on O/D matrix estimates. Transportation Science, 35, 50-60.
9. Cascetta, E. (1984) Estimation of origin-destination matrices from traffic counts and survey data: a generalized least squares estimator. Transportation Research Part B, 18, 289-299.
10. Ceylan, H. and Bell, M.G.H. (2004) Sensitivity analysis on stochastic equilibrium transportation networks using genetic algorithm. Journal of Advanced Transportation, 38, 291-321.
11. Chvatal, V. (1983) Linear Programming, W.H. Freeman and Company, New York.
12. Chen, A. and Chootinan, P. (2007) Handling inconsistency of traffic counts in path flow estimator. Proceedings of the 6th TRISTAN Conference, Phuket, Thailand.
13. Chen, A., Chootinan, P., and Recker, W.W. (2005) Examining the quality of synthetic origin-destination trip table estimated by path flow estimator. Journal of Transportation Engineering, 131, 506-513.
14. Chootinan, P., Chen, A. and Recker, W. (2004) Handling the inconsistency issue of traffic counts in path flow estimator. In Hai Yang and Hong K. Lo (eds.) Proceedings of the 9th Hong Kong Society of Transportation Studies Conference: Transportmetrica: Advanced Methods for Transportation Studies, Hong Kong, P.R. China, pp. 272-281.
15. Chootinan, P., Chen, A., and Recker, W. (2005a) Improved path flow estimator for estimating origin-destination trip tables. Transportation Research Record, 1923, 9-17.
16. Chootinan, P., Chen, A., and Yang, H. (2005b) A bi-objective traffic counting location problem for origin-destination trip table estimation. Transportmetrica, 1, 65-80.
17. City of St. Helena. (1993) General Plan, St. Helena, California.
18. Ehlert, A., Bell, M.G.H. and Grosso, S. (2006) The optimisation of traffic count locations in road networks. Transportation Research Part B, 40, 460-479.
19. Fisk, C. (1988) On combining maximum entropy trip matrix estimation with user equilibrium. Transportation Research Part B, 22, 69-73.
20. Garber, N.J. and Hoel, L.A. (1999) Traffic and Highway Engineering (Second Edition), PWS Publishing Company, Boston, Massachusetts.
21. Gan, L., Yang, H. and Wong, S.C. (2005) Traffic counting location and error bound in origin-destination matrix estimation problems. Journal of Transportation Engineering, 131, 524-534.
22. Gen, M., and Cheng, R. (2000) Genetic Algorithms and Engineering Optimization, John Wiley and Sons, Inc., New York.
23. Goldberg, D. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA.
24. Hazelton, M.L. (2000) Estimation of origin-destination matrices from link flows on uncongested networks. Transportation Research Part B, 34, 549-566.
25. ITE (1997) Trip Generation, Sixth Edition, Institute of Transportation Engineers, Washington D.C.
26. Lam, W.H.K. and Lo, H.P. (1990) Accuracy of O-D estimates from traffic counts. Traffic Engineering and Control, 31, 358-367.
27. Maher, M. (1983) Inferences on trip matrices from observations on link volumes: a Bayesian statistical approach. Transportation Research Part B, 17, 435-447.
28. Maher, M., Zhang, X., and Van Vliet, D. (2001) A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows. Transportation Research Part B, 35, 23-40.
29. Megiddo, N., Zemel, E, and Hakimi, S. (1983) The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods, 4, 253-261.
30. Meng, Q., Lee, D.H. and Cheu, R.L. (2005) Counting the different efficient paths for transportation networks and its applications. Journal of Advanced Transportation, 39, 193-220.
31. Patriksson, M. (1994) The Traffic Assignment Problem-Models and Methods, VSP, Utrecht, The Netherlands.
32. Sherali, H.D., Sivanandan, R., and Hobeika, A.G. (1994) A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes. Transportation Research Part B, 28, 213-234.
33. Spiess, H. (1987) A maximum likelihood model for estimating origin-destination matrices. Transportation Research Part B, 21, 395-412.
34. Van Zuylen, H.J. and Willumsen, L.G. (1980) The most likely trip estimated from traffic counts. Transportation Research Part B, 14, 281-293.
35. Yang, C., Chootinan, P. and Chen, A. (2003) Traffic counting location planning using genetic algorithms. Journal of Eastern Asia Society for Transportation Studies, 5, 898-913.
36. Yang, H. (1995) Heuristic algorithms for the bi-level origin-destination matrix estimation algorithm. Transportation Research Part B, 29, 231-242.
37. Yang, H. and Zhou, J. (1998) Optimal traffic counting locations for origin-destination matrix estimation. Transportation Research Part B, 32, 109-126.
38. 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 Part B, 25, 351-363.
39. Yang, H., Iida, Y., and Sasaki, T. (1992) Estimation of origin-destination matrices from traffic counts on congested networks. Transportation Research Part B, 26, 417-434.
40. Yang, H., Gan, L. and Tang, W.H. (2001) Determining cordons and screen lines for origin-destination trip studies. Proceedings of the 3rd Eastern Asia Society for Transportation Studies, Hanoi, Vietnam, pp. 85-99.
41. Yang, H., Yang, C., and Gan, L. (2005) Models and algorithms for the screen-line-based traffic counting location problem. Computers and Operations Research, 33, 836-858.
42. Yim, P.K.N. and Lam, W.H.K. (1998) Evaluation of count location selection methods for estimation of O-D matrices. Journal of Transportation Engineering, 124, 376-383.