Dynamic network traffic control

This study developed a dynamic traffic control formulation designated as dynamic intersection signal control optimization (DISCO). Traffic in DISCO is modeled after the cell-transmission model (CTM), which is a convergent numerical approximation to the hydrodynamic model of traffic flow. It considers the entire fundamental diagram and captures traffic phenomena such as shockwaves and queue dynamics. As a dynamic approach, the formulation derives dynamic timing plans for time-variant traffic patterns. We solved DISCO based on a genetic algorithm (GA) approach and applied it to a traffic black spot in Hong Kong that is notorious for severe congestion. For performance comparisons, we also applied TRANSYT to the same scenarios. The Results showed that DISCO outperformed TRANSYT for all the scenarios tested especially in congested traffic. For the congested scenarios, DISCO could reduce delay by as much as 33% when compared with TRANSYT. Even for the uncongested scenarios, DISCO’s delays could be smaller by as much as 23%.     

The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation

In this paper, a dynamic user equilibrium traffic assignment model with simultaneous departure time/route choices and elastic demands is formulated as an arc-based nonlinear complementarity problem on congested traffic networks. The four objectives of this paper are (1) to develop an arc-based formulation which obviates the use of path-specific variables, (2) to establish existence of a dynamic user equilibrium solution to the model using Brouwer's fixed-point theorem, (3) to show that the vectors of total arc inflows and associated minimum unit travel costs are unique by imposing strict monotonicity conditions on the arc travel cost and demand functions along with a smoothness condition on the equilibria, and (4) to develop a heuristic algorithm that requires neither a path enumeration nor a storage of path-specific flow and cost information. Computational results are presented for a simple test network with 4 arcs, 3 nodes, and 2 origin–destination pairs over the time interval of 120 periods.     

Multi-commodity traffic assignment by continuum approximation of network flow with variable demand

Consider a city with several highly compact central business districts (CBD), and the commuters’ destinations from each of them are dispersed over the whole city. Since at a particular location inside the city the traffic movements from different CBDs share the same space and do not cancel out each other as in conventional fluid flow problems albeit travelling in different directions, the traffic flows from a CBD to the destinations over the city are considered as one commodity. The interaction of the traffic flows among different commodities is governed by a cost–flow relationship. The case of variable demand is considered. The primal formulation of the continuum equilibrium model is given and proved to satisfy the user optimal conditions, and the dual formulation of the problem and its complementary conditions are also discussed. A finite element method is then employed to solve the continuum problem. A numerical example is given to illustrate the effectiveness of the proposed method.     

A platoon based cooperative eco-driving model for mixed automated and human-driven vehicles at a signalised intersection

The advancements in communication and sensing technologies can be exploited to assist the drivers in making better decisions. In this paper, we consider the design of a real-time cooperative eco-driving strategy for a group of vehicles with mixed automated vehicles (AVs) and human-driven vehicles (HVs). The lead vehicles in the platoon can receive the signal phase and timing information via vehicle-to-infrastructure (V2I) communication and the traffic states of both the preceding vehicle and current platoon via vehicle-to-vehicle (V2V) communication. We propose a receding horizon model predictive control (MPC) method to minimise the fuel consumption for platoons and drive the platoons to pass the intersection on a green phase. The method is then extended to dynamic platoon splitting and merging rules for cooperation among AVs and HVs in response to the high variation in urban traffic flow. Extensive simulation tests are also conducted to demonstrate the performance of the model in various conditions in the mixed traffic flow and different penetration rates of AVs. Our model shows that the cooperation between AVs and HVs can further smooth out the trajectory of the latter and reduce the fuel consumption of the entire traffic system, especially for the low penetration of AVs. It is noteworthy that the proposed model does not compromise the traffic efficiency and the driving comfort while achieving the eco-driving strategy.     

The variational formulation of a non-equilibrium traffic flow model: Theory and implications

The analysis and numerical solution of non-equilibrium traffic flow models in current literature are almost exclusively carried out in the hyperbolic conservation law framework, which requires a good understanding of the delicate and non-trivial Riemann problems for conservation laws. In this paper, we present a novel formulation of certain non-equilibrium traffic flow models based on their isomorphic relation with optimal control problems. This formulation extends the minimum principle observed by the LWR model. We demonstrate that with the new formulation, generic initial-boundary conditions can be conveniently handled and a simplified numerical solution scheme for non-equilibrium models can be devised. Besides deriving the variational formulation, we provide a comprehensive discussion on its mathematical properties and physical implications.     

On the kinematics and quantum dynamics of traffic flow

The hydrodynamic model of traffic flow is presented and interpreted. Traffic dimensions are defined for the dynamic entities of flow and the behaviour of congestive and dispersive flow is discussed dependent on the value of the local traffic transfer number, R. The wave equation is one example of dispersive flow, where quantum numbers define the condition of free flow at the endpoints of the link. The Schrödinger equation is defined and applied to the study of the cyclic work journey and the problem of traffic lights as an harmonic oscillator.     

A macroscopic theory for unsignalized intersections

The following paper presents a dynamic macroscopic model for unsignalized intersections which accounts for time-limited disruptions in the minor stream flow, even in free-flow conditions when the average flow demand is satisfied. It introduces a deterministic fictive traffic light to represent an average alternating sequence of available and busy time periods for insertion depending on the major stream flow. Two allocation schemes of the total outflow during green periods are developed to model the influence or non-influence of the minor stream over the major stream flow. The aggregation of the resulting dynamic flow variations gives relevant capacity values. Moreover, the model predicts accurate average vehicle delay and queue length estimates compared to theoretical and empirical data. It has three easy-to-measure parameters and can be integrated into a dynamic macroscopic simulation tool for urban networks.     

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.     

Congestion-aware system optimal route choice for shared autonomous vehicles

We study the shared autonomous vehicle (SAV) routing problem while considering congestion. SAVs essentially provide a dial-a-ride service to travelers, but the large number of vehicles involved (tens of thousands of SAVs to replace personal vehicles) results in SAV routing causing significant congestion. We combine the dial-a-ride service constraints with the linear program for system optimal dynamic traffic assignment, resulting in a congestion-aware formulation of the SAV routing problem. Traffic flow is modeled through the link transmission model, an approximate solution to the kinematic wave theory of traffic flow. SAVs interact with travelers at origins and destinations. Due to the large number of vehicles involved, we use a continuous approximation of flow to formulate a linear program. Optimal solutions demonstrate that peak hour demand is likely to have greater waiting and in-vehicle travel times than off-peak demand due to congestion. SAV travel times were only slightly greater than system optimal personal vehicle route choice. In addition, solutions can determine the optimal fleet size to minimize congestion or maximize service.     

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)].     

Dynamic system-optimal traffic assignment using a state space model

We propose a new mathematical formulation for the problem of optimal traffic assignment in dynamic networks with multiple origins and destinations. This problem is motivated by route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment. We assume that the network is subject to known time-varying demands for travel between its origins and destinations during a given time horizon. The objective is to assign the vehicles to links over time so as to minimize the total travel time experienced by all the vehicles using the network. We model the traffic network over the time horizon as a discrete-time dynamical system. The system state at each time instant is defined in a way that, without loss of optimality, avoids complete microscopic detail by grouping vehicles into platoons irrespective of origin node and time of entry to network. Moreover, the formulation contains no explicit path enumeration. The state transition function can model link travel times by either impedance functions, link outflow functions, or by a combination of both. Two versions (with different boundary conditions) of the problem of optimal traffic assignment are studied in the context of this model. These optimization problems are optimal control problems for nonlinear discrete-time dynamical systems, and thus they are amenable to algorithmic solutions based on dynamic programming. The computational challenges associated with the exact solution of these problems are discussed and some heuristics are proposed.     

Including heavy vehicles in a car‐following model: modelling,calibrating and validating

Heavy vehicles influence general traffic in many different ways compared with passenger vehicles, and this may result in different levels of traffic instability. Increases in the number and proportion of heavy vehicles in the traffic stream will therefore result in different traffic flow conditions. This research initially outlines the different car‐following behaviour of drivers in congested heterogeneous traffic conditions indicating the necessity for developing a car‐following model, which includes these differences. A psychophysical car‐following model, similar in form to Weideman's car‐following model, was developed. Due to the complexity of the developed model, the calibration of the model was undertaken using a particle swarm optimisation algorithm with the data recorded under congested traffic conditions. This was then incorporated into a traffic microsimulation model. The results showed that the car‐following perceptual thresholds and thus action points of drivers differ based on their vehicle and the lead vehicle types. The inclusion of the heavy vehicles in the model showed significant impacts on the traffic dynamic and interactions amongst different vehicles. Copyright © 2016 John Wiley & Sons, Ltd.     

Modeling the impacts of mandatory and discretionary lane-changing maneuvers

In this paper, a novel mesoscopic multilane model is proposed to enable simultaneous simulation of mandatory and discretionary lane-changing behaviors to realistically capture multilane traffic dynamics. The model considers lane specific fundamental diagrams to simulate dynamic heterogeneous lane flow distributions on expressways. Moreover, different priority levels are identified according to different lane-changing motivations and the corresponding levels of urgency. Then, an algorithm is proposed to estimate the dynamic mandatory and discretionary lane-changing demands. Finally, the lane flow propagation is defined by the reaction law of the demand–supply functions, which can be regarded as an extension of the Incremental-Transfer and/or Priority Incremental-Transfer principles. The proposed mesoscopic multilane cell transmission model is calibrated and validated on a complex weaving section of the State Route 241 freeway in Orange County, California, showing both the positive and negative impact of lane changing maneuvers, e.g., balancing effect and capacity drop, respectively. Moreover, the empirical study verifies that the model requires no additional data other than the cell transmission model does. Thus, the proposed model can be deployed as a simple simulation tool for accessing dynamic mesoscopic multilane traffic state from data available to most management centers, and also the potential application in predicting the impact of traffic incident or lane control strategy.     

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.     

Dynamic model of activity-type choice and scheduling

This paper presents a model for the choice of activity-type and timing, incorporating the dynamics of scheduling, estimated on a six-week travel diary. The main focus of the study is the inclusion of past history of activity involvement and its influence on current activity choice. The econometric formulation adopted, explicitly accounts both for correlation across alternatives and for state dependency. The results indicate that behavioral variables are superior to socio-economic variables and that consideration of the correlation pattern over alternatives clearly improves the fit of the model. This is a first but significant contribution to changing the current static demand models into dynamic activity based ones. The availability of other multi-week travel surveys and the progress made recently on advanced econometric techniques should encourage the transferability of this study to different regions or model scale.     

A kinematic wave theory of lane-changing traffic flow

Frequent lane-changes in highway merging, diverging, and weaving areas could disrupt traffic flow and, even worse, lead to accidents. In this paper, we propose a simple model for studying bottleneck effects of lane-changing traffic and aggregate traffic dynamics of a roadway with lane-changing areas. Based on the observation that, when changing its lane, a vehicle affects traffic on both its current and target lanes, we propose to capture such lateral interactions by introducing a new lane-changing intensity variable. With a modified fundamental diagram, we are able to study the impacts of lane-changing traffic on overall traffic flow. In addition, the corresponding traffic dynamics can be described with a simple kinematic wave model. For a location-dependent lane-changing intensity variable, we discuss kinematic wave solutions of the Riemann problem of the new model and introduce a supply–demand method for its numerical solutions. With both theoretical and empirical analysis, we demonstrate that lane-changes could have significant bottleneck effects on overall traffic flow. In the future, we will be interested in studying lane-changing intensities for different road geometries, locations, on-ramp/off-ramp flows, as well as traffic conditions. The new modeling framework could be helpful for developing ramp-metering and other lane management strategies to mitigate the bottleneck effects of lane-changes.     

A cell transmission model for dynamic lane reversal with autonomous vehicles

Autonomous vehicles admit consideration of novel traffic behaviors such as reservation-based intersection controls and dynamic lane reversal. We present a cell transmission model formulation for dynamic lane reversal. For deterministic demand, we formulate the dynamic lane reversal control problem for a single link as an integer program and derive theoretical results. In reality, demand is not known perfectly at arbitrary times in the future. To address stochastic demand, we present a Markov decision process formulation. Due to the large state size, the Markov decision process is intractable. However, based on theoretical results from the integer program, we derive an effective heuristic. We demonstrate significant improvements over a fixed lane configuration both on a single bottleneck link with varying demands, and on the downtown Austin network.     

Iterative procedure for equilibrium network traffic signal setting

The Equilibrium Network Traffic Signal Setting problem is an open research area. It can be approached using global optimization models or iterative procedures. In this paper, after a brief review of the state of the art, the main characteristics of the iterative procedure ENETS are described. In this procedure, traffic signal setting is performed in two successive steps: green timing and scheduling at each junction, and signal coordination on the network. Green timing and scheduling at a single junction is based on a mixed-binary linear program with capacity factor maximization. Signal coordination for the whole network is performed by solving a discrete programming model with total delay minimization. The flow assignment stage refers to the separable user equilibrium model with fixed demand, and uses a feasible direction algorithm, which can also be adopted to cover the cases of elastic demand and/or asymmetric equilibrium. An experimental test of ENETS on a small network and a graphical explanation of the procedure are described and discussed.     

A predictive dynamic traffic assignment model in congested capacity-constrained road networks

In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method.