Applications of mathematical and computer modeling in the Sensor Location Problem

Abstract

We consider a real-world problem of constructing such a suboptimal solution of the problem of estimating homogeneous flow in a bidirectional network and guaranteeing that the network is fully monitored. Unlike the problem of finding the optimal solution which is NP-complete and has huge computational costs, the search for a suboptimal solution does not require to minimize the set of monitored network nodes. Our approach can be used for examining intelligent transportation systems and creating algorithms for solving Sensor Location Problem for a bidirectional graph. The sensors are placed in the graph nodes in order to estimate the homogeneous flow in the unmonitored part of the graph.