Improved Path Flow Estimator for Origin-Destination Trip Tables

Piya Chootinan · Anthony Chen · Will W. Recker

39 citations0/0 files storedTransportation Research Record Journal of the Transportation Research Board

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

Path flow estimator (PFE) is a one-stage network observer that can estimate path flows and path travel times from traffic counts in a transportation network. Because a unique set of path flows is readily available from the PFE, a trip table can be estimated by simply adding up flows on all the paths connecting individual origin–destination (O-D) pairs. In this paper, the effects of the number and locations of traffic counts on the quality of the O-D trip table estimated by PFE are examined. The set-covering model, studied in the location theory, is applied to determine the minimum number of traffic counts and their corresponding locations required to observe the total demand of the study network. Next, the effects of the error bounds used in PFE to handle the inconsistency problem of traffic counts are examined, and a heuristic using the Lagrange multipliers to facilitate the adjustment of such error bounds is provided. Numerical results show that PFE can correctly estimate the total demand of the study area if a sufficient number of traffic counts collected at appropriate locations is provided. The results further indicate that improper specification of the error bounds could lead to biased estimation of total demand utilizing the network.

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 — 39 citations exist upstream.

References

1980The most likely trip matrix estimated from traffic counts 1997Transportation Network Analysis 1984Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator 1980Some developments in equilibrium traffic assignment 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 1991The estimation of origin-destination matrices by constrained generalised least squares

Cited by

2010L∞-Norm Path Flow Estimator for Handling Traffic Count Inconsistencies: Formulation and Solution Algorithm 2014A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints 2015Considering perception errors in network efficiency measure: an application to bridge importance ranking in degradable transportation networks 2011Confidence interval estimation for path flow estimator 2016

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.