A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
Transportation Science
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
Models and algorithms for the screen line-based traffic-counting location problems
Computers and Operations Research
Reliable Facility Location Design Under the Risk of Disruptions
Operations Research
Hi-index | 0.00 |
Sensor systems as critical components of a transportation network provide a variety of real-time traffic surveillance information for traffic management and control. The deployment of sensors significantly affects their overall surveillance effectiveness. This paper proposes a reliable sensor location model to optimize surveillance effectiveness when sensors are subject to site-dependent probabilistic failures, and a general effectiveness measure is proposed to encompass most existing measures needed for engineering practice e.g., flow volume coverage, vehicle-mile coverage, and squared error reduction. The problem is first formulated into a compact mixed-integer program, and we develop a variety of solution algorithms including a custom-designed Lagrangian relaxation algorithm and analyze their properties. We also propose alternative formulations including a continuum approximation model for single corridor problems and reliable fixed-charge sensor location models. Numerical case studies are conducted to test the performance of the proposed algorithms and draw managerial insights on how different parameter settings e.g., failure probability and spatial heterogeneity affect overall surveillance effectiveness and the optimal sensor deployment.