Skip to main content
Log in

Characteristics of optimal solutions to the sensor location problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The sensor location problem is that of locating the minimum number of traffic sensors at intersections of a road network such that the traffic flow on the entire network can be determined. In this paper, we provide a new necessary condition on the location of these sensors to enable the traffic flow throughout the network to be computed. This condition is not sufficient in general, but we show that for a large class of problem instances, the condition is sufficient. Many typical road networks are included in this category, and we show how our condition can be used to inform traffic sensor placement.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Bianco, L., Confessore, G., & Reverberi, P. (2001). A network based model for traffic sensor location with implications on O/D matrix estimates. Transportation Science, 35(1), 50–60.

    Article  Google Scholar 

  • Bianco, L., Confessore, G., & Gentili, M. (2006). Combinatorial aspects of the sensor location problem. Annals of Operations Research, 144(1), 201–234.

    Article  Google Scholar 

  • Chin, F., Chrobak, M., & Yan, L. (2009). Algorithms for placing monitors in a flow network. In Algorithmic aspects in information and management, Vol. 5564, Lecture Notes in Computer Science (pp. 114–128). Berlin, Heidelberg: Springer.

  • Gu, W., & Jia, X. (2005). On a traffic control problem. In: Proceedings of the 8th international symposium on parallel architectures, algorithms, and networks.

  • Lam, W., & Lo, H. (1990). Accuracy of O-D estimates from traffic counts. Traffic Engineering and Control, 31(6), 358–367.

    Google Scholar 

  • Suh, K., Guo, Y., Kurose, J., & Towsley, D. (2005). Locating network monitors: Complexity, heuristics, and coverage. In Proceedings of the 24th annual joint conference of the IEEE computer and communications societies, (Vol. 1, pp. 351–361).

  • Yang, H., & Zhou, J. (1998). Optimal traffic counting locations for origin-destination matrix estimation. Transportation Research Part B-Methodological, 32(2), 109–126.

    Article  Google Scholar 

  • Zhang, J., Zhang, X., Wu, J. (2007). Genetic simulated annealing algorithms for optimal deployment of flow monitors. In Proceedings of the 3rd international conference on natural computation, (Vol. 4, pp 398–402).

Download references

Acknowledgments

The authors would like to thank Dr. Lucio Bianco, Dr. Giuseppe Confessore, and Dr. Monica Gentili for communications and assistance regarding their previous work on the problem.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Susan E. Martonosi.

Additional information

This research was supported in part by the Department of Defense through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program. The views expressed in this paper are those of the authors and do not reflect the official policy or position of the the Department of Defense or the United States Government.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Morrison, D.R., Martonosi, S.E. Characteristics of optimal solutions to the sensor location problem. Ann Oper Res 226, 463–478 (2015). https://doi.org/10.1007/s10479-014-1638-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-014-1638-y

Keywords

Navigation