Short-term traffic flow prediction using time-varying Vasicek model

This paper provides a two-step approach based on the stochastic differential equations (SDEs) to improve short-term prediction. In the first step of this framework, a Hull-White (HW) model is applied to obtain a baseline prediction model from previous days. Then, the extended Vasicek model (EV) is employed for modeling the difference between observations and baseline predictions (residuals) during an individual day. The parameters of this time-varying model are estimated at each sample using the residuals in a short duration of time before the time point of prediction; so it provides a real time prediction. The extracted model recovers the valuable local variation information during each day. The performance of our method in comparison with other methods improves significantly in terms of root mean squared error (RMSE), mean absolute error (MAE) and mean relative error (MRE) for real data from Tehran’s highways and the open-access PeMS database. We also demonstrate that the proposed model is appropriate for imputing the missing data in traffic dataset and it is more efficient than the probabilistic principal component analysis (PPCA) and k-Nearest neighbors (k-NN) methods.     

Urban traffic flow prediction: a spatio‐temporal variable selection‐based approach

Short‐term traffic flow prediction in urban area remains a difficult yet important problem in intelligent transportation systems. Current spatio‐temporal‐based urban traffic flow prediction techniques trend aims to discover the relationship between adjacent upstream and downstream road segments using specific models, while in this paper, we advocate to exploit the spatial and temporal information from all available road segments in a partial road network. However, the available traffic states can be high dimensional for high‐density road networks. Therefore, we propose a spatio‐temporal variable selection‐based support vector regression (VS‐SVR) model fed with the high‐dimensional traffic data collected from all available road segments. Our prediction model can be presented as a two‐stage framework. In the first stage, we employ the multivariate adaptive regression splines model to select a set of predictors most related to the target one from the high‐dimensional spatio‐temporal variables, and different weights are assigned to the selected predictors. In the second stage, the kernel learning method, support vector regression, is trained on the weighted variables. The experimental results on the real‐world traffic volume collected from a sub‐area of Shanghai, China, demonstrate that the proposed spatio‐temporal VS‐SVR model outperforms the state‐of‐the‐art. Copyright © 2015 John Wiley & Sons, Ltd.     

The estimation of a time-dependent OD trip table with vehicle trajectory samples

Abstract

In this paper we discuss a dynamic origin–destination (OD) estimation problem that has been used for identifying time-dependent travel demand on a road network. Even though a dynamic OD table is an indispensable data input for executing a dynamic traffic assignment, it is difficult to construct using the conventional OD construction method such as the four-step model. For this reason, a direct estimation method based on field traffic data such as link traffic counts has been used. However, the method does not account for a logical relationship between a travel demand pattern and socioeconomic attributes. In addition, the OD estimation method cannot guarantee the reliability of estimated results since the OD estimation problem has a property named the ‘underdetermined problem.’ In order to overcome such a problem, the method developed in this paper makes use of vehicle trajectory samples with link traffic counts. The new method is applied to numerical examples and shows promising capability for identifying a temporal and spatial travel demand pattern.     

Spatial-temporal traffic flow pattern identification and anomaly detection with dictionary-based compression theory in a large-scale urban network

Traffic flow pattern identification, as well as anomaly detection, is an important component for traffic operations and control. To reveal the characteristics of regional traffic flow patterns in large road networks, this paper employs dictionary-based compression theory to identify the features of both spatial and temporal patterns by analyzing the multi-dimensional traffic-related data. An anomaly index is derived to quantify the network traffic in both spatial and temporal perspectives. Both pattern identifications are conducted in three different geographic levels: detector, intersection, and sub-region. From different geographic levels, this study finds several important features of traffic flow patterns, including the geographic distribution of traffic flow patterns, pattern shifts at different times-of-day, pattern fluctuations over different days, etc. Both spatial and temporal traffic flow patterns defined in this study can jointly characterize pattern changes and provide a good performance measure of traffic operations and management. The proposed method is further implemented in a case study for the impact of a newly constructed subway line. The before-and-after study identifies the major changes of surrounding road traffic near the subway stations. It is found that new metro stations attract more commute traffic in weekdays as well as entertaining traffic during weekends.     

Spatial and temporal characterization of travel patterns in a traffic network using vehicle trajectories

This paper presents a trajectory clustering method to discover spatial and temporal travel patterns in a traffic network. The study focuses on identifying spatially distinct traffic flow groups using trajectory clustering and investigating temporal traffic patterns of each spatial group. The main contribution of this paper is the development of a systematic framework for clustering and classifying vehicle trajectory data, which does not require a pre-processing step known as map-matching and directly applies to trajectory data without requiring the information on the underlying road network. The framework consists of four steps: similarity measurement, trajectory clustering, generation of cluster representative subsequences, and trajectory classification. First, we propose the use of the Longest Common Subsequence (LCS) between two vehicle trajectories as their similarity measure, assuming that the extent to which vehicles’ routes overlap indicates the level of closeness and relatedness as well as potential interactions between these vehicles. We then extend a density-based clustering algorithm, DBSCAN, to incorporate the LCS-based distance in our trajectory clustering problem. The output of the proposed clustering approach is a few spatially distinct traffic stream clusters, which together provide an informative and succinct representation of major network traffic streams. Next, we introduce the notion of Cluster Representative Subsequence (CRS), which reflects dense road segments shared by trajectories belonging to a given traffic stream cluster, and present the procedure of generating a set of CRSs by merging the pairwise LCSs via hierarchical agglomerative clustering. The CRSs are then used in the trajectory classification step to measure the similarity between a new trajectory and a cluster. The proposed framework is demonstrated using actual vehicle trajectory data collected from New York City, USA. A simple experiment was performed to illustrate the use of the proposed spatial traffic stream clustering in application areas such as network-level traffic flow pattern analysis and travel time reliability analysis.     

Dynamic demand estimation and prediction for traffic urban networks adopting new data sources

Nowadays, new mobility information can be derived from advanced traffic surveillance systems that collect updated traffic measurements, both in fixed locations and over specific corridors or paths. Such recent technological developments point to challenging and promising opportunities that academics and practitioners have only partially explored so far.The paper looks at some of these opportunities within the Dynamic Demand Estimation problem (DDEP). At first, data heterogeneity, accounting for different sets of data providing a wide spatial coverage, has been investigated for the benefit of off-line demand estimation. In an attempt to mimic the current urban networks monitoring, examples of complex real case applications are being reported where route travel times and route choice probabilities from probe vehicles are exploited together with common link traffic measurements.Subsequently, on-line detection of non-recurrent conditions is being recorded, adopting a sequential approach based on an extension of the Kalman Filter theory called Local Ensemble Transformed Kalman Filter (LETKF).Both the off-line and the on-line investigations adopt a simulation approach capable of capturing the highly nonlinear dependence between the travel demand and the traffic measurements through the use of dynamic traffic assignment models. Consequently, the possibility of using collected traffic information is enhanced, thus overcoming most of the limitations of current DDEP approaches found in the literature.     

The identification and empirical characterization of vehicular (Lagrangian) fundamental diagrams in multilane traffic flow

Traditional macroscopic traffic flow modeling framework adopts the spatial–temporal coordinate system to analyze traffic flow dynamics. With such modeling and analysis paradigm, complications arise for traffic flow data collected from mobile sensors such as probe vehicles equipped with mobile phones, Bluetooth, and Global Positioning System devices. The vehicle‐based measurement technologies call for new modeling thoughts that address the unique features of moving measurements and explore their full potential. In this paper, we look into the concept of vehicular fundamental diagram (VFD) and discuss its engineering implications. VFD corresponds to a conventional fundamental diagram (FD) in the kinematic wave (KW) theory that adopts space–time coordinates. Similar to the regular FD in the KW theory, VFD encapsulates all traffic flow dynamics. In this paper, to demonstrate the full potential of VFD in interpreting multilane traffic flow dynamics, we generalize the classical Edie's formula and propose a direct approach of reconstructing VFD from traffic measurements in the vehicular coordinates. A smoothing algorithm is proposed to effectively reduce the nonphysical fluctuation of traffic states calculated from multilane vehicle trajectories. As an example, we apply the proposed methodology to explore the next‐generation simulation datasets and identify the existence and forms of shock waves in different coordinate systems. Our findings provide empirical justifications and further insight for the Lagrangian traffic flow theory and models when applied in practice. Copyright © 2015 John Wiley & Sons, Ltd.     

Extended spectral envelope method for detecting and analyzing traffic oscillations

We propose using a spectral envelope method to analyze traffic oscillations using data collected from multiple sensors. Spectral envelops can reveal not only the salient frequencies of periodic oscillations of traffic flow, but also the relative strength of these oscillations at different locations. This paper first introduces time dimension into the existing spectral envelope method so that it can be applied to study the evolution of vehicular traffic oscillations. The extended spectral envelope method proposed in this paper, or ESPE, discards the normalization procedure in the standard method. A new Contributing Index (CI) is proposed to measure the relative strength of oscillations at different locations. The extended spectral envelops can be constructed on long-term or short-term time scales. While the long-term analysis helps extract salient frequencies of traffic oscillations, the short-term analysis promises to reveal their detailed spatial–temporal profiles. ESPE offers two distinctive advantages. First, it is more robust against the impacts of noises. Second, it is able to uncover complicated oscillatory behaviors which are otherwise difficult to notice. These advantages are demonstrated in case studies constructed on both simulated and real data.     

A probabilistic stationary speed–density relation based on Newell’s simplified car-following model

Probabilistic models describing macroscopic traffic flow have proven useful both in practice and in theory. In theoretical investigations of wide-scatter in flow–density data, the statistical features of flow density relations have played a central role. In real-time estimation and traffic forecasting applications, probabilistic extensions of macroscopic relations are widely used. However, how to obtain such relations, in a manner that results in physically reasonable behavior has not been addressed. This paper presents the derivation of probabilistic macroscopic traffic flow relations from Newell’s simplified car-following model. The probabilistic nature of the model allows for investigating the impact of driver heterogeneity on macroscopic relations of traffic flow. The physical features of the model are verified analytically and shown to produce behavior which is consistent with well-established traffic flow principles. An empirical investigation is carried out using trajectory data from the New Generation SIMulation (NGSIM) program and the model’s ability to reproduce real-world traffic data is validated.     

Short‐term traffic flow prediction with linear conditional Gaussian Bayesian network

Traffic flow prediction is an essential part of intelligent transportation systems (ITS). Most of the previous traffic flow prediction work treated traffic flow as a time series process only, ignoring the spatial relationship from the upstream flows or the correlation with other traffic attributes like speed and density. In this paper, we utilize a linear conditional Gaussian (LCG) Bayesian network (BN) model to consider both spatial and temporal dimensions of traffic as well as speed information for short‐term traffic flow prediction. The LCG BN allows both continuous and discrete variables, which enables the consideration of categorical variables in traffic flow prediction. A microscopic traffic simulation dataset is used to test the performance of the proposed model compared to other popular approaches under different predicting time intervals. In addition, the authors investigate the importance of spatial data and speed data in flow prediction by comparing models with different levels of information. The results indicate that the prediction accuracy will increase significantly when both spatial data and speed data are included. Copyright © 2016 John Wiley & Sons, Ltd.     

Decision-making on Large Infrastructure Projects: The Role of the Dutch Parliament

Abstract

Validating microscopic traffic simulation models incorporates several challenges because of the inadequacy and rareness of validation data, and the complexity of the car following and lane-changing processes. In addition, validation data were usually measured in aggregate form at the link level and not at the level of the individual vehicle. The majority of model validation attempts in the literature use average link measurements of traffic characteristics. However, validation techniques based on averages of traffic variables have several limitations including possible inconsistency between the field observed and simulation-estimated variables, and as such the resulting spatial–temporal traffic stream patterns.

Due to these inconsistencies, this paper introduces a novel approach to the validation of microscopic traffic simulation models. A three-stage procedure for validating microscopic simulation models is presented. The paper describes the field measurements, experimental setup, and the simulation-based analysis of the three stages. The purpose of the first stage is to validate a benchmark simulator (NETSIM) using limited field data. The second stage examines the spatial–temporal traffic patterns extracted from the benchmark simulator versus those extracted from the simulation model to be validated (I-SIM-S). Different traffic patterns were examined accounting for various factors, such as traffic flow, link speeds, and signal timing. The third stage compares the aggregate traffic measures extracted from the subject simulator against those extracted from the benchmark simulator.     

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.     

A hybrid deep learning based traffic flow prediction method and its understanding

Deep neural networks (DNNs) have recently demonstrated the capability to predict traffic flow with big data. While existing DNN models can provide better performance than shallow models, it is still an open issue of making full use of spatial-temporal characteristics of the traffic flow to improve their performance. In addition, our understanding of them on traffic data remains limited. This paper proposes a DNN based traffic flow prediction model (DNN-BTF) to improve the prediction accuracy. The DNN-BTF model makes full use of weekly/daily periodicity and spatial-temporal characteristics of traffic flow. Inspired by recent work in machine learning, an attention based model was introduced that automatically learns to determine the importance of past traffic flow. The convolutional neural network was also used to mine the spatial features and the recurrent neural network to mine the temporal features of traffic flow. We also showed through visualization how DNN-BTF model understands traffic flow data and presents a challenge to conventional thinking about neural networks in the transportation field that neural networks is purely a “black-box” model. Data from open-access database PeMS was used to validate the proposed DNN-BTF model on a long-term horizon prediction task. Experimental results demonstrated that our method outperforms the state-of-the-art approaches.     

Exact and grid-free solutions to the Lighthill–Whitham–Richards traffic flow model with bounded acceleration for a class of fundamental diagrams

In this article, we propose a new exact and grid-free numerical scheme for computing solutions associated with an hybrid traffic flow model based on the Lighthill–Whitham–Richards (LWR) partial differential equation, for a class of fundamental diagrams. In this hybrid flow model, the vehicles satisfy the LWR equation whenever possible, and have a constant acceleration otherwise. We first propose a mathematical definition of the solution as a minimization problem. We use this formulation to build a grid-free solution method for this model based on the minimization of component function. We then derive these component functions analytically for triangular fundamental diagrams, which are commonly used to model traffic flow. We also show that the proposed computational method can handle fixed or moving bottlenecks. A toolbox implementation of the resulting algorithm is briefly discussed, and posted at https://dl.dropbox.com/u/1318701/Toolbox.zip.     

Exploring traffic flow databases using space-time plots and data cubes

Local departments of transportation and metropolitan planning organizations have been collecting traffic data for many decades. However, these data are rarely exploited to their full potential. In this paper, we describe an exploratory visualization toolkit for large traffic flow databases. The visualization toolkit is based on the concept of the traffic cube: an extension of the data cube in data mining. The traffic cube organizes traffic flow data across different spatial and temporal dimensions and with respect to user-specified aggregation levels. The toolkit allows the user to perform data cube operations to select, summarize and cross-tabulate the traffic data prior to visualization as two-dimensional space-time plots. We demonstrate a prototype system using MATLAB, ArcGIS and MS Access database software. Example visualizations of a large database of hourly traffic flows along major highways in the state of Utah (USA) over a 10-year period illustrate the potential for the toolkit to reveal patterns about traffic flows and trends hidden in the database.     

Network operation reliability in a Manhattan-like urban system with adaptive traffic lights

Traffic breakdown to global gridlock occurring in congested traffic network makes the serious traffic congestion even much worse. This paper has proposed to use Network Operation Reliability (NOR) to quantitatively depict the probabilistic feature of traffic breakdown to global gridlock. The Nagel–Schreckenberg cellular automaton model has been used to simulate the traffic flow in a Manhattan-like urban network. A simple adaptive traffic light strategy has been proposed. It has been shown that if vehicles choose to use geometric shortest path, the adaptive traffic signals are able to remarkably enhance the NOR and sometimes the average velocity and the arrival rate as well. The vehicle distribution has been investigated, which has heuristically explained the enhancement of the NOR. A simple perimeter control strategy has been shown to fail to enhance the NOR. Finally, we show that if the time shortest path information could be provided and updated timely, then the NOR can be remarkably enhanced but the adaptive traffic signals have only trivial effect on NOR.     

Recognition and tracking of spatial–temporal congested traffic patterns on freeways

The two models FOTO (Forecasting of Traffic Objects) and ASDA (Automatische Staudynamikanalyse: Automatic Tracking of Moving Traffic Jams) for the automatic recognition and tracking of congested spatial–temporal traffic flow patterns on freeways are presented. The models are based on a spatial–temporal traffic phase classification made in the three-phase traffic theory by Kerner. In this traffic theory, in congested traffic two different phases are distinguished: “wide moving jam” and “synchronized flow”. The model FOTO is devoted to the identification of traffic phases and to the tracking of synchronized flow. The model ASDA is devoted to the tracking of the propagation of moving jams. The general approach and the different extensions of the models FOTO and ASDA are explained in detail. It is stressed that the models FOTO and ASDA perform without any validation of model parameters in different environmental and traffic conditions. Results of the online application of the models FOTO and ASDA at the TCC (Traffic Control Center) of Hessen near Frankfurt (Germany) are presented and evaluated.     

Adaptive scheduling for real-time and temporal information services in vehicular networks

Vehicular networks represent a research area of significant importance in improving the safety, efficiency and sustainability of transportation systems. One of the key research problems in vehicular networks is real-time data dissemination, which is crucial to the satisfactory performance of many emergent applications providing real-time information services in vehicular networks. Specifically, the two issues need to be addressed in this problem are maintenance of temporal data freshness and timely dissemination of data. Most existing works only considered periodical data update via backbone wired networks in maintaining temporal data freshness. However, many applications rely on passing vehicles to upload their collected information via wireless network, which imposes new challenges as the uplink data update will have to compete with the downlink data dissemination for the limited wireless bandwidth. With such observations, we propose a temporal information service system, in which vehicles are able to collect up-to-date temporal information and upload them to the roadside units (RSU) along their trajectories. Meanwhile, RSU can disseminate its available data items to vehicles based on their specific requests. Particularly, in this paper, we first quantitatively analyze the freshness of temporal data and propose a mathematical model to evaluate the usefulness of the temporal data. Next, we give the formulation of the proposed real-time and temporal information service (RTIS) problem, and prove the NP-hardness of this problem by constructing a polynomial-time reduction from 0–1 knapsack problem. Subsequently, we establish a probabilistic model to theoretically analyze the tradeoff between timely temporal data update and requested data dissemination sharing a common communication resource, which provides a deeper insight of the proposed RTIS. Further, a heuristic algorithm, namely adaptive update request scheduling (AURS), is designed to enhance the efficacy of RTIS by synthesizing the broadcast effect, the real-time service requirement and the service quality in making scheduling decisions. The computational complexity and scalability analysis of AURS is also discussed. Last but not least, a simulation model is implemented and a comprehensive performance evaluation has been carried out to demonstrate the superiority of ARUS against several state-of-the-art approaches in a variety of application scenarios.     

A new methodology for vehicle trajectory reconstruction based on wavelet analysis

Vehicle trajectories with high spatial and temporal resolution are known as the most ideal source of data for developing innovative microscopic traffic models. Aside from the method applied for collecting the vehicle trajectories, such data are more or less error-infected. The ever-increasing noise amplitude during the process of deriving the data (such as speed and acceleration) required for developing models, might change or even hide the structure of data and lead to useful information being overlooked. This highlights the importance of presenting the efficient methods which are adequate to remove noise and enhance the quality of vehicle trajectory data. Accordingly, in this paper a simple two-step technique based on wavelet analysis has been recommended for filtering errors and reconstructing trajectory data. Primarily, by using wavelet transform a special treatment was employed to identify and modify the outliers. Next, the noise in trajectory data was eliminated by applying the wavelet-based filter. The results of applying the proposed method to the synthetic noise-infected trajectory and the NGSIM dataset reveal how appropriate its performance is compared with other methodologies in terms of quantitative criteria.     

Analyzing spatiotemporal traffic line source emissions based on massive didi online car-hailing service data

Nowadays, the massive car-hailing data has become a popular source for analyzing traffic operation and road congestion status, which unfortunately has seldom been extended to capture detailed on-road traffic emissions. This study aims to investigate the relationship between road traffic emissions and the related built environment factors, as well as land uses. The Computer Program to Calculate Emissions from Road Transport (COPERT) model from European Environment Agency (EEA) was introduced to estimate the 24-h NOx emission pattern of road segments with the parameters extracted from Didi massive trajectory data. Then, the temporal Fuzzy C-Means (FCM) Clustering was used to classify road segments based on the 24-h emission rates, while Geographical Detector and MORAN’s I were introduced to verify the impact of built environment on line source emissions and the similarity of emissions generated from the nearby road segments. As a result, the spatial autoregressive moving average (SARMA) regression model was incorporated to assess the impact of selected built environment factors on the road segment emission rate based on the probabilistic results from FCM. It was found that short road length, being close to city center, high density of bus stations, more ramps nearby and high proportion of residential or commercial land would substantially increase the emission rate. Finally, the 24-h atmospheric NO₂ concentrations were obtained from the environmental monitor stations, to calculate the time variational trend by comparing with the line source traffic emissions, which to some extent explains the contribution of on-road traffic to the overall atmospheric pollution. Result of this study could guide urban planning, so as to avoid transportation related built environment attributes which may contribute to serious atmospheric environment pollutions.