TRAFFIC SENSOR LOCATION AND ORIGIN/DESTINATION MATRIX ESTIMATION

In our previous work (Bianco et al., 1997a, 1997b), we introduced and solved the sensor location problem (SLP). Thus, we derived the complete traffic flow vector in a transport network based on the measurements provided by a minimal-cost set of counting points that are located by solving a suitable binary integer linear programming model. We proposed a number of greedy heuristics that determine lower and upper bounds on the number of traffic sensors. Moreover, we performed numerical simulations on different classes of randomly generated networks, showing that the developed heuristics achieve good performances.