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.     

A tensor-based Bayesian probabilistic model for citywide personalized travel time estimation

Urban travel time information is of great importance for many levels of traffic management and operation. This paper develops a tensor-based Bayesian probabilistic model for citywide and personalized travel time estimation, using the large-scale and sparse GPS trajectories generated by taxicabs. Combined with the knowledge learned from historical trajectories, travel times of different drivers on all road segments in some time slots are modeled with a 3-order tensor. This tensor-based modeling approach incorporates both the spatial correlation between different road segments and the person-specific variation between different drivers, as well as the coarse-grain temporal correlation between recent and historical traffic conditions and the fine-grain temporal correlation between different time slots. To account for the variability caused by the intrinsic uncertainties in urban road network, each travel time entry in the built tensor is treated as a variable following a log-normal distribution. With the help of the fully Bayesian treatment, the model achieves automatic hyper-parameter tuning and model complexity controlling, and therefore the problem of over-fitting is prevented even when the used data is large-scale and sparse. The proposed model is applied to a real case study on the citywide road network of Beijing, China, using the large-scale and sparse GPS trajectories collected from over 32,670 taxicabs for a period of two months. Empirical results of extensive experiments demonstrate that the proposed model provides an effective and robust approach for urban travel time estimation and outperforms the considered competing methods.     

Estimating link travel time functions for heterogeneous traffic flows on freeways

Oversized vehicles, such as trucks, significantly contribute to traffic delays on freeways. Heterogeneous traffic populations, that is, those consisting of multiple vehicles types, can exhibit more complicated travel behaviors in the operating speed and performance, depending on the traffic volume as well as the proportions of vehicle types. In order to estimate the component travel time functions for heterogeneous traffic flows on a freeway, this study develops a microscopic traffic‐simulation based four‐step method. A piecewise continuous function is proposed for each vehicle type and its parameters are estimated using the traffic data generated by a microscopic traffic simulation model. The illustrated experiments based on VISSIM model indicate that (i) in addition to traffic volume, traffic composition has significant influence on the travel time of vehicles and (ii) the respective estimations for travel time of heterogeneous flows could greatly improve their estimation accuracy. Copyright © 2016 John Wiley & Sons, Ltd.     

A multivariate state space approach for urban traffic flow modeling and prediction

Urban traffic congestion is one of the most severe problems of everyday life in Metropolitan areas. In an effort to deal with this problem, intelligent transportation systems (ITS) technologies have concentrated in recent years on dealing with urban congestion. One of the most critical aspects of ITS success is the provision of accurate real-time information and short-term predictions of traffic parameters such as traffic volumes, travel speeds and occupancies. The present paper concentrates on developing flexible and explicitly multivariate time-series state space models using core urban area loop detector data. Using 3-min volume measurements from urban arterial streets near downtown Athens, models were developed that feed on data from upstream detectors to improve on the predictions of downstream locations. The results clearly suggest that different model specifications are appropriate for different time periods of the day. Further, it also appears that the use of multivariate state space models improves on the prediction accuracy over univariate time series ones.     

Macroscopic Fundamental Diagrams: A cross-comparison of estimation methods

This paper aims to cross-compare existing estimation methods for the Macroscopic Fundamental Diagram. Raw data are provided by a mesoscopic simulation tool for two typical networks that mimic an urban corridor and a meshed urban center. We mainly focus on homogenous network loading in order to fairly cross-compare the different methods with the analytical reference. It appears that the only way to estimate the MFD without bias is to have the full information of vehicle trajectories over the network and to apply Edie’s definitions. Combining information from probes (mean network speed) and loop detectors (mean network flow) also provides accurate results even for low sampling rate (<10%). Loop detectors fail to provide a good estimation for mean network speed or density because they cannot capture the traffic spatial dynamics over links. This paper proposes a simple adjustment technic in order to reduce the discrepancy when only loop detectors are available.     

Deriving macroscopic fundamental diagrams from probe data: Issues and proposed solutions

Well-defined relationships between flow and density averaged spatially across urban traffic networks, more commonly known as Macroscopic Fundamental Diagrams (MFDs), have been recently verified to exist in reality. Researchers have proposed using MFDs to monitor the status of urban traffic networks and to inform the design of network-wide traffic control strategies. However, it is also well known that empirical MFDs are not easy to estimate in practice due to difficulties in obtaining the requisite data needed to construct them. Recent works have devised ways to estimate a network’s MFD using limited trajectory data that can be obtained from GPS-equipped mobile probe vehicles. These methods assume that the market penetration level of mobile probe vehicles is uniform across the entire set of OD pairs in the network; however, in reality the probe vehicle market penetration rate varies regionally within a network. When this variation is combined with the imbalance of probe trip lengths and travel times, the compound effects will further complicate the estimation of the MFD.To overcome this deficit, we propose a method to estimate a network’s MFD using mobile probe data when the market penetration rates are not necessarily the same across an entire network. This method relies on the determination of appropriate average probe penetration rates, which are weighted harmonic means using individual probe vehicle travel times and distances as the weights. The accuracy of this method is tested using synthetic data generated in the INTEGRATION micro-simulation environment by comparing the estimated MFDs to the ground truth MFD obtained using a 100% market penetration of probe vehicles. The results show that the weighted harmonic mean probe penetration rates outperform simple (arithmetic) average probe penetration rates, as expected. This especially holds true as the imbalance of demand and penetration level increases. Furthermore, as the probe penetration rates are generally not known, an algorithm to estimate the probe penetration rates of regional OD pairs is proposed. This algorithm links count data from sporadic fixed detectors in the network to information from probe vehicles that pass the detectors. The simulation results indicate that the proposed algorithm is very effective. Since the data needed to apply this algorithm are readily available and easy to collect, the proposed algorithm is practically feasible and offers a better approach for the estimation of the MFD using mobile probe data, which are becoming increasingly available in urban environments.     

Optimal speed detector density for the network with travel time information

In the expressway network, detectors are installed on the links for detecting the travel time information while the predicted travel time can be provided by the route guidance system (RGS). The speed detector density can be determined to influence flow distributions in such a way that the precision of the travel time information and the social cost of the speed detectors are optimized, provided that each driver chooses the minimum perceived travel time path in response to the predicted travel time information. In this paper, a bilevel programming model is proposed for the network with travel time information provided by the RGS. The lower-level problem is a probit-based traffic assignment model, while the upper-level problem is to determine the speed detector density that minimizes the measured travel time error variance as well as the social cost of the speed detectors. The sensitivity analysis based algorithm is proposed for the bilevel programming problem. Numerical examples are provided to illustrate the applications of the proposed model and of the solution algorithm.     

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.     

Practical approach for travel time estimation from point traffic detector data

Accurate estimation of travel time is critical to the success of advanced traffic management systems and advanced traveler information systems. Travel time estimation also provides basic data support for travel time reliability research, which is being recognized as an important performance measure of the transportation system. This paper investigates a number of methods to address the three major issues associated with travel time estimation from point traffic detector data: data filling for missing or error data, speed transformation from time‐mean speed to space‐mean speed, and travel time estimation that converts the speeds recorded at detector locations to travel time along the highway segment. The case study results show that the spatial and temporal interpolation of missing data and the transformation to space‐mean speed improve the accuracy of the estimates of travel time. The results also indicate that the piecewise constant‐acceleration‐based method developed in this study and the average speed method produce better results than the other three methods proposed in previous studies. Copyright © 2011 John Wiley & Sons, Ltd.     

Modeling real-time human mobility based on mobile phone and transportation data fusion

Even though a variety of human mobility models have been recently developed, models that can capture real-time human mobility of urban populations in a sustainable and economical manner are still lacking. Here, we propose a novel human mobility model that combines the advantages of mobile phone signaling data (i.e., comprehensive penetration in a population) and urban transportation data (i.e., continuous collection and high accuracy). Using the proposed human mobility model, travel demands during each 1-h time window were estimated for the city of Shenzhen, China. Significantly, the estimated travel demands not only preserved the distribution of travel demands, but also captured real-time bursts of mobility fluxes during large crowding events. Finally, based on the proposed human mobility model, a predictive model is deployed to predict crowd gatherings that usually cause severe traffic jams.     

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.     

Origin-destination trip table estimation based on subarea network OD flow and vehicle trajectory data

Identifying accurate origin-destination (O-D) travel demand is one of the most important and challenging tasks in the transportation planning field. Recently, a wide range of traffic data has been made available. This paper proposes an O-D estimation model using multiple field data. This study takes advantage of emerging technologies – car navigation systems, highway toll collecting systems and link traffic counts – to determine O-D demand. The proposed method is unique since these multiple data are combined to improve the accuracy of O-D estimation for an entire network. We tested our model on a sample network and found great potential for using multiple data as a means of O-D estimation. The errors of a single input data source do not critically affect the model’s overall accuracy, meaning that combining multiple data provides resilience to these errors. It is suggested that the model is a feasible means for more reliable O-D estimation.     

A mixed-integer linear program for optimizing sensor locations along freeway corridors

How to optimally allocate limited freeway sensor resources is of great interest to transportation engineers. In this paper, we focus on the optimal allocation of point sensors, such as loop detectors, to minimize performance measurement errors. Although it has been shown that the minimization problem can be intuitively formulated as a nonlinear program, the formulation is so complex that only heuristic approaches can be used to solve the problem. In this paper, we transform the nonlinear program into an equivalent mixed-integer linear model. The linearized model is shown to have a graphical interpretation and can be solved using resource constrained shortest path algorithms. A customized Branch-and-Bound technique is then proposed to solve the resource constrained shortest path problem. Numerical experiments along an urban freeway corridor demonstrate that this sensor location model is successful in allocating loop detectors to improve the accuracy of travel time estimation.     

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.

Data fusion algorithm for macroscopic fundamental diagram estimation

A promising framework that describes traffic conditions in urban networks is the macroscopic fundamental diagram (MFD), relating average flow and average density in a relatively homogeneous urban network. It has been shown that the MFD can be used, for example, for traffic access control. However, an implementation requires an accurate estimation of the MFD with the available data sources.Most scientific literature has considered the estimation of MFDs based on either loop detector data (LDD) or floating car data (FCD). In this paper, however, we propose a methodology for estimating the MFD based on both data sources simultaneously. To that end, we have defined a fusion algorithm that separates the urban network into two sub-networks, one with loop detectors and one without. The LDD and the FCD are then fused taking into account the accuracy and network coverage of each data type. Simulations of an abstract grid network and the network of the city of Zurich show that the fusion algorithm always reduces the estimation error significantly with respect to an estimation where only one data source is used. This holds true, even when we account for the fact that the probe penetration rate of FCD needs to be estimated with loop detectors, hence it might also include some errors depending on the number of loop detectors, especially when probe vehicles are not homogeneously distributed within the network.     

Increasing the accuracy of loop detector counts using adaptive neural fuzzy inference system and genetic programming

Loop detectors are devices that are most commonly used for obtaining data at intersections. Multiple detectors are usually required to monitor a location, and this reduces the accuracy of detectors for collecting traffic volumes. The purpose of this paper is to increase the accuracy of loop detector counts using Adaptive Neural Fuzzy Inference System (ANFIS) and Genetic Programming (GP) based on detector volume and occupancy. These methods do not need microscopic analysis and are easy to employ. Four approaches for one intersection are used in a case study. Results show that the models can improve intersection detector counts significantly. Results also show that ANFIS produces more accurate counts compared to regression and GP.     

Automatic calibration of fundamental diagram for first‐order macroscopic freeway traffic models

Despite its importance in macroscopic traffic flow modeling, comprehensive method for the calibration of fundamental diagram is very limited. Conventional empirical methods adopt a steady state analysis of the aggregate traffic data collected from measurement devices installed on a particular site without considering the traffic dynamics, which renders the simulation may not be adaptive to the variability of data. Nonetheless, determining the fundamental diagram for each detection site is often infeasible. To remedy these, this study presents an automatic calibration method to estimate the parameters of a fundamental diagram through a dynamic approach. Simulated flow from the cell transmission model is compared against the measured flow wherein an optimization merit is conducted to minimize the discrepancy between model‐generated data and real data. The empirical results prove that the proposed automatic calibration algorithm can significantly improve the accuracy of traffic state estimation by adapting to the variability of traffic data when compared with several existing methods under both recurrent and abnormal traffic conditions. Results also highlight the robustness of the proposed algorithm. The automatic calibration algorithm provides a powerful tool for model calibration when freeways are equipped with sparse detectors, new traffic surveillance systems lack of comprehensive traffic data, or the case that lots of detectors lose their effectiveness for aging systems. Furthermore, the proposed method is useful for off‐line model calibration under abnormal traffic conditions, for example, incident scenarios. Copyright © 2015 John Wiley & Sons, Ltd.     

Probe vehicle based real-time traffic monitoring on urban roadways

Travel time estimation and prediction on urban arterials is an important component of Active Traffic and Demand Management Systems (ATDMS). This paper aims in using the information of GPS probes to augment less dynamic but available information describing arterial travel times. The direction followed in this paper chooses a cooperative approach in travel time estimation using static information describing arterial geometry and signal timing, semi-dynamic information of historical travel time distributions per time of day, and utilizes GPS probe information to augment and improve the latter. First, arterial travel times are classified by identifying different travel time states, then link travel time distributions are approximated using mixtures of normal distributions. If prior travel time data is available, travel time distributions can be estimated empirically. Otherwise, travel time distribution can be estimated based on signal timing and arterial geometry. Real-time GPS travel time data is then used to identify the current traffic condition based on Bayes Theorem. Moreover, these GPS data can also be used to update the parameters of the travel time distributions using a Bayesian update. The iterative update process makes the posterior distributions more and more accurate. Finally, two comprehensive case studies using the NGSIM Peachtree Street dataset, and GPS data of Washington Avenue in Minneapolis, were conducted. The first case study estimated prior travel time distributions based on signal timing and arterial geometry under different traffic conditions. Travel time data were classified and corresponding distributions were updated. In addition, results from the Bayesian update and EM algorithm were compared. The second case study first tested the methodologies based on real GPS data and showed the importance of sample size. In addition, a methodology was proposed to distinguish new traffic conditions in the second case study.     

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.     

Estimating origin‐destination matrices from link volume counts: a simple intercity auto travel demand model for Sri Lanka

The cost of nation wide travel surveys is high. Hence in many developing countries, planners have found it difficult to develop intercity transportation plans due to the non availability of origin‐destination trip matrices. This paper will describe a method for the intercity auto travel estimation for Sri Lanka with link traffic volume data.

The paper outlines the rationale of selecting the district capitals of Sri Lanka as its “cities,” the methodology for selecting the intercity road network, determination of link travel times from express bus schedules and the location of link volume counting positions.

Initially, the total auto travel demand model is formulated with various trip purpose sub‐models. This model is finally modified to a simple demand model with district urban population and travel times between city pairs as the exogenous variables, to overcome statistical estimation difficulties. The final demand model has statistics within the acceptable regions.

The advantages of a simple model are discussed and possible extensions are proposed.