An instantaneous kinematic wave theory of diverging traffic

Diverging junctions are an important type of bottlenecks, which can reduce capacities and initiate and propagate traffic congestion in a road network. In this paper, we propose a kinematic wave theory for modeling dynamics of non-cooperative diverging traffic, in which traffic dynamics of vehicles to one direction are assumed to be independent of those to other directions instantaneously. During a short time interval, the kinematic wave model of diverging traffic is decoupled into a number of nonlinear resonant systems. From analytical solutions to the Riemann problem of a decoupled system, a new definition of partial traffic demand is introduced, so that diverging flows can be easily computed with the supply–demand method. Then a Cell Transmission Model is proposed to solve the kinematic wave model of diverging traffic by taking into account of the interactions among different traffic streams. Simulation results demonstrate that vehicles follow the First-In-First-Out principle in the long run, and the model converges when we decrease the cell and time-step sizes. In addition, it is shown that traffic streams to different directions segregate in a selfish manner, and the total throughput of a diverging junction is not maximized as in existing diverge models. In the future, more theoretical and empirical studies are needed for a better understanding of this and other diverge models.     

Symmetries in the kinematic wave model and a parameter-free representation of traffic flow

This paper identifies a family of linear transformations where conservation laws are invariant. In the case of a triangular fundamental diagram, it is shown that for a subset of these transformations, flow, total distance traveled and total delay are invariant. This means that for capacity or delay computations one may choose the transformation—i.e., the shape of the triangular diagram—that simplifies the problem the most, which does not require knowing the actual fundamental diagram. This is appealing also for delay-optimizing control problems since they may be solved using an isosceles fundamental diagram, which provides the most efficient numerical methods. Examples are given.     

A kinematic wave approach to traffic statics and dynamics in a double-ring network

Recently there has been much interest in understanding macroscopic fundamental diagrams of stationary road networks. However, there lacks a systematic method to define and solve stationary states in a road network with complex junctions. In this study we propose a kinematic wave approach to defining, analyzing, and simulating static and dynamic traffic characteristics in a network of two ring roads connected by a 2 × 2 junction, which can be either an uninterrupted interchange or a signalized intersection. This study is enabled by recently developed macroscopic junction models of general junctions. With a junction model based on fair merging and first-in-first-out diverging rules, we first define and solve stationary states and then derive the macroscopic fundamental diagram (MFD) of a stationary uninterrupted network. We conclude that the flow-density relationship of the uninterrupted double-ring network is not unique for high average network densities (i.e., when one ring becomes congested) and unveil the existence of infinitely many stationary states that can arise with a zero-speed shockwave. From simulation results with a corresponding Cell Transmission Model, we verify that all stationary states in the MFD are stable and can be reached, but show that randomness in the retaining ratio of each ring drives the network to more symmetric traffic patterns and higher flow-rates. Furthermore we model a signalized intersection as two alternate diverge junctions and demonstrate that the signalized double-ring network can reach asymptotically periodic traffic patterns, which are therefore defined as “stationary” states in signalized networks. With simulations we show that the flow-density relation is well defined in such “stationary” states, and asymptotic traffic patterns can be impacted by signal cycle lengths and retaining ratios. But compared with uninterrupted interchanges, signalized intersections lead to more asymmetric traffic patterns, lower flow-rates, and even gridlocks when the average density is higher than half of the jam density. The results are consistent between this study and existing studies, but the network kinematic wave model, with appropriate junction models, is mathematically tractable and physically meaningful. It has offered a more complete picture regarding the number and type of stationary states, their stability, and MFD in freeway and signalized networks.     

An application of shock wave theory to traffic signal control

A real time control policy minimizing total intersection delays subject to queue length constraints at an isolated signalized intersection is developed in this paper. The policy is derived from a new traffic model which describes the simultaneous evolution of queue lengths of two conflicting traffic streams, controlled by a traffic light, in both time and space. The model is based on the examination of shock waves generated upstream of the stop lines by the intermittent service of traffic at the signal. The proposed policy was tested against the existing pre-timed control policy at a high volume intersection and it was found superior, especially when demands increase well above the saturation level.     

Modeling lane-changing behavior in a connected environment: A game theory approach

Vehicle-to-Vehicle communications provide the opportunity to create an internet of cars through the recent advances in communication technologies, processing power, and sensing technologies. A connected vehicle receives real-time information from surrounding vehicles; such information can improve drivers’ awareness about their surrounding traffic condition and lead to safer and more efficient driving maneuvers. Lane-changing behavior, as one of the most challenging driving maneuvers to understand and to predict, and a major source of congestion and collisions, can benefit from this additional information. This paper presents a lane-changing model based on a game-theoretical approach that endogenously accounts for the flow of information in a connected vehicular environment. A calibration approach based on the method of simulated moments is presented and a simplified version of the proposed framework is calibrated against NGSIM data. The prediction capability of the simplified model is validated. It is concluded the presented framework is capable of predicting lane-changing behavior with limitations that still need to be addressed. Finally, a simulation framework based on the fictitious play is proposed. The simulation results revealed that the presented lane-changing model provides a greater level of realism than a basic gap-acceptance model.     

Network traffic flow theory: Microscopic simulation experiments on supercomputers

Microscopic simulation experiments are conducted to investigate traffic behavior in urban networks and support the development of network-level traffic flow relations. Previous use of microscopic traffic simulation has been limited by computational resources to small networks. Supercomputers largely alleviate such limitations and allow more elaborate and realistic simulations of traffic in large networks. This paper provides computational experience in simulating large-scale urban traffic networks on a CRAY supercomputer. In addition to the computational results, the experiments address the effect of intersection traffic control on the two-fluid characterization of vehicular flow in congested networks. Evidence is provided from larger networks that supports conclusions reached in earlier work using smaller test networks.     

A queueing based traffic flow model

The assessment of uninterrupted traffic flow is traditionally based on empirical methods. We develop some analytic queueing models based on traffic counts and we model the behavior of traffic flows as a function of some of the most relevant determinants. These analytic models allow for parameterized experiments, which pave the way towards our research objectives: assessing what-if scenario’s and sensitivity analysis for traffic management, congestion control, traffic design and the environmental impact of road traffic (e.g. emission models). The impact of some crucial modeling parameters is studied in detail and links with the broader research objectives are given. We illustrate our results for a highway, based on counted traffic flows in Flanders.     

Vehicle headway modeling and its inferences in macroscopic/microscopic traffic flow theory: A survey

Vehicle headway distribution models are widely used in traffic engineering fields, since they reflect the fundamental uncertainty in drivers' car-following maneuvers and meanwhile provide a concise way to describe the stochastic feature of traffic flows. This paper presents a systematic review of vehicle headway distribution studies in the last few decades. Since it is impossible to enumerate the merits and drawbacks of all of existing distribution models, we emphasize four advances of headway distribution modeling in this paper. First, we highlight the chronicle of key assumptions on the existing distribution models and explain why this evolution occurs. Second, we show that departure headways measured for interrupted flows on urban streets and headways measured for uninterrupted flows on freeways have common features and can be simulated by a unified microscopic car-following model. The interesting finding helps gather two kinds of headway distribution models under one umbrella. Third, we review different approaches that aim to link microscopic car-following models and mesoscopic vehicle headway distribution models. Fourth, we show that both the point scattering on the density-flow plot and the shape of traffic flow breakdown curve implicitly depend on the vehicular headway distribution. These findings reveal pervasive connections between macroscopic traffic flow models and mesoscopic headway distribution. All these new insights bring new vigor into vehicle headway studies and open research frontiers in this field.     

A flexible traffic stream model and its three representations of traffic flow

To connect microscopic driving behaviors with the macro-correspondence (i.e., the fundamental diagram), this study proposes a flexible traffic stream model, which is derived from a novel car-following model under steady-state conditions. Its four driving behavior-related parameters, i.e., reaction time, calmness parameter, speed- and spacing-related sensitivities, have an apparent effect in shaping the fundamental diagram. Its boundary conditions and homogenous case are also analyzed in detail and compared with other two models (i.e., Longitudinal Control Model and Intelligent Driver Model). Especially, these model formulations and properties under Lagrangian coordinates provide a new perspective to revisit the traffic flow and complement with those under Eulerian coordinate. One calibration methodology that incorporates the monkey algorithm with dynamic adaptation is employed to calibrate this model, based on real-field data from a wide range of locations. Results show that this model exhibits the well flexibility to fit these traffic data and performs better than other nine models. Finally, a concrete example of transportation application is designed, in which the impact of three critical parameters on vehicle trajectories and shock waves with three representations (i.e., respectively defined in x-t, n-t and x-n coordinates) is tested, and macro- and micro-solutions on shock waves well agree with each other. In summary, this traffic stream model with the advantages of flexibility and efficiency has the good potential in level of service analysis and transportation planning.     

A model for the structure of lane-changing decisions

A structure is proposed to connect the decisions which a driver has to make before changing lanes. The model is intended to cover the urban driving situation, where traffic signals, obstructions and heavy vehicles all exert an influence. The structure is designed to ensure that the vehicles in traffic simulations behave logically when confronted with situations commonly encountered in real traffic. The specific mathematical expression of the questions embedded in the decision process and employed in the present implementation of the model are not critical and can be replaced by alternatives, but the heirarchy of the decisions is crucial. On the basis of experience to date, the lane changing model produces a realistic simulation of driver behaviour and has proved very robust under a wide range of conditions.     

A traffic flow simulator for network reliability assessment

This paper investigates the transportation network reliability based on the information provided by detectors installed on some links. A traffic flow simulator (TFS) model is formulated for assessing the network reliability (in terms of travel time reliability), in which the variation of perceived travel time error and the fluctuations of origin-destination (OD) demand are explicitly considered. On the basis of prior OD demand and partial updated detector data, the TFS can estimate the link flows for the whole network together with link/path travel times, and their variance and covariance. The travel time reliability by OD pair can also be assessed and the OD matrix can be updated simultaneously. A Monte Carlo based algorithm is developed to solve the TFS model. The application of the proposed TFS model is illustrated by a numerical example.     

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.     

A microscopic analysis of speed deviation impacts on lane-changing behavior

Driving behavior models that capture drivers’ tactical maneuvering decisions in different traffic conditions are essential to microscopic traffic simulation systems. This paper focuses on a parameter that has a great impact on road users’ aggressive overtaking maneuvers and directly affects lane-changing models (an integral part of microscopic traffic simulation models), namely, speed deviation. The objective of this research is to investigate the impacts of speed deviation in terms of performance measures (delay time, network mean speed, and travel time duration) and the number of lane-change maneuvers using the Aimsun traffic simulator. Following calibration of the model for a section of urban highway in Tehran, this paper explores the sensitivity of lane-changing maneuvers during different speed deviations by conducting two types of test. Simulation results show that, by decreasing speed deviation, the number of lane changes reduces remarkably and so network safety increases, thus reducing travel time due to an increase in network mean speed.     

Continuum theory for pedestrian traffic flow: Local route choice modelling and its implications

This contribution puts forward a novel multi-class continuum model that captures some of the key dynamic features of pedestrian flows. It considers route choice behaviour on both the strategic (pre-trip) and tactical (en-route) level. To achieve this, we put forward a class-specific equilibrium direction relation of the pedestrians, which is governed by two parts: one part describing the global route choice, which is pre-determined based on the expectations of the pedestrians, and one part describing the local route choice, which is a density-gradient dependent term that reflects local adaptations based on prevailing flow conditions.Including the local route choice term in the multi-class model causes first of all dispersion of the flow: pedestrians will move away from high density areas in order to reduce their overall walking costs. Second of all, for the crossing flow and bi-directional flow cases, local route choice causes well known self-organised patterns to emerge (i.e. diagonal stripes and bi-directional lanes). We study under which demand conditions self-organisation occurs and fails, as well as what the impact is of the choices of the different model parameters. In particular, the differences in the weights reflecting the impact of the own and the other classes appear to have a very strong impact on the self-organisation process.     

A dynamic lane-changing trajectory planning model for automated vehicles

This paper focuses on the lane-changing trajectory planning (LTP) process in the automatic driving technologies. Existing studies on the LTP algorithms are primarily the static planning method in which the states of the surrounding vehicles of a lane-changing vehicle are assumed to keep unchanged in the whole lane-changing process. However, in real-world traffic, the velocities of the surrounding vehicles change dynamically, and the lane-changing vehicle needs to adjust its velocity and positions correspondingly in real-time to maintain safety. To address such limitations, the dynamic lane-changing trajectory planning (DLTP) model is proposed in the limited literature. This paper proposes a novel DLTP model consisting of the lane-changing starting-point determination module, trajectory decision module and trajectory generation module. The model adopts a time-independent polynomial trajectory curve to avoid the unrealistic assumptions on lane-changing velocities and accelerations in the existing DLTP model. Moreover, a rollover-avoidance algorithm and a collision-avoidance algorithm containing a reaction time are presented to guarantee the lane-changing safety of automated vehicles, even in an emergent braking situation. The field lane-changing data from NGSIM data are used to construct a real traffic environment for lane-changing vehicles and verify the effectiveness of the proposed model, and CarSim is applied to investigate the traceability of the planned lane-changing trajectories using the proposed model. The results indicate that an automated vehicle can complete the lane-changing process smoothly, efficiently and safely following the trajectory planned by the proposed model, and the planned velocity and trajectory can be well-tracked by automated vehicles.     

A phenomenological model for dynamic traffic flow in networks

A macroscopic model for dynamic traffic flow is presented. The main goal of the model is the real time simulation of large freeway networks with multiple sources and sinks. First, we introduce the model in its discrete formulation and consider some of its properties. It turns out, that our non-hydrodynamical ansatz for the flows results in a very advantageous behavior of the model. Next the fitting conditions at junctions of a traffic network are discussed. In the following sections we carry out a continuous approximation of our discrete model in order to derive stationary solutions and to consider the stability of the homogeneous one. It turns out, that for certain conditions unstable traffic flow occurs. In a subsequent section, we compare the stability of the discrete model and the corresponding continuous approximation. This confirms in retrospection the close similarities of both model versions. Finally we compare the results of our model with the results of another macroscopic model, that was recently suggested by Kerner and Konhäuser [Phys. Rev. E 48, 2335–2338 (1993)].     

A path-based flow formulation for the traffic assignment problem

In order to improve cooperation between traffic management and travelers, traffic assignment is the key component to achieve the objectives of both traffic management and route choice decisions for travelers. Traffic assignment can be classified into two models based on the behavioral assumptions governing route choices: User Equilibrium (UE) and System Optimum (SO) traffic assignment. According to UE and SO traffic assignment, travelers usually compete to choose the least cost routes to minimize their own travel costs, while SO traffic assignment requires travelers to work cooperatively to minimize overall cost in the road network. Thus, the paradox of benefits between UE and SO indicates that both are not practical. Thus, a solution technique needs to be proposed to balance UE and SO models, which can compromise both sides and give more feasible traffic assignments. In this paper, Stackelberg game theory is introduced to the traffic assignment problem, which can achieve the trade-off process between traffic management and travelers. Since traditional traffic assignments have low convergence rates, the gradient projection algorithm is proposed to improve efficiency.     

Discontinuities in the Lagrangian formulation of the kinematic wave model

In this article we demonstrate how network components can be modeled using the kinematic wave model in the Lagrangian formulation. This includes modeling nodes (or discontinuities) such as inflow and outflow boundaries, merges and bifurcations (e.g. ramps) and nonhomogeneous roads. Nodes are usually fixed in space. This makes their implementation in Lagrangian coordinates where the coordinates move with the vehicle more complex than in Eulerian coordinates where the coordinates are fixed in space. To this end we derive an analytical node model. The article then discusses how to implement such sink and source terms in a discretized version of the kinematic wave model in Lagrangian coordinates. In this implementation several choices have to be made. Test results show that even with the most simple choices (discretization based on full vehicle groups and discrete time steps) accurate and plausible results are obtained. We conclude that the Lagrangian formulation can successfully be applied for simulation of networks of nonhomogeneous roads.     

The kinematic wave model with finite decelerations: A social force car-following model approximation

This paper derives a five-parameter social force car-following model that converges to the kinematic wave model with triangular fundamental diagram. Analytical solutions for vehicle trajectories are found for the lead-vehicle problem, which exhibit clockwise and counter-clockwise hysteresis depending on the model’s parameters and the lead vehicle trajectory. When coupled with a stochastic vehicle dynamics module, the model is able to reproduce periods and amplitudes of stop-and-go waves, as reported in the field. The model’s stability conditions are analysed and its trajectories are compared to real data.