Estimating time dependent O‐D trip tables during peak periods

Intelligent transportation systems (ITS) have been used to alleviate congestion problems arising due to demand during peak periods. The success of ITS strategies relies heavily on two factors: 1) the ability to accurately estimate the temporal and spatial distribution of travel demand on the transportation network during peak periods, and, 2) providing real-time route guidance to users. This paper addresses the first factor. A model to estimate time dependent origin-destination (O-D) trip tables in urban areas during peak periods is proposed. The daily peak travel period is divided into several time slices to facilitate simulation and modeling. In urban areas, a majority of the trips during peak periods are work trips. For illustration purposes, only peak period work trips are considered in this paper. The proposed methodology is based on the arrival pattern of trips at a traffic analysis zone (TAZ) and the distribution of their travel times. The travel time matrix for the peak period, the O-D trip table for the peak period, and the number of trips expected to arrive at each TAZ at different work start times are inputs to the model. The model outputs are O-D trip tables for each time slice in the peak period. 1995 data for the Las Vegas metropolitan area are considered for testing and validating the model, and its application. The model is reasonably robust, but some lack of precision was observed. This is due to two possible reasons: 1) rounding-off, and, 2) low ratio of total number of trips to total number of O-D pair combinations. Hence, an attempt is made to study the effect of increasing this ratio on error estimates. The ratio is increased by multiplying each O-D pair trip element with a scaling factor. Better estimates were obtained. Computational issues involved with the simulation and modeling process are discussed.

[1]  Gary A. Davis,et al.  Application of Prediction-Error Minimization and Maximum Likelihood to Estimate Intersection O-D Matrices from Traffic Counts , 1989, Transp. Sci..

[2]  Gang-Len Chang,et al.  Estimation of time-varying origin-destination distributions with dynamic screenline flows , 1996 .

[3]  Hani S. Mahmassani,et al.  Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials , 1984, Transp. Sci..

[4]  Janusz Supernak A METHOD FOR ESTIMATING LONG-TERM CHANGES IN TIME-OF-DAY TRAVEL DEMAND , 1987 .

[5]  Nancy L. Nihan,et al.  FIXED-POINT APPROACH TO ESTIMATING FREEWAY ORIGIN-DESTINATION MATRICES AND THE EFFECT OF ERRONEOUS DATA ON ESTIMATE PRECISION , 1992 .

[6]  Moshe Ben-Akiva,et al.  Dynamic network models and driver information systems , 1991 .

[7]  Hani S. Mahmassani,et al.  System performance and user response under real-time information in a congested traffic corridor , 1991 .

[8]  André de Palma,et al.  Dynamic Model of Peak Period Traffic Congestion with Elastic Arrival Rates , 1986, Transp. Sci..

[9]  Nancy L. Nihan,et al.  ESTIMATING INTERSECTION O-D MATRICES FROM OBSERVED TIME-SERIES OF TRAFFIC COUNTS: THE ZELLNER ESTIMATOR , 1996 .

[10]  Antoine G. Hobeika,et al.  Parameter optimization methods for estimating dynamic origin-destination trip-tables , 1997 .

[11]  Bruce N Janson,et al.  NETWORK DESIGN EFFECTS OF DYNAMIC TRAFFIC ASSIGNMENT , 1995 .

[12]  Frank Southworth,et al.  ESTIMATING DEPARTURE TIMES FROM TRAFFIC COUNTS USING DYNAMIC ASSIGNMENT , 1992 .

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

[14]  Bruce N Janson,et al.  Dynamic traffic assignment for urban road networks , 1991 .

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