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.

A real time forecasting tool for dynamic travel time from clustered time series

This paper addresses the problem of dynamic travel time (DTT) forecasting within highway traffic networks using speed measurements. Definitions, computational details and properties in the construction of DTT are provided. DTT is dynamically clustered using a K-means algorithm and then information on the level and the trend of the centroid of the clusters is used to devise a predictor computationally simple to be implemented. To take into account the lack of information in the cluster assignment for the new predicted values, a weighted average fusion based on a similarity measurement is proposed to combine the predictions of each model. The algorithm is deployed in a real time application and the performance is evaluated using real traffic data from the South Ring of the Grenoble city in France.     

Aggregation and travel time calculation over large scale traffic networks: An empiric study on the Grenoble City

In this paper we consider aggregation technique to reduce the complexity of large-scale traffic network. In particular, we consider the city of Grenoble and show that, by clustering adjacent sections based on a similarity of speed condition, it is possible to cut down the complexity of the network without loosing crucial and intrinsic information. To this end, we consider travel time computation as a metric of comparison between the original graph and the reduced one: for each cluster we define four attributes (average speed, primary and secondary length and heading) and show that, in case of an aggregation rate of 95%, these attributes are sufficient in order to maintain the travel time error below the 25%.     

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.     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

Prediction of travel time variability for cost-benefit analysis

Unreliable travel times cause substantial costs to travelers. Nevertheless, they are often not taken into account in cost-benefit analyses (CBA), or only in very rough ways. This paper aims at providing simple rules to predict variability, based on travel time data from Dutch highways. Two different concepts of travel time variability are used, which differ in their assumptions on information availability to drivers. The first measure is based on the assumption that, for a given road link and given time of day, the expected travel time is constant across all working days (rough information: RI). In the second case, expected travel times are assumed to reflect day-specific factors such as weather conditions or weekdays (fine information: FI). For both definitions of variability, we find that the mean travel time is a good predictor. On average, longer delays are associated with higher variability. However, the derivative of variability with respect to delays is decreasing in delays. It can be shown that this result relates to differences in the relative shares of observed traffic ‘regimes’ (free-flow, congested, hyper-congested) in the mean delay. For most CBAs, no information on the relative shares of the traffic regimes is available. A non-linear model based on mean travel times can then be used as an approximation.     

Predicting travel time reliability using mobile phone GPS data

Estimates of road speeds have become commonplace and central to route planning, but few systems in production provide information about the reliability of the prediction. Probabilistic forecasts of travel time capture reliability and can be used for risk-averse routing, for reporting travel time reliability to a user, or as a component of fleet vehicle decision-support systems. Many of these uses (such as those for mapping services like Bing or Google Maps) require predictions for routes in the road network, at arbitrary times; the highest-volume source of data for this purpose is GPS data from mobile phones. We introduce a method (TRIP) to predict the probability distribution of travel time on an arbitrary route in a road network at an arbitrary time, using GPS data from mobile phones or other probe vehicles. TRIP captures weekly cycles in congestion levels, gives informed predictions for parts of the road network with little data, and is computationally efficient, even for very large road networks and datasets. We apply TRIP to predict travel time on the road network of the Seattle metropolitan region, based on large volumes of GPS data from Windows phones. TRIP provides improved interval predictions (forecast ranges for travel time) relative to Microsoft’s engine for travel time prediction as used in Bing Maps. It also provides deterministic predictions that are as accurate as Bing Maps predictions, despite using fewer explanatory variables, and differing from the observed travel times by only 10.1% on average over 35,190 test trips. To our knowledge TRIP is the first method to provide accurate predictions of travel time reliability for complete, large-scale road networks.     

Designing heterogeneous sensor networks for estimating and predicting path travel time dynamics: An information-theoretic modeling approach

With a particular emphasis on the end-to-end travel time prediction problem, this paper proposes an information-theoretic sensor location model that aims to minimize total travel time uncertainties from a set of point, point-to-point and probe sensors in a traffic network. Based on a Kalman filtering structure, the proposed measurement and uncertainty quantification models explicitly take into account several important sources of errors in the travel time estimation/prediction process, such as the uncertainty associated with prior travel time estimates, measurement errors and sampling errors. By considering only critical paths and limited time intervals, this paper selects a path travel time uncertainty criterion to construct a joint sensor location and travel time estimation/prediction framework with a unified modeling of both recurring and non-recurring traffic conditions. An analytical determinant maximization model and heuristic beam-search algorithm are used to find an effective lower bound and solve the combinatorial sensor selection problem. A number of illustrative examples and one case study are used to demonstrate the effectiveness of the proposed methodology.     

Vehicle reidentification and travel time measurement on congested freeways

The paper presents an algorithm for matching individual vehicles measured at a freeway detector with the vehicles’ corresponding measurements taken earlier at another detector located upstream. Although this algorithm is potentially compatible with many vehicle detector technologies, the paper illustrates the method using existing dual-loop detectors to measure vehicle lengths. This detector technology has seen widespread deployment for velocity measurement. Since the detectors were not developed to measure vehicle length, these measurements can include significant errors. To overcome this problem, the algorithm exploits drivers’ tendencies to retain their positions within dense platoons. The otherwise complicated task of vehicle reidentification is carried out by matching these platoons rather than individual vehicles. Of course once a vehicle has been matched across neighboring detector stations, the difference in its arrival time at each station defines the vehicle’s travel time on the intervening segment.Findings from an application of the algorithm over a 1/3 mile long segment are presented herein and they indicate that a sufficient number of vehicles can be matched for the purpose of traffic surveillance. As such, the algorithm extracts travel time data without requiring the deployment of new detector technologies. In addition to the immediate impacts on traffic monitoring, the work provides a means to quantify the potential benefits of emerging detector technologies that promise to extract more detailed information from individual vehicles.     

A distribution-fitting-free approach to calculating travel time reliability ratio

Empirical studies have revealed that travel time variability (TTV) can significantly affect travelers’ behaviors and planners’ cost-benefit assessment of transportation projects. It is therefore important to systematically quantify the value of TTV (VTTV) and its impact. Recently, Fosgerau’s valuation method makes this quantification possible by converting the value of travel time (VTT) and the VTTV into monetary unit. Travel time reliability ratio (TTRR), defined as a ratio of the VTTV to the VTT, is a key parameter in Fosgerau’s valuation method. Calculating TTRR involves an integral of the inverse cumulative distribution function (CDF) of the standardized travel time distribution (STTD), i.e., the mean lateness factor. Using a well-fitted STTD is a straightforward way to calculate TTRR. However, it will encounter the following challenges: (1) determination of a well-fitted STTD; (2) non-existence of an algebraic expression for the CDF and its inverse CDF; and (3) lack of a closed-form expression to efficiently calculate TTRR. To circumvent the above issues, this paper proposes a distribution-fitting-free analytical approach based on the Cornish-Fisher expansion as an alternative way to calculate TTRR without the need to fit the whole CDF. The validity domain is rigorously derived for guaranteeing the accuracy of the proposed method. Realistic travel time datasets that cover 17 links are used to systematically explore the feature and accuracy of the proposed method in estimating TTRR. The comparative results demonstrate that the proposed method can efficiently and effectively estimate TTRR. When travel time datasets satisfy the validity domain, the proposed method outperforms the distribution fitting method in estimating TTRR.     

Link travel time inference using entry/exit information of trips on a network

This paper studies link travel time estimation using entry/exit time stamps of trips on a steady-state transportation network. We propose two inference methods based on the likelihood principle, assuming each link associates with a random travel time. The first method considers independent and Gaussian distributed link travel times, using the additive property that trip time has a closed-form distribution as the summation of link travel times. We particularly analyze the mean estimates when the variances of trip time estimates are known with a high degree of precision and examine the uniqueness of solutions. Two cases are discussed in detail: one with known paths of all trips and the other with unknown paths of some trips. We apply the Gaussian mixture model and the Expectation–Maximization (EM) algorithm to deal with the latter. The second method splits trip time proportionally among links traversed to deal with more general link travel time distributions such as log-normal. This approach builds upon an expected log-likelihood function which naturally leads to an iterative procedure analogous to the EM algorithm for solutions. Simulation tests on a simple nine-link network and on the Sioux Falls network respectively indicate that the two methods both perform well. The second method (i.e., trip splitting approximation) generally runs faster but with larger errors of estimated standard deviations of link travel times.     

Experienced travel time prediction for congested freeways

Travel time is an important performance measure for transportation systems, and dissemination of travel time information can help travelers make reliable travel decisions such as route choice or departure time. Since the traffic data collected in real time reflects the past or current conditions on the roadway, a predictive travel time methodology should be used to obtain the information to be disseminated. However, an important part of the literature either uses instantaneous travel time assumption, and sums the travel time of roadway segments at the starting time of the trip, or uses statistical forecasting algorithms to predict the future travel time. This study benefits from the available traffic flow fundamentals (e.g. shockwave analysis and bottleneck identification), and makes use of both historical and real time traffic information to provide travel time prediction. The methodological framework of this approach sequentially includes a bottleneck identification algorithm, clustering of traffic data in traffic regimes with similar characteristics, development of stochastic congestion maps for clustered data and an online congestion search algorithm, which combines historical data analysis and real-time data to predict experienced travel times at the starting time of the trip. The experimental results based on the loop detector data on Californian freeways indicate that the proposed method provides promising travel time predictions under varying traffic conditions.     

Dynamic travel time prediction using data clustering and genetic programming

The current state-of-practice for predicting travel times assumes that the speeds along the various roadway segments remain constant over the duration of the trip. This approach produces large prediction errors, especially when the segment speeds vary temporally. In this paper, we develop a data clustering and genetic programming approach for modeling and predicting the expected, lower, and upper bounds of dynamic travel times along freeways. The models obtained from the genetic programming approach are algebraic expressions that provide insights into the spatiotemporal interactions. The use of an algebraic equation also means that the approach is computationally efficient and suitable for real-time applications. Our algorithm is tested on a 37-mile freeway section encompassing several bottlenecks. The prediction error is demonstrated to be significantly lower than that produced by the instantaneous algorithm and the historical average averaged over seven weekdays (p-value <0.0001). Specifically, the proposed algorithm achieves more than a 25% and 76% reduction in the prediction error over the instantaneous and historical average, respectively on congested days. When bagging is used in addition to the genetic programming, the results show that the mean width of the travel time interval is less than 5 min for the 60–80 min trip.     

Estimating travel time functions for urban roads: options and issues

Travel time functions specify the relationship between the travel time on a road and the volume of traffic on the road. Until recently, the parameters of travel time functions were rarely estimated in practice; however, a compelling case can be made for the empirical examination of these functions. This paper reviews, and qualitatively evaluates, a range of options for developing a set of travel time functions. A hierarchy of travel time functions is defined based on four levels of network detail: area, corridor, route and link. This hierarchy is illustrated by considering the development of travel time functions for Adelaide. Alternative sources of data for estimating travel time functions are identified.

In general, the costs and benefits increase as the travel time functions are estimated at finer levels of network detail. The costs of developing travel time functions include data acquisition costs and analysis costs. The benefits include the potential for reducing prediction errors, the degree of application flexibility and the policy sensitivity of the travel time functions.     

Reprint of: Modelling the impact of traffic incidents on travel time reliability

Traffic incidents are recognised as one of the key sources of non-recurrent congestion that often leads to reduction in travel time reliability (TTR), a key metric of roadway performance. A method is proposed here to quantify the impacts of traffic incidents on TTR on freeways. The method uses historical data to establish recurrent speed profiles and identifies non-recurrent congestion based on their negative impacts on speeds. The locations and times of incidents are used to identify incidents among non-recurrent congestion events. Buffer time is employed to measure TTR. Extra buffer time is defined as the extra delay caused by traffic incidents. This reliability measure indicates how much extra travel time is required by travellers to arrive at their destination on time with 95% certainty in the case of an incident, over and above the travel time that would have been required under recurrent conditions. An extra buffer time index (EBTI) is defined as the ratio of extra buffer time to recurrent travel time, with zero being the best case (no delay). A Tobit model is used to identify and quantify factors that affect EBTI using a selected freeway segment in the Southeast Queensland, Australia network. Both fixed and random parameter Tobit specifications are tested. The estimation results reveal that models with random parameters offer a superior statistical fit for all types of incidents, suggesting the presence of unobserved heterogeneity across segments. What factors influence EBTI depends on the type of incident. In addition, changes in TTR as a result of traffic incidents are related to the characteristics of the incidents (multiple vehicles involved, incident duration, major incidents, etc.) and traffic characteristics.     

A copula-based approach for estimating the travel time reliability of urban arterial

Estimating the travel time reliability (TTR) of urban arterial is critical for real-time and reliable route guidance and provides theoretical bases and technical support for sophisticated traffic management and control. The state-of-art procedures for arterial TTR estimation usually assume that path travel time follows a certain distribution, with less consideration about segment correlations. However, the conventional approach is usually unrealistic because an important feature of urban arterial is the dependent structure of travel times on continuous segments. In this study, a copula-based approach that incorporates the stochastic characteristics of segments travel time is proposed to model arterial travel time distribution (TTD), which serves as a basis for TTR quantification. First, segments correlation is empirically analyzed and different types of copula models are examined. Then, fitting marginal distributions for segment TTD is conducted by parametric and non-parametric regression analysis, respectively. Based on the estimated parameters of the models, the best-fitting copula is determined in terms of the goodness-of-fit tests. Last, the model is examined at two study sites with AVI data and NGSIM trajectory data, respectively. The results of path TTD estimation demonstrate the advantage of the proposed copula-based approach, compared with the convolution model without capturing segments correlation and the empirical distribution fitting methods. Furthermore, when considering the segments correlation effect, it was found that the estimated path TTR is more accurate than that by the convolution model.     

On including travel time reliability of road traffic in appraisal

In many countries, decision-making on proposals for national or regional infrastructure projects in passenger and freight transport includes carrying out a cost–benefit analysis for these projects. Reductions in travel times are usually a key benefit. However, if a project also reduces the variability of travel time, travellers, freight operators and shippers will enjoy additional benefits, the ‘reliability benefits’. Until now, these benefits are usually not included in the cost–benefit analysis. To include reliability of travel or transport time in the cost–benefit analysis of infrastructure projects not only monetary values of reliability, but also reliability forecasting models are needed. As a result of an extensive feasibility study carried out for the German Federal Ministry of Transport, Building and Urban Development this paper aims to provide a literature overview and outcomes of an expert panel on how best to calculate and monetise reliability benefits, synthesised into recommendations for implementing travel time reliability into existing transport models in the short, medium, and long term. The paper focuses on road transport, which has also been the topic for most of the available literature on modelling and valuing transport time reliability.     

A framework for neighbour links travel time estimation in an urban network

This paper proposes a solution to the problem of limited network sensor coverage caused by insufficient sample size of probe vehicles or inadequate numbers of fixed sensors. A framework is proposed to estimate link travel times using available data from neighbouring links. Two clues are used for real-time travel time estimation: link historical travel time data and online travel time data from neighbour links. In the absence of online travel time data from neighbour links, historical records only have to be relied upon. However, where the two types of data are available, a data fusion scheme can be applied to make use of the two clues. The proposed framework is validated using real-life data from the City of Vancouver, British Columbia. The estimation accuracy is found to be comparable to the existing literature. Overall, the results demonstrate the feasibility of using neighbour links data as an additional source of information that might not have been extensively explored before.     

Additive measures of travel time variability

This paper derives a measure of travel time variability for travellers equipped with scheduling preferences defined in terms of time-varying utility rates, and who choose departure time optimally. The corresponding value of travel time variability is a constant that depends only on preference parameters. The measure is unique in being additive with respect to independent parts of a trip. It has the variance of travel time as a special case. Extension is provided to the case of travellers who use a scheduled service with fixed headway.     

A travel time reliability model of urban expressways with varying levels of service

Urban expressways usually experience several levels of service (LOS) because of the stop-and-go traffic flow caused by congestion. Moreover, multiple shock waves generate at different LOS interfaces. The dynamic of shock waves strongly influences the travel time reliability (TTR) of urban expressways. This study proposes a path TTR model that considers the dynamic of shock waves by using probability-based method to characterize the TTR of urban expressways with shock waves. Two model parameters are estimated, namely distribution of travel time (TT) per unit distance and travel distances in different LOS segments. Generalized extreme value distribution and generalized Pareto distribution are derived as distributions of TT per unit distance for six different LOS. Distribution parameters are estimated by using historical floating car data. Travel distances in different LOS segments are calculated based on shock wave theory. The range of TT along the path, which can help drivers arrange their trips, can be obtained from the TTR model. Finally, comparison is made among the proposed TTR model, generalized Pareto contrast model, which does not consider different LOS or existence of shock waves, and normal contrast model, which assumes TT per unit distance as normal distribution without considering shock wave. Results show that the proposed model achieves higher prediction accuracy and reduces the prediction range of TT. The conclusions can be further extended to TT prediction and assessment of measures to improve reliability of TT in a network.