Improved Path Flow Estimator for Origin

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.

Get full access to this article

View all access options for this article.

References

Van Zuylen

H. J.

and Willumsen

L. G.

The Most Likely Trip Estimated from Traffic Counts. Transportation Research B, Vol. 14, 1980, pp. 281–293.

Cascetta

Estimation of Origin-Destination Matrices from Traffic Counts and Survey Data: A Generalized Least Squares Estimator. Transportation Research B, Vol. 18, 1984, pp. 289–299.

Spiess

A Maximum Likelihood Model for Estimating Origin-Destination Matrices. Transportation Research B, Vol. 21, 1987, pp. 395–412.

Fisk

Trip Matrix Estimation from Link Traffic Counts: The Congested Case. Transportation Research B, Vol. 23, 1989, pp. 245–250.

Yang

Iida

and Sasaki

Estimation of Origin-Destination Matrices from Traffic Counts on Congested Networks. Transportation Research B, Vol. 26, 1992, pp. 417–434.

Ashok

and Ben-Akiva

M. E.

Dynamic Origin-Destination Matrix Estimation and Prediction for Real-Time Management Systems. Proc., 12th International Symposium on Transportation and Traffic Theory, Berkeley, Calif., 1993.

Sherali

H. D.

Sivanandan

and Hobeika

A. G.

A Linear Programming Approach for Synthesizing Origin-Destination Trip Tables from Link Traffic Volumes. Transportation Research B, Vol. 28, 1994, pp. 213–234.

Bell

M. G. H.

and Shield

C. M.

A Log-Linear Model for Path Flow Estimation. Proc., 4th International Conference on the Applications of Advanced Technologies in Transportation Engineering, Capri, 1995, pp. 695–699.

Hazelton

M. L.

Estimation of Origin-Destination Matrices from Link Flows on Uncongested Networks. Transportation Research B, Vol. 34, 2000, pp. 549–566.

10.

Maher

Zhang

and Van Vliet

A Bi-level Programming Approach for Trip Matrix Estimation and Traffic Control Problems with Stochastic User Equilibrium Link Flows. Transportation Research B, Vol. 35, 2001, pp. 23–40.

11.

Bell

M. G. H.

The Estimation of Junction Turning Volumes from Traffic Counts: The Role of Prior Information. Traffic Engineering and Control, Vol. 25, No. 5 1984, pp. 279–283.

12.

Van Zuylen

H. J.

The Estimation of Turning Flows on a Junction. Traffic Engineering and Control, Vol. 20, No. 11 1979, pp. 539–541.

13.

van der Zijpp

N. J.

and Hamerslag

Improved Kalman Filtering Approach for Estimating Origin-Destination Matrices for Freeway Corridors. In Transportation Research Record 1443, TRB, National Research Council, Washington, D.C., 1994, pp. 54–63.

14.

Bell

M. G. H.

The Estimation of Origin-Destination Matrices by Constrained Generalized Least Squares. Transportation Research B, Vol. 25, 1991, pp. 13–22.

15.

Maher

Inferences on Trip Matrices from Observations on Link Volumes: A Bayesian Statistical Approach. Transportation Research B, Vol. 17, 1983, pp. 435–447.

16.

Bell

M. G. H.

and Iida

Transportation Network Analysis. John Wiley and Sons, Inc., New York, 1997.

17.

Lam

W. H. K.

and Lo

H. P.

Accuracy of O-D Estimates from Traffic Counts. Traffic Engineering and Control, Vol. 31, 1990, pp. 358–367.

18.

Yang

Iida

and Sasaki

An Analysis of the Reliability of an Origin-Destination Trip Matrix Estimated from Traffic Counts. Transportation Research B, Vol. 25, No. 5 1991, pp. 351–363.

19.

Yang

Gan

and Tang

W. H.

Determining Cordons and Screen Lines for Origin-Destination Trip Studies. Proc., 3rd Eastern Asia Society for Transportation Studies, Vol. 3, No. 2, Hanoi, Vietnam, October, 2001, pp. 85–99.

20.

Bianco

Confessore

and Reverberi

A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates. Transportation Science, Vol. 35, No. 1 2001, pp. 50–60.

21.

Bell

M. G. H.

Shield

C. M.

Busch

and Kruse

A Stochastic User Equilibrium Path Flow Estimator. Transportation Research C, Vol. 5, 1997, pp. 197–210.

22.

Fisk

Some Developments in Equilibrium Traffic Assignment. Transportation Research B, Vol. 14, 1980, pp. 243–255.

23.

Toregas

and ReVelle

Binary Logic Solutions to a Class of Location Problems. Geographical Analysis, Vol. 5, 1973, pp. 145–155.

24.

Chootinan

Chen

and Yang

A Bi-objective Traffic Counting Location Model for Origin-Destination Trip Table Estimation. Transportmetrica, Vol. 1, 2005, pp. 65–80.

25.

Chen

Chootinan

and Recker

Examining the Quality of Synthetic O-D Trip Table Estimated by Path Flow Estimator. Journal of Transportation Engineering, 2005, in press.

Improved Path Flow Estimator for Origin–Destination Trip Tables

Abstract

Get full access to this article

References