Presenting a Basis Changing Approach for Locating the Transportation Network Sensors

The problem of locating a specified number of sensors in a transportation network in order to obtain the best estimates of the desired flows has been the stimulus of many researches in last three decades. Recent developments in ICT technologies applied in transportation have provided the practitioners and researchers with a good basis for new tools of flow measurements other than previously vast-applied traditional tools. Transportation networks, particularly urban networks comprises of many nodes and links which result in enormous number of paths used by urban travelers. On the other hand, financial and technical limitations prevent locating a sufficient number of sensors to cover the paths entirely and hence, fully observe the flows of interest. Thus, presenting simplified approaches for sensor location, which optimizes the flow estimation considering specified number of sensors, has found a crucial importance. This paper aims to introduce an algebraic basis change approach in ℜ vector space for network sensor location problem which, recognizes the best location set based on the maximum path coverage concept.