Advertisement

Annals of Operations Research

, Volume 226, Issue 1, pp 463–478 | Cite as

Characteristics of optimal solutions to the sensor location problem

  • David R. Morrison
  • Susan E. Martonosi
Article

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.

Keywords

Traffic flows Sensor location Transportation network design  Network flow Network optimization 

Notes

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.

References

  1. 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.CrossRefGoogle Scholar
  2. Bianco, L., Confessore, G., & Gentili, M. (2006). Combinatorial aspects of the sensor location problem. Annals of Operations Research, 144(1), 201–234.CrossRefGoogle Scholar
  3. 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.Google Scholar
  4. Gu, W., & Jia, X. (2005). On a traffic control problem. In: Proceedings of the 8th international symposium on parallel architectures, algorithms, and networks.Google Scholar
  5. Lam, W., & Lo, H. (1990). Accuracy of O-D estimates from traffic counts. Traffic Engineering and Control, 31(6), 358–367.Google Scholar
  6. 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).Google Scholar
  7. Yang, H., & Zhou, J. (1998). Optimal traffic counting locations for origin-destination matrix estimation. Transportation Research Part B-Methodological, 32(2), 109–126.CrossRefGoogle Scholar
  8. 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).Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.University of Illinois at Urbana-ChampaignUrbanaUSA
  2. 2.Harvey Mudd CollegeClaremontUSA

Personalised recommendations