Integrated Determination of Network Origin–Destination Trip Matrix and Heterogeneous Sensor Selection and Location Strategy

Shou-Ren Hu · Srinivas Peeta · Han-Tsung Liou

34 citations0/0 files storedIEEE Transactions on Intelligent Transportation Systems

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Traffic Prediction and Management Techniques

Abstract

This paper proposes a two-stage optimization model to determine the origin-destination (O-D) trip matrix and the heterogeneous sensor deployment strategy in an integrated manner for a vehicular traffic network using sensor information from active (camera-based license plate recognition) and passive (vehicle detector) sensors. The first stage solves the heterogeneous sensor selection and location problem to determine the optimal sensor deployment strategy, in terms of the selection of the numbers of the two sensor types and their installation locations, to maximize the traffic information available for the O-D matrix estimation problem. The traffic information includes the observed link flow, path trajectory, and path coverage information. The second stage leverages this traffic information to determine the network O-D matrix that minimizes the error between the observed and estimated traffic flows (link, O-D, and/or path). Correspondingly, two network O-D matrix estimation models are proposed where the link-based model incorporates the flow conservation rule between O-D and link flows and uses the link-node incidence matrix, and the path-based model assumes a given link-path incidence matrix. An iterative solution procedure is designed to determine the network O-D matrix and link flow estimates. Results from numerical experiments suggest that the path-based model outperforms the link-based model in the estimation of network O-D matrices. The relative contributions of combinations of the two sensor types to the network O-D matrix estimation problem are also analyzed. They suggest that active sensors provide valuable path information to solve the O-D matrix estimation problem, but at the cost of a significantly higher unit price. The study results have key implications for heterogeneous sensor selection and location strategies.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 34 citations exist upstream.

References

1980The most likely trip matrix estimated from traffic counts 1982Industrial and business forecasting methods : a practical guide to exponential smoothing and curve fitting 1984Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator 1983Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach 1992Estimation of origin-destination matrices from link traffic counts on congested networks 1987A maximum likelihood model for estimating origin-destination matrices 1998Optimal traffic counting locations for origin–destination matrix estimation 1995Heuristic algorithms for the bilevel origin-destination matrix estimation problem

Cited by

2022Exact and Heuristics Algorithms for Screen Line Problem in Large Size Networks: Shortest Path-Based Column Generation Approach 2020Distributing Portable Excess Speed Detectors in AL Riyadh City 2021Optimization of multi-type traffic sensor locations for estimation of multi-period origin-destination demands with covariance effects 2021An exact method for locating counting sensors in flow observability problems

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.