Reducing bias in probe-based arterial link travel time estimates

The use of probe vehicles to provide estimates of link travel times has been suggested as a means of obtaining travel times within signalized networks for use in advanced traveler information systems. Previous research has shown that bias in arrival time distributions of probe vehicles will lead to a systematic bias in the sample estimate of the mean. This paper proposes a methodology for reducing the effect of this bias. The method, based on stratified sampling techniques, requires that vehicle count data be obtained from an in-road loop detector or other traffic surveillance method. The effectiveness of the methodology is illustrated using simulation results for a single intersection approach and for an arterial corridor. The results for the single intersection approach indicate a correlation (R²) between the biased estimate and the population mean of 0.61, and an improved correlation between the proposed estimation method and the population mean of 0.81. Application of the proposed method to the arterial corridor resulted in a reduction in the mean travel time error of approximately 50%, further indicating that the proposed estimation method provides improved accuracy over the typical method of computing the arithmetic mean of the probe reports.     

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.     

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.     

Accuracy of distance‐based travel time decomposition in probe vehicle systems

Probe vehicle data (PVD) are commonly used for area‐wide measurements of travel time in road networks. In this context, travel times usually refer to fixed edges of an underlying (digital) map. That means measured travel times have to be transformed into so‐called link travel times first. This paper analyzes a common method being applied for solving this task (distance‐based travel time decomposition). It is shown that, in general, its inherent imprecision must not be neglected. Instead, it might cause a serious misinterpretation of data if potential errors in the context of travel time decomposition are ignored. For this purpose, systematic as well as maximum deviations between “decomposed” and “true” link travel times are mathematically analyzed. By that, divergent statements in the literature about the accuracy of PVD are harmonized. Moreover, conditions for the applicability of the so‐called distance‐proportion method are derived depending on the permitted error level. Three examples ranging from pure theory to real world confirm the analytical findings and underline the problems resulting from distance‐based travel time decomposition at local level, for example, at individual intersections. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

Decomposing travel times measured by probe-based traffic monitoring systems to individual road segments

In probe-based traffic monitoring systems, traffic conditions can be inferred based on the position data of a set of periodically polled probe vehicles. In such systems, the two consecutive polled positions do not necessarily correspond to the end points of individual links. Obtaining estimates of travel time at the individual link level requires the total traversal time (which is equal to the polling interval duration) be decomposed. This paper presents an algorithm for solving the problem of decomposing the traversal time to times taken to traverse individual road segments on the route. The proposed algorithm assumes minimal information about the network, namely network topography (i.e. links and nodes) and the free flow speed of each link. Unlike existing deterministic methods, the proposed solution algorithm defines a likelihood function that is maximized to solve for the most likely travel time for each road segment on the traversed route. The proposed scheme is evaluated using simulated data and compared to a benchmark deterministic method. The evaluation results suggest that the proposed method outperforms the bench mark method and on average improves the accuracy of the estimated link travel times by up to 90%.     

Identifying the onset of congestion rapidly with existing traffic detectors

From an operations standpoint the most important function of a traffic surveillance system is determining reliably whether the facility is free flowing or congested. The second most important function is responding rapidly when the facility becomes congested. These functions are complicated by the fact that conventional vehicle detectors are only capable of monitoring discrete points along the roadway while incidents may occur at any location on the facility. The point detectors are typically placed at least one-third of a mile apart and conditions between the detectors must be inferred from the local measurements.This paper presents a new approach for traffic surveillance that addresses these issues. It uses existing dual loop detector stations to match vehicle measurements between stations and monitor the entire roadway. Rather than expending a considerable effort to detect congested conditions, the research employs a relatively simple strategy to look for free flow traffic. Whenever a unique vehicle passes the downstream station, the algorithm looks to see if a similar vehicle passed the upstream station within a time window that is bounded by feasible travel times. The approach provides vehicle reidentification and travel time measurement on freeways during free flow and through the onset of congestion. If desired, other algorithms can be used with the same detectors to provide similar measurements during congested conditions. The work should prove beneficial for traffic management and traveler information applications, while promising to be deployable in the short term.     

Discretised link travel time models based on cumulative flows: Formulations and properties

In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear interpolation (LI) are used to approximate cumulative flows over time. New formulations of the SF-type and LI-type link travel time models are developed. We prove that these two types of link travel time models ensure first-in-first-out (FIFO) and continuity of travel times with respect to flows, and have other desirable properties. Since the LI-type link travel time model does not satisfy the causality property, a modified LI-type (MLI-type) link travel time model is proposed in this paper. We prove that the MLI-type link travel time model ensures causality, strong FIFO and travel time continuity, and that the MLI-type link travel time function is strictly monotone under the condition that the travel time of each vehicle on a link is greater than the free flow travel time on that link. Numerical examples are set up to illustrate the properties and accuracy of the three models.     

Time-dependent Hyperstar algorithm for robust vehicle navigation

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A^* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. Probabilities for link use are sought that minimise the driver’s maximum exposure to delay on the approach to each node, leading to the determination of a pessimistic expected time of arrival at the destination and all intermediate nodes. Since the context considered is vehicle navigation, the probability of link use measures link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies to undelayed link travel times. The paper concludes with a numerical example.     

Improved velocity estimation using single loop detectors

This paper develops an improved algorithm for estimating velocity from single loop detector data. Unlike preceding works, the algorithm is simple enough that it can be implemented using existing controller hardware. The discussion shows how the benefits of this work extend to automated tests of detector data quality at dual loop speed traps. Finally, this paper refutes an earlier study that found conventional single loop velocity estimates are biased.     

International experience with speed limits during and prior to the energy crisis of 1973–4

This paper presents an artificial neural network (ANN) based method for estimating route travel times between individual locations in an urban traffic network. Fast and accurate estimation of route travel times is required by the vehicle routing and scheduling process involved in many fleet vehicle operation systems such as dial‐a‐ride paratransit, school bus, and private delivery services. The methodology developed in this paper assumes that route travel times are time‐dependent and stochastic and their means and standard deviations need to be estimated. Three feed‐forward neural networks are developed to model the travel time behaviour during different time periods of the day‐the AM peak, the PM peak, and the off‐peak. These models are subsequently trained and tested using data simulated on the road network for the City of Edmonton, Alberta. A comparison of the ANN model with a traditional distance‐based model and a shortest path algorithm is then presented. The practical implication of the ANN method is subsequently demonstrated within a dial‐a‐ride paratransit vehicle routing and scheduling problem. The computational results show that the ANN‐based route travel time estimation model is appropriate, with respect to accuracy and speed, for use in real applications.     

Speed estimation and length based vehicle classification from freeway single-loop detectors

Roadway usage, particularly by large vehicles, is one of the fundamental factors determining the lifespan of highway infrastructure. Operating agencies typically employ expensive classification stations to monitor large vehicle usage. Meanwhile, single-loop detectors are the most common vehicle detector and many new, out-of-pavement detectors seek to replace loop detectors by emulating the operation of single-loop detectors. In either case, collecting reliable length data from these detectors has been considered impossible due to the noisy speed estimates provided by conventional data aggregation at single-loop detectors. This research refines non-conventional techniques for estimating speed at single-loop detectors, yielding estimates that approach the accuracy of a dual-loop detector’s measurements. Employing these speed estimation advances, this research brings length based vehicle classification to single-loop detectors (and by extension, many of the emerging out-of-pavement detectors). The classification methodology is evaluated against concurrent measurements from video and dual-loop detectors. To capture higher truck volumes than empirically observed, a process of generating synthetic detector actuations is developed. By extending vehicle classification to single-loop detectors, this work leverages the existing investment deployed in single-loop detector count stations and real-time traffic management stations. The work also offers a viable treatment in the event that one of the loops in a dual-loop detector classification station fails and thus, also promises to improve the reliability of existing classification stations.     

Modelling rain effects on risk‐taking behaviours of multi‐user classes in road networks with uncertainty

This paper proposes a new travel time reliability‐based traffic assignment model to investigate the rain effects on risk‐taking behaviours of different road users in networks with day‐to‐day demand fluctuations and variations in travel time. A generalized link travel time function is used to capture the rain effects on vehicle travel times and road conditions. This function is further incorporated into daily demand variations to investigate those travel time variations arising from demand uncertainty and rain condition. In view of these rain effects, road users' perception errors on travel times and risk‐taking behaviours on path choices are incorporated in the proposed model with the use of a logit‐based stochastic user equilibrium framework. This new model is formulated as a variational inequality problem in terms of path flows. A numerical example is used to illustrate the application of the proposed model for assessment of the rain effects on road networks with uncertainty.     

A virtual vehicle probe model for time-dependent travel time estimation on signalized arterials

Estimation of time-dependent arterial travel time is a challenging task because of the interrupted nature of urban traffic flows. Many research efforts have been devoted to this topic, but their successes are limited and most of them can only be used for offline purposes due to the limited availability of traffic data from signalized intersections. In this paper, we describe a real-time arterial data collection and archival system developed at the University of Minnesota, followed by an innovative algorithm for time-dependent arterial travel time estimation using the archived traffic data. The data collection system simultaneously collects high-resolution “event-based” traffic data including every vehicle actuations over loop detector and every signal phase changes from multiple intersections. Using the “event-based” data, we estimate time-dependent travel time along an arterial by tracing a virtual probe vehicle. At each time step, the virtual probe has three possible maneuvers: acceleration, deceleration and no-speed-change. The maneuver decision is determined by its own status and surrounding traffic conditions, which can be estimated based on the availability of traffic data at intersections. An interesting property of the proposed model is that travel time estimation errors can be self-corrected, because the trajectory differences between a virtual probe vehicle and a real one can be reduced when both vehicles meet a red signal phase and/or a vehicle queue. Field studies at a 11-intersection arterial corridor along France Avenue in Minneapolis, MN, demonstrate that the proposed model can generate accurate time-dependent travel times under various traffic conditions.     

Vehicle value of travel time savings: Evidence from a group-based modelling approach

The value of travel time savings (VTTS) accounts for a majority of the total user benefits in economic appraisal of transport investments. This means that having an accurate estimate of VTTS for different segments of travel continues to retain currency, despite there being a rich literature on estimates of VTTS for different travel modes, travel purposes, income groups, life cycles, and distance bands. In contrast, there is a dearth of research and evidence on vehicle VTTS, although joint travel by car is an important segment of travel. This paper fills this gap by developing a group-based modelling approach to quantify the vehicle VTTS and compares this with the VTTS for a driver with and without a passenger. An online survey was conducted in Sydney in 2014 and the data used to obtain a number of new empirical estimates of vehicle and driver VTTS. The new evidence questions the validity of various assumptions adopted in current practice for valuing the time savings of car passengers and multiple occupant cars.     

Preparing highway emissions inventories for urban scale modeling: A case study in Philadelphia

Highway emissions represent a major source of many pollutants. Use of local data to model these emissions can have a large impact on the magnitude and distribution of emissions predicted and can significantly improve the accuracy of local scale air quality modeling assessments. This paper provides a comparison of top–down and bottom–up approaches for developing emission inventories for modeling in one urban area, Philadelphia, in calendar year 1999. A bottom–up approach relies on combining motor vehicle emission factors and vehicle activity data from a travel demand model estimated at the road link level to generate hourly emissions data. This approach can result in better estimates of levels and spatial distribution of on-road motor vehicle emissions than a top–down approach that relies on more aggregated information and default modeling inputs.     

Comparing whole-link travel time models

In a model commonly used in dynamic traffic assignment the link travel time for a vehicle entering a link at time t is taken as a function of the number of vehicles on the link at time t. In an alternative recently introduced model, the travel time for a vehicle entering a link at time t is taken as a function of an estimate of the flow in the immediate neighbourhood of the vehicle, averaged over the time the vehicle is traversing the link. Here we compare the solutions obtained from these two models when applied to various inflow profiles. We also divide the link into segments, apply each model sequentially to the segments and again compare the results. As the number of segments is increased, the discretisation refined to the continuous limit, the solutions from the two models converge to the same solution, which is the solution of the Lighthill, Whitham, Richards (LWR) model for traffic flow. We illustrate the results for different travel time functions and patterns of inflows to the link. In the numerical examples the solutions from the second of the two models are closer to the limit solutions. We also show that the models converge even when the link segments are not homogeneous, and introduce a correction scheme in the second model to compensate for an approximation error, hence improving the approximation to the LWR model.     

Using high-resolution event-based data for traffic modeling and control: An overview

Research on using high-resolution event-based data for traffic modeling and control is still at early stage. In this paper, we provide a comprehensive overview on what has been achieved and also think ahead on what can be achieved in the future. It is our opinion that using high-resolution event data, instead of conventional aggregate data, could bring significant improvements to current research and practices in traffic engineering. Event data records the times when a vehicle arrives at and departs from a vehicle detector. From that, individual vehicle’s on-detector-time and time gap between two consecutive vehicles can be derived. Such detailed information is of great importance for traffic modeling and control. As reviewed in this paper, current research has demonstrated that event data are extremely helpful in the fields of detector error diagnosis, vehicle classification, freeway travel time estimation, arterial performance measure, signal control optimization, traffic safety, traffic flow theory, and environmental studies. In addition, the cost of event data collection is low compared to other data collection techniques since event data can be directly collected from existing controller cabinet without any changes on the infrastructure, and can be continuously collected in 24/7 mode. This brings many research opportunities as suggested in the paper.     

Estimating freeway route travel time distributions with consideration to time‐of‐day,inclement weather,and traffic incidents

This paper develops an efficient probabilistic model for estimating route travel time variability, incorporating factors of time‐of‐day, inclement weather, and traffic incidents. Estimating the route travel time distribution from historical link travel time data is challenging owing to the interactions among upstream and downstream links. Upon creating conditional probability function for each link travel time, we applied Monte Carlo simulation to estimate the total travel time from origin to destination. A numerical example of three alternative routes in the City of Buffalo shows several implications. The study found that weather conditions, except for snow, incur minor impact on off‐peak and weekend travel time, whereas peak travel times suffer great variations under different weather conditions. On top of that, inclement weather exacerbates route travel time reliability, even when mean travel time increases moderately. The computation time of the proposed model is linearly correlated to the number of links in a route. Therefore, this model can be used to obtain all the origin to destination travel time distributions in an urban region. Further, this study also validates the well‐known near‐linear relation between the standard deviation of travel time per unit distance and the corresponding mean value under different weather conditions. Copyright © 2016 John Wiley & Sons, Ltd.     

A traffic flow simulator for network reliability assessment

This paper investigates the transportation network reliability based on the information provided by detectors installed on some links. A traffic flow simulator (TFS) model is formulated for assessing the network reliability (in terms of travel time reliability), in which the variation of perceived travel time error and the fluctuations of origin-destination (OD) demand are explicitly considered. On the basis of prior OD demand and partial updated detector data, the TFS can estimate the link flows for the whole network together with link/path travel times, and their variance and covariance. The travel time reliability by OD pair can also be assessed and the OD matrix can be updated simultaneously. A Monte Carlo based algorithm is developed to solve the TFS model. The application of the proposed TFS model is illustrated by a numerical example.