A network‐based dynamic air traffic flow model for short‐term en route traffic prediction

This paper presents a dynamic network‐based approach for short‐term air traffic flow prediction in en route airspace. A dynamic network characterizing both the topological structure of airspace and the dynamics of air traffic flow is developed, based on which the continuity equation in fluid mechanics is adopted to describe the continuous behaviour of the en route traffic. Building on the network‐based continuity equation, the space division concept in cell transmission model is introduced to discretize the proposed model both in space and time. The model parameters are sequentially updated based on the statistical properties of the recent radar data and the new predicting results. The proposed method is applied to a real data set from Shanghai Area Control Center for the short‐term air traffic flow prediction both at flight path and en route sector level. The analysis of the case study shows that the developed method can characterize well the dynamics of the en route traffic flow, thereby providing satisfactory prediction results with appropriate uncertainty limits. The mean relative prediction errors are less than 0.10 and 0.14, and the absolute errors fall in the range of 0 to 1 and 0 to 3 in more than 95% time intervals respectively, for the flight path and en route sector level. Copyright © 2017 John Wiley & Sons, Ltd.     

A model of traffic dispersion from a congested road

The study of traffic flow dynamics is developed by defining and clarifying traffic divergence, continuity, congestion and dispersion. Velocity potential is introduced as a gravity function generated by the interaction of two or more motorists occupying neighbouring points in space and describes interference to continuous traffic flow. The relationship between the potential function and carrying capacity is developed and dispersion, when considered as a random walk, satisfies a diffusion equation. A model of traffic dispersion along a maximum congested road in space and time is presented as eigenfunctions of the velocity potential. This suggests that traffic can be dispersed by a series of quantum steps. A probability density function is introduced to define the probability of locating a motorist in a congestion zone.     

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.     

Continuum modelling of spatial and dynamic equilibrium in a travel corridor with heterogeneous commuters—A partial differential complementarity system approach

This paper studies on modelling and solving spatial and dynamic equilibrium travel pattern in a travel corridor. Consider a travel corridor connecting continuously distributed commuters to the city centre. The traffic is subject to flow congestion and the commuter heterogeneity is captured. The traffic flow dynamics is described by flow continuity equation and the equilibrium travel pattern is assumed to follow trip-timing condition. The continuous spatial and dynamic equilibrium travel pattern is formulated into a partial differential complementarity system, which is then solved through Godunov scheme. The proof of solution existence is provided, and a set of numerical experiments are demonstrated.     

A stochastic model of traffic flow: Theoretical foundations

In a variety of applications of traffic flow, including traffic simulation, real-time estimation and prediction, one requires a probabilistic model of traffic flow. The usual approach to constructing such models involves the addition of random noise terms to deterministic equations, which could lead to negative traffic densities and mean dynamics that are inconsistent with the original deterministic dynamics. This paper offers a new stochastic model of traffic flow that addresses these issues. The source of randomness in the proposed model is the uncertainty inherent in driver gap choice, which is represented by random state dependent vehicle time headways. A wide range of time headway distributions is allowed. From the random time headways, counting processes are defined, which represent cumulative flows across cell boundaries in a discrete space and continuous time conservation framework. We show that our construction implicitly ensures non-negativity of traffic densities and that the fluid limit of the stochastic model is consistent with cell transmission model (CTM) based deterministic dynamics.     

The prigogine-herman kinetic model predicts widely scattered traffic flow data at high concentrations

The classical derivation of a traffic stream model (e.g. speed/concentration relation) from the equilibrium solutions of the Prigogine–Herman kinetic equation invokes the nontrivial assumption that the underlying distribution of desired speeds is nonzero for vanishingly small speeds. In this paper we investigate the situation when this assumption does not hold. It is found that the Prigogine–Herman kinetic equation has a one-parameter family of equilibrium solutions, and hence an associated traffic stream model, only for traffic concentrations below some critical value; at higher concentrations there is a two-parameter family of solutions, and hence a continuum of mean velocities for each concentration. This result holds for both constant values of the passing probability and the relaxation time, and for values that depend on concentration in the manner assumed by Prigogine and Herman. It is hypothesized that this result reflects the well-known tendency toward substantial scatter in observational data of traffic flow at high concentrations.     

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.     

Stochasticity of freeway operational capacity and chance-constrained ramp metering

The notion of capacity is essential to the planning, design, and operations of freeway systems. However, in the practice freeway capacity is commonly referred as a theoretical/design value without consideration of operational characteristics of freeways. This is evident from the Highway Capacity Manual (HCM) 2000 in that no influence from downstream traffic is considered in the definition of freeway capacity. In contrast to this definition, in this paper, we consider the impact of downstream traffic and define freeway operational capacity as the maximum hourly rate at which vehicles can be expected to traverse a point or a uniform section of a roadway under prevailing traffic flow conditions. Therefore freeway operational capacity is not a single value with theoretical notion. Rather, it changes under different traffic flow conditions. Specifically, this concept addresses the capacity loss during congested traffic conditions. We further study the stochasticity of freeway operational capacity by examining loop detector data at three specifically selected detector stations in the Twin Cities’ area. It is found that values of freeway operational capacity under different traffic flow conditions generally fit normal distributions. In recognition of the stochastic nature of freeway capacity, we propose a new chance-constrained ramp metering strategy, in which, constant capacity value is replaced by a probabilistic one that changes dynamically depending on real-time traffic conditions and acceptable probability of risk determined by traffic engineers. We then improve the Minnesota ZONE metering algorithm by applying the stochastic chance constraints and test the improved algorithm through microscopic traffic simulation. The evaluation results demonstrate varying degrees of system improvement depending on the acceptable level of risk defined.     

A dynamic traffic assignment model for the assessment of moving bottlenecks

Moving bottlenecks in highway traffic are defined as a situation in which a slow-moving vehicle, be it a truck hauling heavy equipment or an oversized vehicle, or a long convey, disrupts the continuous flow of the general traffic. The effect of moving bottlenecks on traffic flow is an important factor in the evaluation of network performance. This effect, though, cannot be assessed properly by existing transportation tools, especially when the bottleneck travels relatively long distances in the network.This paper develops a dynamic traffic assignment (DTA) model that can evaluate the effects of moving bottlenecks on network performance in terms of both travel times and traveling paths. The model assumes that the characteristics of the moving bottleneck, such as traveling path, physical dimensions, and desired speed, are predefined and, therefore, suitable for planned conveys.The DTA model is based on a mesoscopic simulation network-loading procedure with unique features that allow assessing the special dynamic characteristics of a moving bottleneck. By permitting traffic density and speed to vary along a link, the simulation can capture the queue caused by the moving bottleneck while preserving the causality principles of traffic dynamics.     

Anisotropic second-order models and associated fundamental diagrams

According to Banks [Investigation of some characteristics of congested flow. Transportation Research Record, 1999], traffic heterogeneity explains the data scattering on the flow–density plane and positive transferences within the congested phase (a transference is a line connecting adjacent points in the time series). This heterogeneity results from a traffic mixture, made up of various vehicles and drivers, or different traffic conditions such as meteorological conditions. This paper only deals with traffic mixture and more particularly with vehicle classes such as passenger car and truck, which are correlated to the vehicle length. When considering a macroscopic model, the mean vehicle length, which is measured by sensors, is associated with the truck percentage. Then the Generic Second Order Model (GSOM) by Lebacque [Lebacque, J.P., Mammar, S., Haj-Salem, H., 2007a. Generic second-order traffic flow modeling. In: Proceedings of the 17th International Symposium on Transportation and Traffic Theory, London, 23–25 July 2007, 749–770.] provides a rigorous mathematical framework for traffic heterogeneity modeling. The added value in this paper is that admissible invariants which characterize generic fundamental diagrams, possibly depending on the mean vehicle length, are interpreted and debated. Aw–Rascle–Zhang’s [Aw, A., Rascle, M., 2000. Resurrection of second-order models of traffic flow. SIAM Journal of Applied Mathematics, 60 (3), 916–938; Zhang, H.M., 2002. A non equilibrium traffic model devoid of gas-like behavior. Transportation Research Part B, 36, 275–290.] and Colombo’s [Colombo, R.M., 2002. A 2 × 2 hyperbolic traffic flow model. Mathematical and Computer Modeling, 35, 683–688.] anisotropic models are deeply analyzed from a traffic point of view. At last an extended GSOM equation system provides a full parameterization of fundamental diagrams which is needed to traffic heterogeneity modeling.     

Towards data-driven car-following models

Car following models have been studied with many diverse approaches for decades. Nowadays, technological advances have significantly improved our traffic data collection capabilities. Conventional car following models rely on mathematical formulas and are derived from traffic flow theory; a property that often makes them more restrictive. On the other hand, data-driven approaches are more flexible and allow the incorporation of additional information to the model; however, they may not provide as much insight into traffic flow theory as the traditional models. In this research, an innovative methodological framework based on a data-driven approach is proposed for the estimation of car-following models, suitable for incorporation into microscopic traffic simulation models. An existing technique, i.e. locally weighted regression (loess), is defined through an optimization problem and is employed in a novel way. The proposed methodology is demonstrated using data collected from a sequence of instrumented vehicles in Naples, Italy. Gipps’ model, one of the most extensively used car-following models, is calibrated against the same data and used as a reference benchmark. Optimization issues are raised in both cases. The obtained results suggest that data-driven car-following models could be a promising research direction.     

Analytical and grid-free solutions to the Lighthill-Whitham-Richards traffic flow model

In this article, we propose a computational method for solving the Lighthill-Whitham-Richards (LWR) partial differential equation (PDE) semi-analytically for arbitrary piecewise-constant initial and boundary conditions, and for arbitrary concave fundamental diagrams. With these assumptions, we show that the solution to the LWR PDE at any location and time can be computed exactly and semi-analytically for a very low computational cost using the cumulative number of vehicles formulation of the problem. We implement the proposed computational method on a representative traffic flow scenario to illustrate the exactness of the analytical solution. We also show that the proposed scheme can handle more complex scenarios including traffic lights or moving bottlenecks. The computational cost of the method is very favorable, and is compared with existing algorithms. A toolbox implementation available for public download is briefly described, and posted at http://traffic.berkeley.edu/project/downloads/lwrsolver.     

Analysis of Characteristics of the Dynamic Flow-Density Relation and its Application to Traffic Flow Models

Abstract

Online traffic flow modeling is of increasing importance due to intelligent transport systems and technologies. The flow-density relation plays an important role in traffic flow modeling and provides a basic way to illustrate traffic flow behavior under different traffic flow and traffic density conditions. Until now the research effort has focused mainly on the shape of the relation. The time series of the relation has not been identified clearly, even though the time series of the relation reflects the upstream/downstream traffic conditions and should be considered in the traffic flow modeling. In this paper, the dynamic flow-density relation is identified based on the classification of traffic states and is quantified employing fuzzy logic. The quantified dynamic flow-density relation builds the basis for online application of a macroscopic traffic flow model. The new approach to online modeling of traffic flow applying the dynamic flow-density relation alleviates parameter calibration problems stemming from the static flow-density relation.     

Macroscopic traffic flow propagation stability for adaptive cruise controlled vehicles

Traffic flow propagation stability is concerned about whether a traffic flow perturbation will propagate and form a traffic shockwave. In this paper, we discuss a general approach to the macroscopic traffic flow propagation stability for adaptive cruise controlled (ACC) vehicles. We present a macroscopic model with velocity saturation for traffic flow in which each individual vehicle is controlled by an adaptive cruise control spacing policy. A nonlinear traffic flow stability criterion is investigated using a wavefront expansion technique. Quantitative relationships between traffic flow stability and model parameters (such as traffic flow and speed, etc.) are derived for a generalized ACC traffic flow model. The newly derived stability results are in agreement with previously derived results that were obtained using both microscopic and macroscopic models with a constant time headway (CTH) policy. Moreover, the stability results derived in this paper provide sufficient and necessary conditions for ACC traffic flow stability and can be used to design other ACC spacing policies.     

Exploring the effects of cooperative adaptive cruise control on highway traffic flow using microscopic traffic simulation

This paper examines the impact of having cooperative adaptive cruise control (CACC) embedded vehicles on traffic flow characteristics of a multilane highway system. The study identifies how CACC vehicles affect the dynamics of traffic flow on a complex network and reduce traffic congestion resulting from the acceleration/deceleration of the operating vehicles. An agent-based microscopic traffic simulation model (Flexible Agent-based Simulator of Traffic) is designed specifically to examine the impact of these intelligent vehicles on traffic flow. The flow rate of cars, the travel time spent, and other metrics indicating the evolution of traffic congestion throughout the lifecycle of the model are analyzed. Different CACC penetration levels are studied. The results indicate a better traffic flow performance and higher capacity in the case of CACC penetration compared to the scenario without CACC-embedded vehicles.     

An alternative model in traffic flow equations

The kinetic theory for traffic flow equations can be approached using the Grad’s method. This method, which is derived from the kinetic gas theory, was developed for the Paveri-Fontana equation when a special desired velocity model is assumed. A closure relation for the set of macroscopic equations is found when the density, the average velocity and the velocity variance are the relevant variables chosen to describe the system. Simulation results are also shown and a qualitative comparison with other models in the literature is presented.     

A simple algorithm for the estimation of road traffic space mean speeds from data available to most management centres

The control of the evolution of road traffic streams is highly related to productivity, safety, sustainability and, even, comfort. Although, nowadays, the findings from research efforts and the development of new technologies enable accurate traffic forecasts in almost any conditions, these calculations are usually limited by the data and the equipment available. Most traffic management centres depend on the data provided, at best, by double-loop detectors. These loops supply time means over different aggregation periods, which are indiscriminately used as the bases for subsequent estimations. Since space mean speeds are those needed in most applications (note the fundamental relationship between flow and density in traffic flow theory), most current practice begins with an error. This paper introduces a simple algorithm that the allows estimation of space mean speeds from the data provided by the loops without the need for any additional financial outlay, as long as the traffic in each time interval of aggregation is stationary and its speed distribution is log-normal. Specifically, it is focused on the calculation of the variance of the speeds with regard to the time mean, thus making possible to use the relationship between time mean speeds and space mean speeds defined by Rakha (2005). The results obtained with real data show that the algorithm behaves well if the calculation conditions help fulfil the initial hypotheses. The primary difficulties arise with transient traffic and, in this case, other specific methodologies should be used. Data fusion seems promising in this regard. Nevertheless, it cannot be denied that the improvement provided by the algorithm turns out to be highly beneficial both when used alone in the case of stationarity or as a part of a fusion.     

On the variance of recurrent traffic flow for statistical traffic assignment

This paper generalizes and extends classical traffic assignment models to characterize the statistical features of Origin-Destination (O-D) demands, link/path flow and link/path costs, all of which vary from day to day. The generalized statistical traffic assignment (GESTA) model has a clear multi-level variance structure. Flow variance is analytically decomposed into three sources, O-D demands, route choices and measurement errors. Consequently, optimal decisions on roadway design, maintenance, operations and planning can be made using estimated probability distributions of link/path flow and system performance. The statistical equilibrium in GESTA is mathematically defined. Its multi-level statistical structure well fits large-scale data mining techniques. The embedded route choice model is consistent with the settings of O-D demands considering link costs that vary from day to day. We propose a Method of Successive Averages (MSA) based solution algorithm to solve for GESTA. Its convergence and computational complexity are analyzed. Three example networks including a large-scale network are solved to provide insights for decision making and to demonstrate computational efficiency.     

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.     

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.