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.     

Controller design for gating traffic control in presence of time-delay in urban road networks

Recent studies demonstrated the efficiency of feedback-based gating control in mitigating congestion in urban networks by exploiting the notion of macroscopic or network fundamental diagram (MFD or NFD). The employed feedback regulator of proportional-integral (PI)-type targets an operating NFD point of maximum throughput to enhance the mobility in the urban road network during the peak period, under saturated traffic conditions. In previous studies, gating was applied directly at the border of the protected network (PN), i.e. the network part to be protected from over-saturation. In this work, the recently developed feedback-based gating concept is applied at junctions located further upstream of the PN. This induces a time-delay, which corresponds to the travel time needed for gated vehicles to approach the PN. The resulting extended feedback control problem can be also tackled by use of a PI-type regulator, albeit with different gain values compared to the case without time-delay. Detailed procedures regarding the appropriate design of related feedback regulators are provided. In addition, the developed feedback concept is shown to work properly with very long time-steps as well. A large part of the Chania, Greece, urban network, modelled in a microscopic simulation environment under realistic traffic conditions, is used as test-bed in this study. The reported results demonstrate a stable and efficient behaviour and improved mobility of the overall network in terms of mean speed and travel time.     

Agent-based network transmission model using the properties of macroscopic fundamental diagram

The field of research that has recently come to the fore is the perimeter control, which aims to control traffic demand for a large urban area prior to controlling internal flow inside the area. Such control concept needs to be tested by simulations, hence, it is necessary to develop a model that can appropriately estimate the network-wide flow dynamics. In this paper, agent-based network transmission model (ANTM) is proposed for describing the aggregated flow dynamics over an urban area of multiple large-scale networks. The proposed model is the combination of the cell transmission model (CTM), macroscopic fundamental diagram (MFD), and agent concept. The CTM-based simulation is adopted for the simplicity considering the computation requirements for real-time feasibility. The MFD concept is applied for representing the network properties, and a new approach is taken particularly for estimating network outflow affected by both demand patterns and boundary capacity. The agent concept is applied for representing drivers’ travel behaviors. The model is compared with microscopic simulations and shows reasonable accuracy for large areas. In addition, various travel direction choice behaviors are applicable to this model. Various perimeter control policies are applicable as well, thus, the proposed model can be a useful tool for testing various control methods, in terms of reducing the congestion in urban areas.     

Modeling and simulation of vehicle projection arrival–discharge process in adaptive traffic signal controls

Real‐time signal control operates as a function of the vehicular arrival and discharge process to satisfy a pre‐specified operational performance. This process is often predicted based on loop detectors placed upstream of the signal. In our newly developed signal control for diamond interchanges, a microscopic model is proposed to estimate traffic flows at the stop‐line. The model considers the traffic dynamics of vehicular detection, arrivals, and departures, by taking into account varying speeds, length of queues, and signal control. As the signal control is optimized over a rolling horizon that is divided into intervals, the vehicular detection for and projection into the corresponding horizon intervals are also modeled. The signal control algorithm is based on dynamic programming and the optimization of signal policy is performed using a certain performance measure involving delays, queue lengths, and queue storage ratios. The arrival–discharge model is embedded in the optimization algorithm and both are programmed into AIMSUN, a microscopic stochastic simulation program. AIMSUN is then used to simulate the traffic flow and implement the optimal signal control by accessing internal data including detected traffic demand and vehicle speeds. Sensitivity analysis is conducted to study the effect of selecting different optimization criteria on the signal control performance. It is concluded that the queue length and queue storage ratio are the most appropriate performance measures in real‐time signal control of interchanges. Copyright © 2010 John Wiley & Sons, Ltd.     

Improving noise assessment at intersections by modeling traffic dynamics

Three families of road noise prediction models can be distinguished. Static noise models only consider free-flow constant-speed traffic with uniformly distributed vehicles. Analytic noise models assume that all vehicles are isolated from one another but account for their mean kinematic profile over the network. Micro-simulation noise models relax the hypothesis of no interaction between vehicles and fully capture traffic flow dynamic effects such as queue evolution. This study compares the noise levels obtained by these three methodologies at signalized intersections and roundabouts. It reveals that micro-simulation noise models outperform the other approaches. Particularly, they are able to capture the effects of stochastic transient queues in under-saturated conditions as well as stop-and-go behaviors in oversaturated regime. Accounting for traffic dynamics is also shown to improve predictions of noise variations due to different junction layouts. In this paper, a roundabout is found to induce a 2.5 dB(A) noise reduction compared to a signalized intersection in under-saturated conditions while the acoustic contributions of both kinds of junctions balance in oversaturated regime.     

Hierarchical perimeter control with guaranteed stability for dynamically coupled heterogeneous urban traffic

Perimeter control based on the Macroscopic Fundamental Diagram (MFD) is widely developed for alleviating or postponing congestion in a protected region. Recent studies reveal that traffic conditions might not be improved if the perimeter control strategies are applied to unstable systems where high demand generates heavy and heterogeneously distributed traffic congestion. Therefore, considering stability of the targeted traffic system is essential, for the sake of developing a feasible and then optimal control strategy. This paper sheds light on this direction. It integrates a stability characterization algorithm of MFD system equations into the Model Predictive Control (MPC) scheme, and features respectively an upper and a lower bound of the feasible control inputs, to guarantee system stability. Firstly, the dynamics of traffic heterogeneity and its effect on the MFD are analyzed, using real data from Guangzhou in China. Piecewise affine functions of average flow are proposed to capture traffic heterogeneity in both regional and subregional MFDs. Secondly, stability of a three-state two-region system is investigated via stable equilibrium and surface boundaries analysis. Finally, a three-layer hierarchical control strategy is introduced for the studied two-region heterogeneous urban networks. The first layer of the controller calculates the stable surface boundaries for the given traffic demands and then determines the bounds of control input (split rate). An MPC approach in the second layer is used to solve an optimization problem with two objectives of minimizing total network delay and maximizing network throughput. Heterogeneity among the subregions is minimized in the last layer by implementing simultaneously a subregional perimeter flow control and an internal flow control. The effectiveness and stability of the proposed control approach are verified by comparison with four existing perimeter control strategies.     

Statistical characteristics of transitional queue conditions in signalized arterials

The performance of signalized arterials is related to queuing phenomena. The paper investigates the effect of transitional traffic flow conditions imposed by the formation and dissipation of queues. A cross-recurrence quantification analysis combined with Bayesian augmented networks are implemented to reveal the prevailing statistical characteristics of the short-term traffic flow patterns under the effect of transitional queue conditions. Results indicate that transitions between free-flow conditions, critical queue conditions that exceed the detector’s length, as well as the occurrence of spillovers impose a set of prevailing traffic flow patterns with different statistical characteristics with respect to determinism, nonlinearity, non-stationarity and laminarity. The complexity in critical queue conditions is further investigated by introducing two supplementary regions in the critical area before spillover occurrence. Results indicate that the supplementary information on the transitional conditions in the critical area increases the accuracy of the predictive relations between the statistical characteristics of traffic flow evolution and the occurrence of transitions.     

Model based urban traffic control,part II: Coordinated model predictive controllers

The present paper describes how to use coordination between neighbouring intersections in order to improve the performance of urban traffic controllers. Both the local MPC (LMPC) introduced in the companion paper (Hao et al., 2018) and the coordinated MPC (CMPC) introduced in this paper use the urban cell transmission model (UCTM) (Hao et al., 2018) in order to predict the average delay of vehicles in the upstream links of each intersection, for different scenarios of switching times of the traffic lights at that intersection. The feedback controller selects the next switching times of the traffic light corresponding to the shortest predicted average delay. While the local MPC (Hao et al., 2018) only uses local measurements of traffic in the links connected to the intersection in comparing the performance of different scenarios, the CMPC approach improves the accuracy of the performance predictions by allowing a control agent to exchange information about planned switching times with control agents at all neighbouring intersections. Compared to local MPC the offline information on average flow rates from neighbouring intersections is replaced in coordinated MPC by additional online information on when the neighbouring intersections plan to send vehicles to the intersection under control. To achieve good coordination planned switching times should not change too often, hence a cost for changing planned schedules from one decision time to the next decision time is added to the cost function. In order to improve the stability properties of CMPC a prediction of the sum of squared queue sizes is used whenever some downstream queues of an intersection become too long. Only scenarios that decrease this sum of squares of local queues are considered for possible implementation. This stabilization criterion is shown experimentally to further improve the performance of our controller. In particular it leads to a significant reduction of the queues that build up at the edges of the traffic region under control. We compare via simulation the average delay of vehicles travelling on a simple 4 by 4 Manhattan grid, for traffic lights with pre-timed control, traffic lights using the local MPC controller (Hao et al., 2018), and coordinated MPC (with and without the stabilizing condition). These simulations show that the proposed CMPC achieves a significant reduction in delay for different traffic conditions in comparison to these other strategies.     

An optimization method for sustainable traffic control in urban areas

The optimization of traffic signalization in urban areas is formulated as a problem of finding the cycle length, the green times and the offset of traffic signals that minimize an objective function of performance indices. Typical approaches to this optimization problem include the maximization of traffic throughput or the minimization of vehicles’ delays, number of stops, fuel consumption, etc. Dynamic Traffic Assignment (DTA) models are widely used for online and offline applications for efficient deployment of traffic control strategies and the evaluation of traffic management schemes and policies. We propose an optimization method for combining dynamic traffic assignment and network control by minimizing the risk of potential loss induced to travelers by exceeding their budgeted travel time as a result of deployed traffic signal settings, using the Conditional Value-at-Risk model. The proposed methodology can be easily implemented by researchers or practitioners to evaluate their alternative strategies and aid them to choose the alternative with less potential risk. The traffic signal optimization procedure is implemented in TRANSYT-7F and the dynamic propagation and route choice of vehicles is simulated with a mesoscopic dynamic traffic assignment tool (DTALite) with fixed temporal demand and network characteristics. The proposed approach is applied to a reference test network used by many researchers for verification purposes. Numerical experiments provide evidence of the advantages of this optimization method with respect to conventional optimization techniques. The overall benefit to the performance of the network is evaluated with a Conditional Value-at-Risk Analysis where the optimal solution is the one presenting the least risk for ‘guaranteed’ total travel times.     

Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm

This paper investigates a traffic volume control scheme for a dynamic traffic network model which aims to ensure that traffic volumes on specified links do not exceed preferred levels. The problem is formulated as a dynamic user equilibrium problem with side constraints (DUE-SC) in which the side constraints represent the restrictions on the traffic volumes. Travelers choose their departure times and routes to minimize their generalized travel costs, which include early/late arrival penalties. An infinite-dimensional variational inequality (VI) is formulated to model the DUE-SC. Based on this VI formulation, we establish an existence result for the DUE-SC by showing that the VI admits at least one solution. To analyze the necessary condition for the DUE-SC, we restate the VI as an equivalent optimal control problem. The Lagrange multipliers associated with the side constraints as derived from the optimality condition of the DUE-SC provide the traffic volume control scheme. The control scheme can be interpreted as additional travel delays (either tolls or access delays) imposed upon drivers for using the controlled links. This additional delay term derived from the Lagrange multiplier is compared with its counterpart in a static user equilibrium assignment model. If the side constraint is chosen as the storage capacity of a link, the additional delay can be viewed as the effort needed to prevent the link from spillback. Under this circumstance, it is found that the flow is incompressible when the link traffic volume is equal to its storage capacity. An algorithm based on Euler’s discretization scheme and nonlinear programming is proposed to solve the DUE-SC. Numerical examples are presented to illustrate the mechanism of the proposed traffic volume control scheme.     

Marginal cost congestion pricing based on the network fundamental diagram

Congestion pricing schemes have been traditionally derived based on analytical representations of travel demand and traffic flows, such as in bottleneck models. A major limitation of these models, especially when applied to urban networks, is the inconsistency with traffic dynamics and related phenomena such as hysteresis and the capacity drop. In this study we propose a new method to derive time-varying tolling schemes using the concept of the Network Fundamental Diagram (NFD). The adopted method is based on marginal cost pricing, while it also enables to account realistically for the dynamics of large and heterogeneous traffic networks. We derive two alternative cordon tolls using network-aggregated traffic flow conditions: a step toll that neglects the spatial distribution of traffic by simply associating the marginal costs of any decrease in production within the NFD to the surplus of traffic; and a step toll that explicitly accounts for how network performance is also influenced by the spatial variance in a 3D-NFD. This pricing framework is implemented in the agent-based simulation model MATSim and applied to a case study of the city of Zurich. The tolling schemes are compared with a uniform toll, and they highlight how the inhomogeneous distribution of traffic may compromise the effectiveness of cordon tolls.     

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.     

Dynamics of heterogeneity in urban networks: aggregated traffic modeling and hierarchical control

Real traffic data and simulation analysis reveal that for some urban networks a well-defined Macroscopic Fundamental Diagram (MFD) exists, which provides a unimodal and low-scatter relationship between the network vehicle density and outflow. Recent studies demonstrate that link density heterogeneity plays a significant role in the shape and scatter level of MFD and can cause hysteresis loops that influence the network performance. Evidently, a more homogeneous network in terms of link density can result in higher network outflow, which implies a network performance improvement. In this article, we introduce two aggregated models, region- and subregion-based MFDs, to study the dynamics of heterogeneity and how they can affect the accuracy scatter and hysteresis of a multi-subregion MFD model. We also introduce a hierarchical perimeter flow control problem by integrating the MFD heterogeneous modeling. The perimeter flow controllers operate on the border between urban regions, and manipulate the percentages of flows that transfer between the regions such that the network delay is minimized and the distribution of congestion is more homogeneous. The first level of the hierarchical control problem can be solved by a model predictive control approach, where the prediction model is the aggregated parsimonious region-based MFD and the plant (reality) is formulated by the subregion-based MFDs, which is a more detailed model. At the lower level, a feedback controller of the hierarchical structure, tries to maximize the outflow of critical regions, by increasing their homogeneity. With inputs that can be observed with existing monitoring techniques and without the need for detailed traffic state information, the proposed framework succeeds to increase network flows and decrease the hysteresis loop of the MFD. Comparison with existing perimeter controllers without considering the more advanced heterogeneity modeling of MFD highlights the importance of such approach for traffic modeling and control.     

Some observed details of freeway traffic evolution

Certain details of traffic evolution were studied along a 2 km, homogenous freeway segment located upstream of a bottleneck. By comparing (transformed) cumulative curves constructed from the vehicle counts measured at neighboring loop detectors, it was found that waves propagated through queued traffic like a random walk with predictable statistical variation. There was no observed dependency of wave speed on flow. As such, these waves neither focused nor fanned outward and shocks arose only at the interfaces between free-flowing traffic and the back of queues. Although these traffic features may have long been suspected, actual observations of this kind have hitherto not been documented. Also of note, the shocks separating queued and unqueued traffic sometimes exhibited unexpectedly long transitions between these two states. Finally, some observations presented here corroborate earlier reports that, in unqueued traffic, vehicle velocity is insensitive to flows and that forward-moving changes in traffic states therefore travel with vehicles. Taken together, these findings suggest that certain rather simple models suffice for describing traffic on homogeneous freeway segments; brief discussion of this is offered in Section 5.     

A shockwave profile model for traffic flow on congested urban arterials

In this paper a new traffic flow model for congested arterial networks, named shockwave profile model (SPM), is presented. Taking advantage of the fact that traffic states within a congested link can be simplified as free-flow, saturated, and jammed conditions, SPM simulates traffic dynamics by analytically deriving the trajectories of four major shockwaves: queuing, discharge, departure, and compression waves. Unlike conventional macroscopic models, in which space is often discretized into small cells for numerical solutions, SPM treats each homogeneous road segment with constant capacity as a section; and the queuing dynamics within each section are described by tracing the shockwave fronts. SPM is particularly suitable for simulating traffic flow on congested signalized arterials especially with queue spillover problems, where the steady-state periodic pattern of queue build-up and dissipation process may break down. Depending on when and where spillover occurs along a signalized arterial, a large number of queuing patterns may be possible. Therefore it becomes difficult to apply the conventional approach directly to track shockwave fronts. To overcome this difficulty, a novel approach is proposed as part of the SPM, in which queue spillover is treated as either extending a red phase or creating new smaller cycles, so that the analytical solutions for tracing the shockwave fronts can be easily applied. Since only the essential features of arterial traffic flow, i.e., queue build-up and dissipation, are considered, SPM significantly reduces the computational load and improves the numerical efficiency. We further validated SPM using real-world traffic signal data collected from a major arterial in the Twin Cities. The results clearly demonstrate the effectiveness and accuracy of the model. We expect that in the future this model can be applied in a number of real-time applications such as arterial performance prediction and signal optimization.     

A dual decomposition method for sector capacity constrained traffic flow optimization

An aggregate air traffic flow model based on a multicommodity network is used for traffic flow management in the National Airspace System. The problem of minimizing the total travel time of flights in the National Airspace System of the United States, subject to sector capacity constraints, is formulated as an Integer Program. The resulting solution achieves optimal delay control. The Integer Program implemented for the scenarios investigated has billions of variables and constraints. It is relaxed to a Linear Program for computational efficiency. A dual decomposition method is applied to solve the large scale Linear Program in a computationally tractable manner. A rounding algorithm is developed to map the Linear Program solution to a physically acceptable result, and is implemented for the entire continental United States. A 2-h traffic flow management problem is solved with the method.     

A data fusion approach for real-time traffic state estimation in urban signalized links

Real-time estimation of the traffic state in urban signalized links is valuable information for modern traffic control and management. In recent years, with the development of in-vehicle and communication technologies, connected vehicle data has been increasingly used in literature and practice. In this work, a novel data fusion approach is proposed for the high-resolution (second-by-second) estimation of queue length, vehicle accumulation, and outflow in urban signalized links. Required data includes input flow from a fixed detector at the upstream end of the link as well as location and speed of the connected vehicles. A probability-based approach is derived to compensate the error associated with low penetration rates while estimating the queue tail location, which renders the proposed methodology more robust to varying penetration rates of connected vehicles. A well-defined nonlinear function based on traffic flow theory is developed to attain the number of vehicles inside the queue based on queue tail location and average speed of connected vehicles. The overall scheme is thoroughly tested and demonstrated in a realistic microscopic simulation environment for three types of links with different penetration rates of connected vehicles. In order to test the efficiency of the proposed methodology in case that data are available at higher sampling times, the estimation procedure is also demonstrated for different time resolutions. The results demonstrate the efficiency and accuracy of the approach for high-resolution estimation, even in the presence of measurement noise.     

On dynamics of traffic queues in a road network with route choice based on real time traffic information

Introducing real time traffic information into transportation network makes it necessary to consider development of queues and traffic flows as a dynamic process. This paper initiates a theoretical study of conditions under which this process is stable. A model is presented that describes within-one-day development of queues when drivers affected by real-time traffic information choose their paths en route. The model is reduced to a system of differential equations with delay. Equilibrium points of the system correspond to constant queue lengths. Stability of the system is investigated using characteristic values of the linearised minimal face flow. A traffic network example illustrating the method is provided.     

Using high-resolution event-based data for traffic modeling and control: An overview

Research on using high-resolution event-based data for traffic modeling and control is still at early stage. In this paper, we provide a comprehensive overview on what has been achieved and also think ahead on what can be achieved in the future. It is our opinion that using high-resolution event data, instead of conventional aggregate data, could bring significant improvements to current research and practices in traffic engineering. Event data records the times when a vehicle arrives at and departs from a vehicle detector. From that, individual vehicle’s on-detector-time and time gap between two consecutive vehicles can be derived. Such detailed information is of great importance for traffic modeling and control. As reviewed in this paper, current research has demonstrated that event data are extremely helpful in the fields of detector error diagnosis, vehicle classification, freeway travel time estimation, arterial performance measure, signal control optimization, traffic safety, traffic flow theory, and environmental studies. In addition, the cost of event data collection is low compared to other data collection techniques since event data can be directly collected from existing controller cabinet without any changes on the infrastructure, and can be continuously collected in 24/7 mode. This brings many research opportunities as suggested in the paper.     

Efficient intersection control for minimally guided vehicles: A self-organised and decentralised approach

An important question for the practical applicability of the highly efficient traffic intersection control is about the minimal level of intelligence the vehicles need to have so as to move beyond the traffic light control. We propose an efficient intersection traffic control scheme without the traffic lights, that only requires a majority of vehicles on the road to be equipped with a simple driver assistance system. The algorithm of our scheme is completely decentralised, and takes into full account the non-linear interaction between the vehicles at high density. For vehicles approaching the intersection in different directions, our algorithm imposes simple interactions between vehicles around the intersection, by defining specific conditions on the real-time basis, for which the involved vehicles are required to briefly adjust their dynamics. This leads to a self-organised traffic flow that is safe, robust, and efficient. We also take into account of the driver comfort level and study its effect on the control efficiency. The scheme has low technological barrier, minimal impact on the conventional driving behaviour, and can coexist with the traffic light control. It also has the advantages of being easily scalable, and fully compatible with both the conventional road systems as well as the futuristic scenario in which driverless vehicles dominate the road. The mathematical formulation of our scheme permits large scale realistic numerical simulations of busy intersections, allowing a more complete evaluation of the control performance, instead of just the collision avoidance at the intersection.