01557317

Component

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.

This paper was sponsored by TRB committee ADB30 Transportation Network Modeling.

01550057

15-3529

English

19p

2015

Transportation Research Board 94th Annual Meeting

Digital/other

Figures; References; Tables

Algorithms; Location; Networks; Optimization; Sensors; Traffic flow; Traffic flow theory; Turning traffic

Highways; Planning and Forecasting; I71: Traffic Theory; I72: Traffic and Transport Planning

Transportation Research Board Annual Meeting 2015 Paper #15-3529

TRIS, TRB, ATRI

Dec 30 2014 1:10PM