Allocation of link flow detectors for origin-destination matrix estimation - A Comparative Study

Computer-Aided Civil and Infrastructure Engineering

Volumn 25, Issue 2, 2010, Pages 116-131

  Larsson, Torbjörn ^a   Lundgren, Jan T ^a   Peterson, Anders ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION METHODS; COMPARATIVE STUDIES; EXPERIMENTAL ENVIRONMENT; LINK-FLOW; MATRIX; NETWORK MODELING; ORIGIN-DESTINATION MATRIX; ORIGIN-DESTINATION MATRIX ESTIMATION; SIOUX FALLS; TRAFFIC NETWORKS; TRAFFIC PLANNING;

DETECTORS;

COMPARATIVE STUDY; DETECTION METHOD; ESTIMATION METHOD; MATRIX; NUMERICAL MODEL; PLANNING METHOD; TRAFFIC MANAGEMENT; TRANSPORTATION PLANNING;

EID: 73949109386     PISSN: 10939687     EISSN: 14678667     Source Type: Journal    
DOI: 10.1111/j.1467-8667.2009.00625.x     Document Type: Article

References (30)

1. Bazaraa M S, Sherali H D, Shetty C M. Nonlinear Programming: Theory and Algorithms 1993, 2nd edn, Wiley, New York
2. Bell M G H, Iida Y. Transportation Network Analysis 1997, Wiley, West Sussex, United Kingdom
3. Bianco L, Confessore G, Reverberi P. A network based model for traffic sensor location with implications on o/d matrix estimation. Transportation Science 2001, 35:50-60.
4. Cascetta E. Transportation Systems Engineering: Theory and Methods 2001, Kluwer Academic Publishers, Dordrecht, the Netherlands
5. Castillo E, Menéndez J M, Jiménez P. Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations. Transportation Research B 2008a, 42:455-81.
6. Castillo E, Menéndez J M, Sánchez-Cambronero S. Traffic estimation and optimal counting location without path enumeration using Bayesian networks. Computer-Aided Civil and Infrastructure Engineering 2008b, 23:189-207.
7. Chen A, Pravinvongvuth S, Chootinan P, Lee M, Recker W. Strategies for selecting additional traffic counts for improving o-d trip table estimation. Transportmetrica 2007, 3:191-211.
8. Chootinan P, Chen A, Yang H. A bi-objective traffic counting location problem for origin-destination trip table estimation. Transportmetrica 2005, 1:65-80.
9. Confessore G, Dell'Olmo P, Gentili M. Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. Computers and Operations Research 2005, 32:2583-405.
10. Dial R B. A probabilistic multipath assignment model which obviates path enumeration. Transportation Research 1971, 5:83-111.
11. Edwards H. Traffic Assignment Analysis and o/d Matrix Calibration, Report. 2000, KFB & VTI Forskning/Research 32, Kommunikationsforskningsberedningen, Stockholm, Sweden
12. Ehlert A, Bell M G H, Grosso S. The optimisation of traffic count locations in road networks. Transportation Research B 2006, 40:460-79.
13. Gan L, Yang H, Wong S C. Traffic counting location and error bound in origin-destination matrix estimation problems. Journal of Transportation Engineering 2005, 131:524-34.
14. Gentili M, Mirchandani P B. Locating active sensors on traffic networks. Annals of Operations Research 2005, 136:229-57.
15. Hodgson M J. A flow-capturing location-allocation model. Geographical Analysis 1990, 22:270-9.
16. CNTPOST: A macro for optimal locations of count posts, Emme/2 News Number 10-October 1990. 1990, http://emme2.spiess.ch/e2news/, INRO, available at, accessed on August 21, 2009
17. Lam W H K, Lo H P. Accuracy of o-d estimates from traffic counts. Traffic Engineering and Control 1990, 31:358-67.
18. Larsson T, Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science 1992, 26:4-17.
19. Larsson T, Patriksson M, Rydergren C. A column generation procedure for the side constrained traffic equilibrium problem. Transportation Research B 2004, 38:17-38.
20. LeBlanc L J, Morlok E K, Pierskalla W P. An efficient approach to solving the road network equilibrium traffic assignment problem. Transportation Research 1975, 9:309-18.
21. Logie M, Hynd A. MVESTM matrix estimation. Traffic Engineering and Control 1990, 31:454-9.
22. Lotito P, Mancinelli E, Quadrat J P, Wynter L. The single class traffic assignment toolbox of Scilab: Ciudadsim. 2009, http://www-rocq.inria.fr/metalau/ciudadsim/, User's manual, available at, last updated January 12, 2009, accessed on August 21, 2008
23. Meng Q, Lee D-H, Cheu R L. Counting the different efficient paths for transportation networks and its applications. Journal of Advanced Transportation 2005, 39:193-220.
24. Ortúzar J de D, Willumsen L G. Modeling Transport 2001, 3rd edn, Wiley, West Sussex, United Kingdom
25. Patriksson M. The Traffic Assignment Problem-Models and Methods 1994, VSP, Utrecht, the Netherlands
26. Tatineni M, Edwards H, Boyce D. Comparison of disaggregate simplicial decomposition and Frank-Wolfe algorithms for user-optimal route choice. Transportation Research Record 1998, 1617:157-62.
27. Yang H, Iida Y, Sasaki T. An analysis of the reliability of an origin-destination trip matrix estimated from traffic counts. Transportation Research B 1991, 25:351-63.
28. Yang H, Yang C, Gan L. Models and algorithms for the screen line-based traffic-counting location problems. Computers and Operations Research 2006, 33:836-58.
29. Yang H, Zhou J. Optimal traffic counting locations for origin-destination matrix estimation. Transportation Research B 1998, 32:109-126.
30. Yim P K N, Lam W H K. Evaluation of count location selection methods for estimation of o-d matrices. Journal of Transportation Engineering 1998, 124:376-83.