A STOCHASTIC USER EQUILIBRIUM PATH FLOW ESTIMATOR

The paper sets out a path flow estimator suitable for use in conjunction with urban traffic monitoring, control and guidance. Travel time for each link in the network is partitioned into undelayed travel time and delay. The links are assumed to be of two types. For the first type of link, an external estimate of flow and travel time over the estimation interval is provided. The second type of link is characterised by a finite capacity, and delay is incurred where demand would otherwise be in excess of capacity. Demand is determined by a logit route choice model. An equivalent convex programming problem is formulated and an iterative solution procedure is set out. The estimation of the dispersion parameter in the logit model is discussed, and a column generation method to avoid path enumeration is proposed. Diagnostic procedures and a number of other practical enhancements to the procedure, in particular the incorporation of prior information on the relative magnitudes of origin-destination movements, are considered.

[1]  Hai Yang.  Heuristic algorithms for the bilevel origin-destination matrix estimation problem , 1995 .

[2]  Ennio Cascetta,et al.  Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts , 1993, Transp. Sci..

[3]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[4]  M. Cremer,et al.  A new class of dynamic methods for the identification of origin-destination flows , 1987 .

[5]  Henk J van Zuylen,et al.  The most likely trip matrix estimated from traffic counts , 1980 .

[6]  Michael G.H. Bell,et al.  The real time estimation of origin-destination flows in the presence of platoon dispersion , 1991 .

[7]  M Florian,et al.  A BILEVEL PROGRAMMING APPROACH TO ESTIMATING O-D MATRIX BY TRAFFIC COUNTS , 1991 .

[8]  M J Smith.  TRAFFIC CONTROL AND TRAFFIC ASSIGNMENT IN A SIGNAL-CONTROLLED NETWORK WITH QUEUEING , 1987 .

[9]  Kalidas Ashok,et al.  DYNAMIC ORIGIN-DESTINATION MATRIX ESTIMATION AND PREDICTION FOR REAL- TIME TRAFFIC MANAGEMENT SYSTEMS , 1993 .

[10]  C. Fisk.  Some developments in equilibrium traffic assignment , 1980 .

[11]  G. Davis,et al.  Recursive estimation of origin-destination matrices from input/output counts , 1987 .

[12]  M. Bell.  STOCHASTIC USER EQUILIBRIUM ASSIGNMENT IN NETWORKS WITH QUEUES , 1995 .

[13]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[14]  Hai Yang,et al.  Estimation of origin-destination matrices from link traffic counts on congested networks , 1992 .

[15]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[16]  N. F. Stewart,et al.  ON THE CALIBRATION OF THE COMBINED DISTRIBUTION-ASSIGNMENT MODEL , 1979 .

[17]  P C Baguley,et al.  CONTRAM: A TRAFFIC ASSIGNMENT MODEL FOR PREDICTING FLOWS AND QUEUES DURING PEAK PERIODS , 1978 .

[18]  E. Cascetta.  Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator , 1984 .

[19]  H. Spiess.  A MAXIMUM LIKELIHOOD MODEL FOR ESTIMATING ORIGIN-DESTINATION MATRICES , 1987 .

[20]  R. Sivanandan,et al.  A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes , 1994 .

[21]  M. Bell.  THE ESTIMATION OF ORIGIN-DESTINATION MATRICES BY CONSTRAINED GENERALISED LEAST SQUARES , 1991 .

[22]  M. Maher.  INFERENCES ON TRIP MATRICES FROM OBSERVATIONS ON LINK VOLUMES: A BAYESIAN STATISTICAL APPROACH , 1983 .

[23]  M C Bell.  TECHNIQUES FOR THE DYNAMIC ESTIMATION OF O-D MATRICES IN TRAFFIC NETWORKS , 1991 .