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.     

Road pricing with complications

The rationale for congestion charges is that by internalising the marginal external congestion cost, they restore efficiency in the transport market. In the canonical model underlying this view, congestion is a static phenomenon, users are taken to be homogenous, there is no travel time risk, and a highly stylised model of congestion is used. The simple analysis also ignores that real pricing schemes are only rough approximations to ideal systems and that inefficiencies in related markets potentially affect the case for congestion charges. The canonical model tends to understate the marginal external congestion cost because it ignores user heterogeneity and trip timing inefficiencies. With respect to the relevance of interactions between congestion and congestion charges and tax distortions and distributional concerns, recent insights point out that there is no general case for modifying charges for such interactions. Therefore the simple Pigouvian rule remains a good first approximation for the design of road charging systems.     

A simulation-based approach in determining permitted left-turn capacities

A fundamental objective of traffic signal operations is the development of phasing plans that reduce delays while maintaining a high level of safety. One issue of concern is the treatment of left-turn phasing, which can operate as a protected movement, a permitted movement yielding to conflicting traffic, a combination protected–permitted movement or as a split-phase intersection. While protected-only movements can improve safety for the turning movement, they can also increase delays and congestion at the intersection. Most states maintain independent guidance for determining left-turn phasing; however, the most common identified guidance for protected left-turn phases is using a threshold based on the cross product of the left-turn volume and opposing through movements. The use of the cross product has been questioned recently as an indicator for determining phase selection. Based on simulation analysis within this research, the cross product is shown to be a poor indicator of left-turn capacity and congestion at the intersection.This research proposes a simplified single variable exponential model to determine left-turn capacity based on opposing volume and percent green time to determine left-turn capacity thresholds for protected left-turn phasing. The model is developed based on observed capacity from 450 VISSIM microsimulation scenarios which evaluated varying opposing volume, opposing number of lanes, cycle lengths and green time splits. Validation of the model based on complex Highway Capacity Manual procedures, indicates that the proposed model provides similar correlation to observed capacities. Finally, a nomograph is developed which presents the model in a simple form for interpretation and application by practicing traffic engineers, when required to determine left-turn phasing options. This procedure allows simple determination based on minimum input data needs similar to the cross product determination, without the need for complex hand calculations or computing requirements of the Highway Capacity Manual.     

Real-time estimation of lane-based queue lengths at isolated signalized junctions

In this study, we develop a real-time estimation approach for lane-based queue lengths. Our aim is to determine the numbers of queued vehicles in each lane, based on detector information at isolated signalized junctions. The challenges involved in this task are to identify whether there is a residual queue at the start time of each cycle and to determine the proportions of lane-to-lane traffic volumes in each lane. Discriminant models are developed based on time occupancy rates and impulse memories, as calculated by the detector and signal information from a set of upstream and downstream detectors. To determine the proportions of total traffic volume in each lane, the downstream arrivals for each cycle are estimated by using the Kalman filter, which is based on upstream arrivals and downstream discharges collected during the previous cycle. Both the computer simulations and the case study of real-world traffic show that the proposed method is robust and accurate for the estimation of lane-based queue lengths in real time under a wide range of traffic conditions. Calibrated discriminant models play a significant role in determining whether there are residual queued vehicles in each lane at the start time of each cycle. In addition, downstream arrivals estimated by the Kalman filter enhance the accuracy of the estimates by minimizing any error terms caused by lane-changing behavior.     

A dynamic cordon pricing scheme combining the Macroscopic Fundamental Diagram and an agent-based traffic model

Pricing is considered an effective management policy to reduce traffic congestion in transportation networks. In this paper we combine a macroscopic model of traffic congestion in urban networks with an agent-based simulator to study congestion pricing schemes. The macroscopic model, which has been tested with real data in previous studies, represents an accurate and robust approach to model the dynamics of congestion. The agent-based simulator can reproduce the complexity of travel behavior in terms of travelers’ choices and heterogeneity. This integrated approach is superior to traditional pricing schemes. On one hand, traffic simulators (including car-following, lane-changing and route choice models) consider travel behavior, i.e. departure time choice, inelastic to the level of congestion. On the other hand, most congestion pricing models utilize supply models insensitive to demand fluctuations and non-stationary conditions. This is not consistent with the physics of traffic and the dynamics of congestion. Furthermore, works that integrate the above features in pricing models are assuming deterministic and homogeneous population characteristics. In this paper, we first demonstrate by case studies in Zurich urban road network, that the output of a agent-based simulator is consistent with the physics of traffic flow dynamics, as defined by a Macroscopic Fundamental Diagram (MFD). We then develop and apply a dynamic cordon-based congestion pricing scheme, in which tolls are controlled by an MFD. And we investigate the effectiveness of the proposed pricing scheme. Results show that by applying such a congestion pricing, (i) the savings of travel time at both aggregated and disaggregated level outweigh the costs of tolling, (ii) the congestion inside the cordon area is eased while no extra congestion is generated in the neighbor area outside the cordon, (iii) tolling has stronger impact on leisure-related activities than on work-related activities, as fewer agents who perform work-related activities changed their time plans. Future work can apply the same methodology to other network-based pricing schemes, such as area-based or distance-traveled-based pricing. Equity issues can be investigated more carefully, if provided with data such as income of agents. Value-of-time-dependent pricing schemes then can also be determined.     

Use of sequential learning for short-term traffic flow forecasting

Accurate short-term traffic flow forecasting has become a crucial step in the overall goal of better road network management. Previous research [H. Kirby, M. Dougherty, S. Watson, Should we use neural networks or statistical models for short term motorway traffic forecasting, International Journal of Forecasting 13 (1997) 43–50.] has demonstrated that a straightforward application of neural networks can be used to forecast traffic flows along a motorway link. The objective of this paper is to report on the application and performance of an alternative neural computing algorithm which involves ‘sequential or dynamic learning’ of the traffic flow process. Our initial work [H. Chen, S. Clark, M.S. Dougherty, S.M. Grant-Muller, Investigation of network performance prediction, Report on Dynamic Neural Network and Performance Indicator development, Institute for Transport Studies, University of Leeds Technical Note 418, 1998 (unpublished)] was based on simulated data (generated using a Hermite polynomial with random noise) that had a profile similar to that of traffic flows in real data. This indicated the potential suitability of dynamic neural networks with traffic flow data. Using the Kalman filter type network an initial application with M25 motorway flow data suggested that a percentage absolute error (PAE) of approximately 9.5% could be achieved for a network with five hidden units (compared with 11% for the static neural network model). Three different neural networks were trained with all the data (containing an unknown number of incidents) and secondly using data wholly obtained around incidents. Results showed that from the three different models, the ‘simple dynamic model’ with the first five units fixed (and subsequent hidden units distributed amongst these) had the best forecasting performance. Comparisons were also made of the networks’ performance on data obtained around incidents. More detailed analysis of how the performance of the three networks changed through a single day (including an incident) showed that the simple dynamic model again outperformed the other two networks in all time periods. The use of ‘piecewise’ models (i.e. where a different model is selected according to traffic flow conditions) for data obtained around incidents highlighted good performance again by the simple dynamic network. This outperformed the standard Kalman filter neural network for a medium-sized network and is our overall recommendation for any future application.     

On-line estimation of state-of-charge of Li-ion batteries in electric vehicle using the resampling particle filter

Accurate battery state-of-charge (SOC) estimation is important for ensuring reliable operation of electric vehicle (EV). Since a nonlinear feature exists in the battery system and particle filter (PF) performs well in solving nonlinear or non-Gaussian problems, this paper proposes a new PF-based method for estimating SOC. Firstly, the relationships between the battery characteristics and SOC are analyzed, then the suitable battery model is developed and the unknown parameters in the battery model are on-line identified using the recursive least square with forgetting factors. The proposed battery model is considered as the state space model of PF and then SOC is estimated. All experimental data are collected from the running EVs in Beijing. The experimental errors of SOC estimation based on PF are less than 0.05 V, which confirms the good estimation performance. Moreover, the contrastive results of three nonlinear filters show PF has the same computational complexity as extend Kalman filter (EKF) and unscented Kalman filter (UKF) for low dimensional state vector, but PF have significantly better estimation accuracy in SOC estimation.     

A bayesian dynamic linear model approach for real-time short-term freeway travel time prediction

This paper presents a Bayesian inference-based dynamic linear model (DLM) to predict online short-term travel time on a freeway stretch. The proposed method considers the predicted freeway travel time as the sum of the median of historical travel times, time-varying random variations in travel time, and a model evolution error, where the median is employed to recognize the primary travel time pattern while the variation captures unexpected supply (i.e. capacity) reduction and demand fluctuations. Bayesian forecasting is a learning process that revises sequentially the state of a priori knowledge of travel time based on newly available information. The prediction result is a posterior travel time distribution that can be employed to generate a single-value (typically but not necessarily the mean) travel time as well as a confidence interval representing the uncertainty of travel time prediction. To better track travel time fluctuations during non-recurrent congestion due to unforeseen events (e.g., incidents, accidents, or bad weather), the DLM is integrated into an adaptive control framework that can automatically learn and adjust the system evolution noise level. The experiment results based on the real loop detector data of an I-66 segment in Northern Virginia suggest that the proposed method is able to provide accurate and reliable travel time prediction under both recurrent and non-recurrent traffic conditions.     

Feedback control strategy of a new car-following model based on reducing traffic accident rates

ABSTRACT

To reduce the traffic accident death rate effectively and alleviate the traffic congestion phenomenon, this study proposes a new type of car-following model under the influence of drivers’ time-varying delay response time. Based on Lyapunov function theory, this paper reduces the traffic accident rate problem to the stability issues of the new model. By constructing suitable Lyapunov functions and using the linear matrix inequality method, the stability problem of the new car-following model is studied. The model, under the action of the controller, can effectively restrain traffic congestion. Using the traffic accident rate model proposed by Solomon, compared with the car-following model without the controller, the model under the controller shows a stronger convergence. This also means that the traffic congestion phenomenon has been effectively suppressed while greatly reducing the mortality rate of traffic accidents.     

A high fidelity traffic simulation model based on cellular automata and car-following concepts

A high fidelity cell based traffic simulation model (CELLSIM) has been developed for simulation of high volume of traffic at the regional level. Straightforward algorithms and efficient use of computational resources make the model suitable for real time traffic simulation. The model formulation uses concepts of cellular automata (CA) and car-following (CF) models, but is more detailed than CA models and has realistic acceleration and deceleration models for vehicles. A simple dual-regime constant acceleration model has been used that requires minimal calculation compared to detailed acceleration models used in CF models. CELLSIM is simpler than most CF models; a simplified car-following logic has been developed using preferred time headway. Like CA models, integer values are used to make the model run faster. Space is discretized in small intervals and a new concept of percent space occupancy (SOC) is used to measure traffic congestion. CELLSIM performs well in congested and non-congested traffic conditions. It has been validated comprehensively at the macroscopic and microscopic levels using two sets of field data. Comparison of field data and CELLSIM for trajectories, average speed, density and volume show very close agreement. Statistical comparison of macroscopic parameters with other CF models indicates that CELLSIM performs as good as detailed CF models. Stability analyses conducted using mild and severe disturbances indicate that CELLSIM performs well under both conditions.     

盾构大数据预处理方法研究

在盾构法隧道施工过程中,合理设置盾构机运行参数,确保盾构机能够按照一定速度掘进,是整个工程流程控制中非常重要的工作。针对现有的盾构参数预测方法缺少对数据系统性的分析和处理,导致预测效果不及预期的情况,文章提出了一整套新的数据预处理流程。该流程分为数据分析和数据处理两个阶段,第一阶段通过主成分分析、皮尔森相关性系数分析进行特征筛选,第二阶段通过插值平滑、卷积平滑进行数据平滑。经过这两个阶段的原始数据处理后,能够在盾构产生的海量数据中提取出特征更明显、价值更高的数据。通过选取真实盾构机数据集进行对比实验,结果表明,所提出的数据预处理流程,能够有效提高盾构机参数预测模型的准确率。     

A novel peer-to-peer congestion pricing marketplace enabled by vehicle-automation

This paper proposes a novel concept of congestion pricing based on voluntary peer-to-peer exchange of money between motorists in exchange for one ceding priority to another in a traffic stream. While in the classical congestion charging paradigm payments are compulsory and flow only towards the system operator, in the proposed marketplace participation is voluntary and motorists directly compensate each other. A particular motorist may find that he/she is a ‘payer’ at certain points in a given journey and a ‘payee’ at others.Humans would not be expected to successfully seek, negotiate and execute a continuous series of peer-to-peer trades involving micro-payments while also handling the cognitively-demanding task of driving; real-world implementation will therefore require vehicles operating under fully-automated control in both the longitudinal and lateral dimensions during the time periods that they seek and engage in trades. The automated vehicle control algorithms must be sufficiently intelligent and adaptable to enable alternative maneuvers on short timescales, given the inherent uncertainty of whether or not a potential trade will in fact be executed. The peer-to-peer trading would be executed algorithmically, subject to strategic-level guidance given by a vehicle’s occupant(s) regarding the occupant’s relative valuation of money and priority in the traffic stream.In this paper we detail the prospective marketplace and present a simple simulation model to expose its properties. We show that the proposed peer-to-peer marketplace could lead to both desirable and undesirable outcomes; which of these would be predominant is a matter requiring empirical study. The paper concludes with a discussion of further research needs to refine and develop these concepts into practice.     

Improved waveform‐feature‐based vehicle classification using a single‐point magnetic sensor

Vehicle classification systems have important roles in applications related to real‐time traffic management. They also provide essential data and necessary information for traffic planning, pavement design, and maintenance. Among various classification techniques, the length‐based classification technique is widely used at present. However, the undesirable speed estimates provided by conventional data aggregation make it impossible to collect reliable length data from a single‐point sensor during real‐time operations. In this paper, an innovative approach of vehicle classification will be proposed, which achieved very satisfactory results on a single‐point sensor. This method has two essential parts. The first concerns with the procedure of smart feature extraction and selection according to the proposed filter–filter–wrapper model. The model of filter–filter–wrapper is adopted to make an evaluation on the extracted feature subsets. Meanwhile, the model will determine a nonredundant feature subset, which can make a complete reflection on the differences of various types of vehicles. In the second part, an algorithm for vehicle classification according to the theoretical basis of clustering support vector machines (C‐SVMs) was established with the selected optimal feature subset. The paper also uses particle swarm optimization (PSO), with the purpose of searching for an optimal kernel parameter and the slack penalty parameter in C‐SVMs. A total of 460 samples were tested through cross validation, and the result turned out that the classification accuracy was over 99%. In summary, the test results demonstrated that our vehicle classification method could enhance the efficiency of machine‐learning‐based data mining and the accuracy of vehicle classification. Copyright © 2014 John Wiley & Sons, Ltd.     

New technology and the modeling of risk-taking behavior in congested road networks

Intelligent transport systems provide various means to improve traffic congestion in road networks. Evaluation of the benefits of these improvements requires consideration of commuters’ response to reliability and/or uncertainty of travel time under various circumstances. Various disruptions cause recurrent or non-recurrent congestion on road networks, which make road travel times intrinsically fluctuating and unpredictable. Confronted with such uncertain traffic conditions, commuters are known to develop some simple decision-making process to adjust their travel choices. This paper represents the decision-making process involved in departure-time and route choices as risk-taking behavior under uncertainty. An expected travel disutility function associated with commuters’ departure-time and route choices is formulated with taking into account the travel delay (due the recurrent congestion), the uncertainty of travel times (due to incident-induced congestion) and the consequent early or late arrival penalty. Commuters are assumed to make decision on the departure-time and route choices on the basis of the minimal expected travel disutility. Thus the network will achieve a simultaneous route and departure-time user equilibrium, in which no commuter can decrease his or her expected disutility by unilaterally changing the route or departure-time. The equilibrium is further formulated as an equivalent nonlinear complementarity problem and is then converted into an unconstrained minimization problem with the use of a gap function suggested recently. Two algorithms based on the Nelder–Mead multidimensional simplex method and the heuristic route/time-swapping approach, are adapted to solve the problem. Finally, numerical example is given to illustrate the application of the proposed model and algorithms.     

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.     

Rolling horizon stochastic optimal control strategy for ACC and CACC under uncertainty

This paper presents a rolling horizon stochastic optimal control strategy for both Adaptive Cruise Control and Cooperative Adaptive Cruise Control under uncertainty based on the constant time gap policy. Specifically, uncertainties that can arise in vehicle control systems and vehicle sensor measurements are represented as normally-distributed disturbances to state and measurement equations in a state-space formulation. Then, acceleration sequence of a controlled vehicle is determined by optimizing an objective function that captures control efficiency and driving comfort over a predictive horizon, constrained by bounded acceleration/deceleration and collision protection. The optimization problem is formulated as a linearly constrained linear quadratic Gaussian problem and solved using a separation principle, Lagrangian relaxation, and Kalman filter. A sensitivity analysis and a scenario-based analysis via simulations demonstrate that the proposed control strategy can generate smoother vehicle control and perform better than a deterministic feedback controller, particularly under small system disturbances and large measurement disturbances.     

Modeling schedule recovery processes in transit operations for bus arrival time prediction

Many existing algorithms for bus arrival time prediction assume that buses travel at free‐flow speed in the absence of congestion. As a result, delay incurred at one stop would propagate to downstream stops at the same magnitude. In reality, skilled bus operators often constantly adjust their speeds to keep their bus on schedule. This paper formulates a Markov chain model for bus arrival time prediction that explicitly captures the behavior of bus operators in actively pursuing schedule recovery. The model exhibits some desirable properties in capturing the schedule recovery process. It guarantees provision of the schedule information if the probability of recovering from the current schedule deviation is sufficiently high. The proposed model can be embedded into a transit arrival time estimation model for transit information systems that use both real‐time and schedule information. It also has the potential to be used as a decision support tool to determine when dynamic or static information should be used.     

A computationally efficient two-stage method for short-term traffic prediction on urban roads

Abstract

Short-term traffic prediction plays an important role in intelligent transport systems. This paper presents a novel two-stage prediction structure using the technique of Singular Spectrum Analysis (SSA) as a data smoothing stage to improve the prediction accuracy. Moreover, a novel prediction method named Grey System Model (GM) is introduced to reduce the dependency on method training and parameter optimisation. To demonstrate the effects of these improvements, this paper compares the prediction accuracies of SSA and non-SSA model structures using both a GM and a more conventional Seasonal Auto-Regressive Integrated Moving Average (SARIMA) prediction model. These methods were calibrated and evaluated using traffic flow data from a corridor in Central London under both normal and incident traffic conditions. The prediction accuracy comparisons show that the SSA method as a data smoothing step before the application of machine learning or statistical prediction methods can improve the final traffic prediction accuracy. In addition, the results indicate that the relatively novel GM method outperforms SARIMA under both normal and incident traffic conditions on urban roads.     

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.     

Three-phase traffic theory and two-phase models with a fundamental diagram in the light of empirical stylized facts

Despite the availability of large empirical data sets and the long history of traffic modeling, the theory of traffic congestion on freeways is still highly controversial. In this contribution, we compare Kerner’s three-phase traffic theory with the phase diagram approach for traffic models with a fundamental diagram. We discuss the inconsistent use of the term “traffic phase” and show that patterns demanded by three-phase traffic theory can be reproduced with simple two-phase models, if the model parameters are suitably specified and factors characteristic for real traffic flows are considered, such as effects of noise or heterogeneity or the actual freeway design (e.g. combinations of off- and on-ramps). Conversely, we demonstrate that models created to reproduce three-phase traffic theory create similar spatiotemporal traffic states and associated phase diagrams, no matter whether the parameters imply a fundamental diagram in equilibrium or non-unique flow-density relationships. In conclusion, there are different ways of reproducing the empirical stylized facts of spatiotemporal congestion patterns summarized in this contribution, and it appears possible to overcome the controversy by a more precise definition of the scientific terms and a more careful comparison of models and data, considering effects of the measurement process and the right level of detail in the traffic model used.