01372927

Component

https://doi.org/10.3141/2283-07

http://scholar.google.com...dani&publication_year=2012

Static origin–destination (O-D) matrices that specify the number of trips from each origin to each destination are usually needed for several transportation planning and operations decisions. One approach to the estimation of an O-D matrix is to use data from traditional counting sensors on links in conjunction with models or assumptions on how vehicular traffic uses the network. A closely related problem is to locate a given number of counting sensors to obtain good estimates of O-D flows. In this paper, a new linear integer programming model for the placement of the sensors at a location to maximize the reduction in the uncertainties in route flows estimates is presented. The model assumes a general underlying traffic loading model, as long as the route choice set from each origin to each destination is known and prior route flows and their reliabilities for each O-D route are given. Extensive computational experiments and comparisons with some existing sensor location models indicate that the proposed model consistently gives good estimates of O-D flows.

01450929

12-2952

English

pp 67–73

2012

Transportation Research Record: Journal of the Transportation Research Board

9780309223232

Print

Figures; References; Tables

Integer programming; Location; Origin and destination; Sensors; Traffic estimation; Traffic flow; Traffic models

Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Feb 8 2012 5:13PM

• Algorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
• Application of Principal Component Analysis to Predict Dynamic Origin–Destination Matrices
• Case Study–Based Evaluation of Stochastic Multicommodity Emergency Inventory Management Model
• Demand and Supply Calibration of Dynamic Traffic Assignment Models: Past Efforts and Future Challenges
• Distance-Based Dynamic Pricing Strategy for Managed Toll Lanes
• Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application
• Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
• Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds
• Model for Optimization of Locations of Schools and Student Transportation in Rural Areas
• Path-Constrained Traffic Assignment: Model and Algorithm
• Stochastic Model for Estimation of Time-Varying Arterial Travel Time and Its Variability with Only Link Detector Data
• Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem: Computational Study
• Welfare Effects of Congestion Pricing and Transit Services in Multiclass Multimodal Networks