Modeling the effects of traveler information on freeway origin–destination demand prediction

The primary focus of this research is to develop an approach to capture the effect of travel time information on travelers’ route switching behavior in real-time, based on on-line traffic surveillance data. It also presents a freeway Origin–Destination demand prediction algorithm using an adaptive Kalman Filtering technique, where the effect of travel time information on users’ route diversion behavior has been explicitly modeled using a dynamic, aggregate, route diversion model. The inherent dynamic nature of the traffic flow characteristics is captured using a Kalman Filter modeling framework. Changes in drivers’ perceptions, as well as other randomness in the route diversion behavior, have been modeled using an adaptive, aggregate, dynamic linear model where the model parameters are updated on-line using a Bayesian updating approach. The impact of route diversion on freeway Origin–Destination demands has been integrated in the estimation framework. The proposed methodology is evaluated using data obtained from a microscopic traffic simulator, INTEGRATION. Experimental results on a freeway corridor in northwest Indiana establish that significant improvement in Origin–Destination demand prediction can be achieved by explicitly accounting for route diversion behavior.     

Robustness of the off-line a priori stochastic dynamic traffic assignment solution for on-line operations

This paper focuses on the off-line stochastic dynamic traffic assignment (DTA) problem as part of a hybrid framework that combines off-line and on-line strategies to solve the on-line DTA problem. The primary concept involves the explicit recognition of stochasticity in O–D demand and/or network supply conditions to determine a robust off-line a priori solution that serves as the initial solution on-line. This strategy ensures that the computationally intensive components, which exploit historical data, are executed off-line while circumventing the need for very accurate on-line O–D demand forecast models. Thereby, efficient on-line reactive strategies could be used to address unfolding traffic conditions. The paper investigates the robustness of the off-line a priori DTA solution under plausible on-line situations. The results illustrate the superiority of the a priori solution over the currently used mean O–D demand-based solution for on-line route guidance applications.     

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.     

Probe data-driven travel time forecasting for urban expressways by matching similar spatiotemporal traffic patterns

Travel time is an effective measure of roadway traffic conditions. The provision of accurate travel time information enables travelers to make smart decisions about departure time, route choice and congestion avoidance. Based on a vast amount of probe vehicle data, this study proposes a simple but efficient pattern-matching method for travel time forecasting. Unlike previous approaches that directly employ travel time as the input variable, the proposed approach resorts to matching large-scale spatiotemporal traffic patterns for multi-step travel time forecasting. Specifically, the Gray-Level Co-occurrence Matrix (GLCM) is first employed to extract spatiotemporal traffic features. The Normalized Squared Differences (NSD) between the GLCMs of current and historical datasets serve as a basis for distance measurements of similar traffic patterns. Then, a screening process with a time constraint window is implemented for the selection of the best-matched candidates. Finally, future travel times are forecasted as a negative exponential weighted combination of each candidate’s experienced travel time for a given departure. The proposed approach is tested on Ring 2, which is a 32km urban expressway in Beijing, China. The intermediate procedures of the methodology are visualized by providing an in-depth quantitative analysis on the speed pattern matching and examples of matched speed contour plots. The prediction results confirm the desirable performance of the proposed approach and its robustness and effectiveness in various traffic conditions.     

Route switching behavior on freeways with the provision of different types of real-time traffic information

This study investigates route switching behavior on freeways in reaction to the provision of different types of real-time traffic information. The experimental design of the stated preference survey is based on four types of real-time information provided to travelers who were randomly selected at rest areas. The four types of real-time information defined in this paper are qualitative, quantitative, qualitative guidance, and quantitative guidance. The bounded rationality framework, also known as indifference band approach, is applied to model the freeway route switching behavior. Two important variables, travel time and travel cost, are included in the indifference band. In this study, the best route switching rule, travelers’ current routes as compared to the best route, is investigated to further provide valuable insights into freeways travelers’ route switching behavior with the provision of different types of real-time traffic information.     

Data-driven linear decision rule approach for distributionally robust optimization of on-line signal control

We propose a two-stage, on-line signal control strategy for dynamic networks using a linear decision rule (LDR) approach and a distributionally robust optimization (DRO) technique. The first (off-line) stage formulates a LDR that maps real-time traffic data to optimal signal control policies. A DRO problem is solved to optimize the on-line performance of the LDR in the presence of uncertainties associated with the observed traffic states and ambiguity in their underlying distribution functions. We employ a data-driven calibration of the uncertainty set, which takes into account historical traffic data. The second (on-line) stage implements a very efficient linear decision rule whose performance is guaranteed by the off-line computation. We test the proposed signal control procedure in a simulation environment that is informed by actual traffic data obtained in Glasgow, and demonstrate its full potential in on-line operation and deployability on realistic networks, as well as its effectiveness in improving traffic.     

The treatment of uncertainty in the dynamic origin–destination estimation problem using a fuzzy approach

Regardless of existing types of transportation and traffic model and their applications, the essential input to these models is travel demand, which is usually described using origin–destination (OD) matrices. Due to the high cost and time required for the direct development of such matrices, they are sometimes estimated indirectly from traffic measurements recorded from the transportation network. Based on an assumed demand profile, OD estimation problems can be categorized into static or dynamic groups. Dynamic OD demand provides valuable information on the within-day fluctuation of traffic, which can be employed to analyse congestion dissipation. In addition, OD estimates are essential inputs to dynamic traffic assignment (DTA) models. This study presents a fuzzy approach to dynamic OD estimation problems. The problems are approached using a two-level model in which demand is estimated in the upper level and the lower level performs DTA via traffic simulation. Using fuzzy rules and the fuzzy C-Mean clustering approach, the proposed method treats uncertainty in historical OD demand and observed link counts. The approach employs expert knowledge to model fitted link counts and to set boundaries for the optimization problem by defining functions in the fuzzification process. The same operation is performed on the simulation outputs, and the entire process enables different types of optimization algorithm to be employed. The Box-complex method is utilized as an optimization algorithm in the implementation of the approach. Empirical case studies are performed on two networks to evaluate the validity and accuracy of the approach. The study results for a synthetic network and a real network demonstrate the robust performance of the proposed method even when using low-quality historical demand data.     

Hybrid model for prediction of bus arrival times at next station

Effective prediction of bus arrival times is important to advanced traveler information systems (ATIS). Here a hybrid model, based on support vector machine (SVM) and Kalman filtering technique, is presented to predict bus arrival times. In the model, the SVM model predicts the baseline travel times on the basic of historical trips occurring data at given time‐of‐day, weather conditions, route segment, the travel times on the current segment, and the latest travel times on the predicted segment; the Kalman filtering‐based dynamic algorithm uses the latest bus arrival information, together with estimated baseline travel times, to predict arrival times at the next point. The predicted bus arrival times are examined by data of bus no. 7 in a satellite town of Dalian in China. Results show that the hybrid model proposed in this paper is feasible and applicable in bus arrival time forecasting area, and generally provides better performance than artificial neural network (ANN)–based methods. Copyright © 2010 John Wiley & Sons, Ltd.     

Estimating performance of traffic signals based on link travel times

Recent advances in communication and computing technology have made travel time measurements more available than ever before. In urban signalized arterials, travel times are strongly influenced by traffic signals. This study presents a novel method based on well‐known principles to estimate traffic signal performance (or more precisely their major “through” movements) based on travel time measurements. The travel times were collected between signals in the field by using point‐to‐point travel time measurement technologies. Closed‐circuit television cameras and signal databases were used to collect traffic demand and signal timings, respectively. Then, the volume/capacity ratio of major downstream signal movements was computed based on demand and signal timings. This volume/capacity ratio was then correlated with travel times on the relevant intersection approach. The best volume‐delay function was found, along with many other functions, to fit the field data. This volume‐delay function was then used to estimate volume/capacity ratios and, indirectly, a few other signal performance metrics. The method, called travel time‐based signal performance measurements, was automated and displayed on a Google Map. The findings show that the proposed method is accurate and robust enough to provide necessary information about signal performance. A newly developed volume‐delay function was found to work just slightly better than the Bureau of Public Roads curve. Several issues, which may reduce the accuracy of the proposed method, are identified, and their solutions are proposed for future research. Copyright © 2016 John Wiley & Sons, Ltd.     

Modeling Travel Time Under ATIS Using Mixed Linear Models

The objective of this paper is to model travel time when drivers are equipped with pre-trip and/or en-route real-time traffic information/advice. A travel simulator with a realistic network and real historical congestion levels was used as a data collection tool. The network included 40 links and 25 nodes. This paper presents models of the origin-to-destination travel time and en-route short-term route (link) travel time under five different types and levels of advanced traveler information systems (ATIS). Mixed linear models with the repeated observation's technique were used in both models. Different covariance structures (including the independent case) were developed and compared. The effect of correlation was found significant in both models. The trip travel time analysis showed that as the level of information increases (adding en-route to the pre-trip and advice to the advice-free information), the average travel time decreases. The model estimates show that providing pre-trip and en-route traffic information with advice could result in significant savings in the overall travel time. The en-route short-term (link) travel time analysis showed that the en-route short-term (link) information has a good chance of being used and followed. The short-term qualitative information is more likely to be used than quantitative information. Learning and being familiar with the system that provides the information decreases en-route short-term delay.     

Field implementation feasibility study of cumulative travel‐time responsive (CTR) traffic signal control algorithm

The cumulative travel‐time responsive (CTR) algorithm determines optimal green split for the next time interval by identifying the maximum cumulative travel time (CTT) estimated under the connected vehicle environment. This paper enhanced the CTR algorithm and evaluated its performance to verify a feasibility of field implementation in a near future. Standard Kalman filter (SKF) and adaptive Kalman filter (AKF) were applied to estimate CTT for each phase in the CTR algorithm. In addition, traffic demand, market penetration rate (MPR), and data availability were considered to evaluate the CTR algorithm's performance. An intersection in the Northern Virginia connected vehicle test bed is selected for a case study and evaluated within vissim and hardware in the loop simulations. As expected, the CTR algorithm's performance depends on MPR because the information collected from connected vehicle is a key enabling factor of the CTR algorithm. However, this paper found that the MPR requirement of the CTR algorithm could be addressed (i) when the data are collected from both connected vehicle and the infrastructure sensors and (ii) when the AKF is adopted. The minimum required MPRs to outperform the actuated traffic signal control were empirically found for each prediction technique (i.e., 30% for the SKF and 20% for the AKF) and data availability. Even without the infrastructure sensors, the CTR algorithm could be implemented at an intersection with high traffic demand and 50–60% MPR. The findings of this study are expected to contribute to the field implementation of the CTR algorithm to improve the traffic network performance. Copyright © 2017 John Wiley & Sons, Ltd.     

Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

Real-time estimation of turning movement proportions from partial counts on urban networks

Modern traffic signal control systems require reliable estimates of turning flows in real time to formulate effective control actions, and accommodate disturbances in traffic demand without deteriorating the system performance. The more accurate the estimation is, the more effective the control plan is. Most of the previous research works assumed that a full set of detector counts is available and employed the least-squares methods to produce unbiased estimates of the turning movement proportions. However, in practice, such a dense detector configuration is expensive to install and maintain. Also, the least-squares estimates are not feasible when the travel time between inflows and outflows is significant, or when intervening traffic conditions change the travel time. This study proposes a nonlinear least-square (NLS) approach and a quasi maximum likelihood (QML) approach to recursively estimate turning movement proportions in a network of intersections where only a partial set of detector counts are available. Using large population approximation technique, a class of nonlinear, discrete-time traffic flow models are transformed into a linear state–space model tractable for on-line applications. The quality of estimates is demonstrated by implementing the proposed algorithms with simulation and real data. As a comparison, the NLS estimator shows less bias but with higher variance than the QML estimator. The QML estimator outperforms the NLS estimator in terms of total mean square error, due to an increase in bias being traded for a decrease in variance.     

Towards a generic benchmarking platform for origin–destination flows estimation/updating algorithms: Design,demonstration and validation

Estimation/updating of Origin–Destination (OD) flows and other traffic state parameters is a classical, widely adopted procedure in transport engineering, both in off-line and in on-line contexts. Notwithstanding numerous approaches proposed in the literature, there is still room for considerable improvements, also leveraging the unprecedented opportunity offered by information and communication technologies and big data. A key issue relates to the unobservability of OD flows in real networks – except from closed highway systems – thus leading to inherent difficulties in measuring performance of OD flows estimation/updating methods and algorithms. Starting from these premises, the paper proposes a common evaluation and benchmarking framework, providing a synthetic test bed, which enables implementation and comparison of OD estimation/updating algorithms and methodologies under “standardized” conditions. The framework, implemented in a platform available to interested parties upon request, has been flexibly designed and allows comparing a variety of approaches under various settings and conditions. Specifically, the structure and the key features of the framework are presented, along with a detailed experimental design for the application of different dynamic OD flow estimation algorithms. By way of example, applications to both off-line/planning and on-line algorithms are presented, together with a demonstration of the extensibility of the presented framework to accommodate additional data sources.     

Behavior-consistent information-based network traffic control for evacuation operations

The evacuation operations problem aims to avoid or mitigate the potential loss of life in a region threatened or affected by a disaster. It is shaped to a large extent by the evolution of evacuation traffic resulting from the demand–supply interactions of the associated transportation network. Information-based control is a strategic tool for evacuation traffic operations as it can enable greater access to the affected population and more effective response. However, comparatively few studies have focused on the implementation of information-based control in evacuation operations. This study develops a control module for evacuation operations centered on addressing the demand–supply interactions by using behavior-consistent information strategies. These strategies incorporate the likely responses of evacuees to the information provided in the determination of route guidance information. The control module works as an iterative computational process involving an evacuee route choice model and a control model of information strategies to determine the route guidance information to direct evacuation traffic so as to approach a desired network traffic flow pattern. The problem is formulated as a fuzzy logic based optimization framework to explicitly incorporate practical concerns related to information dissemination characteristics and social equity in evacuation operations. Numerical experiments highlight the importance of accounting for the demand–supply interactions, as the use of behavior-consistent information strategies can lead evacuee route choices to approach the operator-desired proportions corresponding to the desired traffic pattern. The results also indicate that while a behavior-consistent information strategy can be effective, gaps with the desired route proportions can exist due to the discrete nature of the linguistic messages and the real-world difficulty in accurately modeling evacuees’ actual route choice behavior.     

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.     

Short-term traffic flow rate forecasting based on identifying similar traffic patterns

The ability to timely and accurately forecast the evolution of traffic is very important in traffic management and control applications. This paper proposes a non-parametric and data-driven methodology for short-term traffic forecasting based on identifying similar traffic patterns using an enhanced K-nearest neighbor (K-NN) algorithm. Weighted Euclidean distance, which gives more weight to recent measurements, is used as a similarity measure for K-NN. Moreover, winsorization of the neighbors is implemented to dampen the effects of dominant candidates, and rank exponent is used to aggregate the candidate values. Robustness of the proposed method is demonstrated by implementing it on large datasets collected from different regions and by comparing it with advanced time series models, such as SARIMA and adaptive Kalman Filter models proposed by others. It is demonstrated that the proposed method reduces the mean absolute percent error by more than 25%. In addition, the effectiveness of the proposed enhanced K-NN algorithm is evaluated for multiple forecast steps and also its performance is tested under data with missing values. This research provides strong evidence suggesting that the proposed non-parametric and data-driven approach for short-term traffic forecasting provides promising results. Given the simplicity, accuracy, and robustness of the proposed approach, it can be easily incorporated with real-time traffic control for proactive freeway traffic management.     

A review on travel behaviour modelling in dynamic traffic simulation models for evacuations

Dynamic traffic simulation models are frequently used to support decisions when planning an evacuation. This contribution reviews the different (mathematical) model formulations underlying these traffic simulation models used in evacuation studies and the behavioural assumptions that are made. The appropriateness of these behavioural assumptions is elaborated on in light of the current consensus on evacuation travel behaviour, based on the view from the social sciences as well as empirical studies on evacuation behaviour. The focus lies on how travellers’ decisions are predicted through simulation regarding the choice to evacuate, departure time choice, destination choice, and route choice. For the evacuation participation and departure time choice we argue in favour of the simultaneous approach to dynamic evacuation demand prediction using the repeated binary logit model. For the destination choice we show how further research is needed to generalize the current preliminary findings on the location-type specific destination choice models. For the evacuation route choice we argue in favour of hybrid route choice models that enable both following instructed routes and en-route switches. Within each of these discussions, we point at current limitations and make corresponding suggestions on promising future research directions.     

Path flow estimator for planning applications in small communities

This paper presents an alternative planning framework to model and forecast network traffic for planning applications in small communities, where limited resources debilitate the development and applications of the conventional four-step travel demand forecasting model. The core idea is to use the Path Flow Estimator (PFE) to estimate current and forecast future traffic demand while taking into account of various field and planning data as modeling constraints. Specifically, two versions of PFE are developed: a base year PFE for estimating the current network traffic conditions using field data and planning data, if available, and a future year PFE for predicting future network traffic conditions using forecast planning data and the estimated base year origin–destination trip table as constraints. In the absence of travel survey data, the proposed method uses similar data (traffic counts and land use data) as a four-step model for model development and calibration. Since the Institute of Transportation Engineers (ITE) trip generation rates and Highway Capacity Manual (HCM) are both utilized in the modeling process, the analysis scope and results are consistent with those of common traffic impact studies and other short-range, localized transportation improvement programs. Solution algorithms are also developed to solve the two PFE models and integrated into a GIS-based software called Visual PFE. For proof of concept, two case studies in northern California are performed to demonstrate how the tool can be used in practice. The first case study is a small community of St. Helena, where the city’s planning department has neither an existing travel demand model nor the budget for developing a full four-step model. The second case study is in the city of Eureka, where there is a four-step model developed for the Humboldt County that can be used for comparison. The results show that the proposed approach is applicable for small communities with limited resources.     

First-best marginal cost toll for a traffic network with stochastic demand

First-best marginal cost pricing (MCP) in traffic networks has been extensively studied with the assumption of deterministic travel demand. However, this assumption may not be realistic as a transportation network is exposed to various uncertainties. This paper investigates MCP in a traffic network under stochastic travel demand. Cases of both fixed and elastic demand are considered. In the fixed demand case, travel demand is represented as a random variable, whereas in the elastic demand case, a pre-specified random variable is introduced into the demand function. The paper also considers a set of assumptions of traveler behavior. In the first case, it is assumed that the traveler considers only the mean travel time in the route choice decision (risk-neutral behavior), and in the second, both the mean and the variance of travel time are introduced into the route choice model (risk-averse behavior). A closed-form formulation of the true marginal cost toll for the stochastic network (SN-MCP) is derived from the variational inequality conditions of the system optimum and user equilibrium assignments. The key finding is that the calculation of the SN-MCP model cannot be made by simply substituting related terms in the original MCP model by their expected values. The paper provides a general function of SN-MCP and derives the closed-form SN-MCP formulation for specific cases with lognormal and normal stochastic travel demand. Four numerical examples are explored to compare network performance under the SN-MCP and other toll regimes.