Identifying optimal data aggregation interval sizes for link and corridor travel time estimation and forecasting

With the recent increase in the deployment of ITS technologies in urban areas throughout the world, traffic management centers have the ability to obtain and archive large amounts of data on the traffic system. These data can be used to estimate current conditions and predict future conditions on the roadway network. A general solution methodology for identifying the optimal aggregation interval sizes for four scenarios is proposed in this article: (1) link travel time estimation, (2) corridor/route travel time estimation, (3) link travel time forecasting, and (4) corridor/route travel time forecasting. The methodology explicitly considers traffic dynamics and frequency of observations. A formulation based on mean square error (MSE) is developed for each of the scenarios and interpreted from a traffic flow perspective. The methodology for estimating the optimal aggregation size is based on (1) the tradeoff between the estimated mean square error of prediction and the variance of the predictor, (2) the differences between estimation and forecasting, and (3) the direct consideration of the correlation between link travel time for corridor/route estimation and forecasting. The proposed methods are demonstrated using travel time data from Houston, Texas, that were collected as part of the automatic vehicle identification (AVI) system of the Houston Transtar system. It was found that the optimal aggregation size is a function of the application and traffic condition.

Probe vehicle data sampled by time or space: Consistent travel time allocation and estimation

A characteristic of low frequency probe vehicle data is that vehicles traverse multiple network components (e.g., links) between consecutive position samplings, creating challenges for (i) the allocation of the measured travel time to the traversed components, and (ii) the consistent estimation of component travel time distribution parameters. This paper shows that the solution to these problems depends on whether sampling is based on time (e.g., one report every minute) or space (e.g., one every 500 m). For the special case of segments with uniform space-mean speeds, explicit formulae are derived under both sampling principles for the likelihood of the measurements and the allocation of travel time. It is shown that time-based sampling is biased towards measurements where a disproportionally long time is spent on the last segment. Numerical experiments show that an incorrect likelihood formulation can lead to significantly biased parameter estimates depending on the shapes of the travel time distributions. The analysis reveals that the sampling protocol needs to be considered in travel time estimation using probe vehicle data.     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.