| We study a sensor location problem that minimizes the total number of sensors to install at road intersections in a transportation network so that the traffic flows on the entire network are uniquely determined. We employ the concepts of hidden network and incremental flow in analyzing the problem, and propose a genetic algorithm for its solution for large-size networks. The algorithm is programmed in Matlab and tested on randomly generated network. Numerical results suggest the algorithm is efficient. |
