Identification of vehicle sensor locations for link-based network traffic applications

Information on link flows in a vehicular traffic network is critical for developing long-term planning and/or short-term operational management strategies. In the literature, most studies to develop such strategies typically assume the availability of measured link traffic information on all network links, either through manual survey or advanced traffic sensor technologies. In practical applications, the assumption of installed sensors on all links is generally unrealistic due to budgetary constraints. It motivates the need to estimate flows on all links of a traffic network based on the measurement of link flows on a subset of links with suitably equipped sensors. This study, addressed from a budgetary planning perspective, seeks to identify the smallest subset of links in a network on which to locate sensors that enables the accurate estimation of traffic flows on all links of the network under steady-state conditions. Here, steady-state implies that the path flows are static. A "basis link" method is proposed to determine the locations of vehicle sensors, by using the link-path incidence matrix to express the network structure and then identifying its "basis" in a matrix algebra context. The theoretical background and mathematical properties of the proposed method are elaborated. The approach is useful for deploying long-term planning and link-based applications in traffic networks.

[1]  Shlomo Bekhor,et al.  Evaluation of choice set generation algorithms for route choice models , 2006, Ann. Oper. Res..

[2]  Michael G.H. Bell,et al.  The optimisation of traffic count locations in road networks , 2006 .

[3]  Enrique F. Castillo,et al.  Observability in linear systems of equations and inequalities: Applications , 2007, Comput. Oper. Res..

[4]  Srinivas Peeta,et al.  Generalized Singular Value Decomposition Approach for Consistent On-Line Dynamic Traffic Assignment , 1999 .

[5]  Chao Yang,et al.  Models and algorithms for the screen line-based traffic-counting location problems , 2006, Comput. Oper. Res..

[6]  Enrique F. Castillo,et al.  Traffic Estimation and Optimal Counting Location Without Path Enumeration Using Bayesian Networks , 2008, Comput. Aided Civ. Infrastructure Eng..

[7]  G. W. Stewart,et al.  Matrix Algorithms: Volume 1, Basic Decompositions , 1998 .

[8]  H. Anton.  Elementary Linear Algebra , 1970 .

[9]  J Bottom,et al.  Route guidance and information systems , 2001 .

[10]  Gang-Len Chang,et al.  Estimation of time-varying origin-destination distributions with dynamic screenline flows , 1996 .

[11]  Giuseppe Confessore,et al.  A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates , 2001, Transp. Sci..

[12]  Hani S. Mahmassani,et al.  Online consistency checking and origin-destination demand updating: Recursive approaches with real-time dynamic traffic assignment operator , 2005 .

[13]  Moshe E. Ben-Akiva,et al.  Estimation and Prediction of Time-Dependent Origin-Destination Flows with a Stochastic Mapping to Path Flows and Link Flows , 2002, Transp. Sci..

[14]  Enrique Castillo,et al.  Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations , 2008 .

[15]  Enrique F. Castillo,et al.  The Observability Problem in Traffic Network Models , 2008, Comput. Aided Civ. Infrastructure Eng..

[16]  Hai Yang,et al.  Traffic Counting Location and Error Bound in Origin-Destination Matrix Estimation Problems , 2005 .

[17]  Monica Gentili,et al.  Locating Active Sensors on Traffic Networks , 2005, Ann. Oper. Res..

[18]  M. Maher.  INFERENCES ON TRIP MATRICES FROM OBSERVATIONS ON LINK VOLUMES: A BAYESIAN STATISTICAL APPROACH , 1983 .

[19]  Gang-Len Chang,et al.  An integrated model for estimating time-varying network origin–destination distributions , 1999 .

[20]  Hai Yang,et al.  Optimal traffic counting locations for origin–destination matrix estimation , 1998 .

[21]  Hani S. Mahmassani,et al.  RECURSIVE APPROACHES FOR ONLINE CONSISTENCY CHECKING AND O-D DEMAND UPDATING FOR REAL- TIME DYNAMIC TRAFFIC ASSIGNMENT OPERATION , 2005 .

[22]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[23]  W. Greub.  Linear Algebra , 1981 .

[24]  Sang Nguyen,et al.  A unified framework for estimating or updating origin/destination matrices from traffic counts , 1988 .

[25]  Ennio Cascetta,et al.  Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts , 1993, Transp. Sci..

[26]  Enrique F. Castillo,et al.  The Observability Problem in Traffic Models: Algebraic and Topological Methods , 2008, IEEE Transactions on Intelligent Transportation Systems.