Network Sensor Location Problem for Traffic Flow Derivation Based on Turning Ratios

The network sensor location problem (NSLP) discussed in this paper is to find the minimum number and locations of counting points so that all the traffic flows in the network can be inferred. Using turning ratios as the prior information, the flow conservation system is formulated. By proving the coefficient matrix of the flow conservation system nonsingular, the minimal number of counting points is determined to be the total number of exclusive incoming roads and dummy roads, which are added into the network to represent the trips generated on real roads. So, the task of NSLP model based on turning ratios is only to determine the optimal sensor location. Analysis shows that placing sensors on all the exclusive incoming roads and dummy roads can always generate a unique network flow vector for any network topology. From the view of feasibility in reality, a detection set composed of only real roads is proven to exist. Considering the roads importance and cost of the sensors, a weighted NSLP model to find the optimal detection set with maximal total weight is formulated. The proposed greedy algorithm is proven to be able to provide the optimal solution.

Language

  • English

Media Info

  • Media Type: Digital/other
  • Features: Figures; References; Tables;
  • Pagination: 19p
  • Monograph Title: TRB 94th Annual Meeting Compendium of Papers

Subject/Index Terms

Filing Info

  • Accession Number: 01557317
  • Record Type: Publication
  • Report/Paper Numbers: 15-3529
  • Files: TRIS, TRB, ATRI
  • Created Date: Mar 19 2015 12:06PM