The impact of speed limits on traffic equilibrium and system performance in networks

Speed limits are usually imposed on roads in an attempt to enhance safety and sometimes serve the purpose of reducing fuel consumption and vehicular emissions as well. Most previous studies up to date focus on investigation of the effects of speed limits from a local perspective, while network-wide traffic reallocation effects are overlooked. This paper makes the first attempt to investigate how a link-specific speed limit law reallocates traffic flow in an equilibrium manner at a macroscopic network level. We find that, although the link travel time–flow relationship is altered after a speed limit is imposed, the standard traffic assignment method still applies. With the commonly adopted assumptions, the uniqueness of link travel times at user equilibrium (UE) remains valid, and the UE flows on links with non-binding speed limits are still unique. The UE flows on other links with binding speed limits may not be unique but can be explicitly characterized by a polyhedron or a linear system of equalities and inequalities. Furthermore, taking into account the traffic reallocation effects of speed limits, we compare the capability of speed limits and road pricing for decentralizing desirable network flow patterns. Although from a different perspective for regulating traffic flows with a different mechanism, a speed limit law may play the same role as a toll charge scheme and perform better than some negative (rebate) toll schemes under certain conditions for network flow management.     

Eco-system optimal time-dependent flow assignment in a congested network

This research addresses the eco-system optimal dynamic traffic assignment (ESODTA) problem which aims to find system optimal eco-routing or green routing flows that minimize total vehicular emission in a congested network. We propose a generic agent-based ESODTA model and a simplified queueing model (SQM) that is able to clearly distinguish vehicles’ speed in free-flow and congested conditions for multi-scale emission analysis, and facilitates analyzing the relationship between link emission and delay. Based on the SQM, an expanded space-time network is constructed to formulate the ESODTA with constant bottleneck discharge capacities. The resulting integer linear model of the ESODTA is solved by a Lagrangian relaxation-based algorithm. For the simulation-based ESODTA, we present the column-generation-based heuristic, which requires link and path marginal emissions in the embedded time-dependent least-cost path algorithm and the gradient-projection-based descent direction method. We derive a formula of marginal emission which encompasses the marginal travel time as a special case, and develop an algorithm for evaluating path marginal emissions in a congested network. Numerical experiments are conducted to demonstrate that the proposed algorithm is able to effectively obtain coordinated route flows that minimize the system-wide vehicular emission for large-scale networks.     

Analysis of a cooperative variable speed limit system using microscopic traffic simulation

Variable speed limit systems where variable message signs are used to show speed limits adjusted to the prevailing road or traffic conditions are installed on motorways in many countries. The objectives of variable speed limit system installations are often to decrease the number of accidents and to increase traffic efficiency. Currently, there is an interest in exploring the potential of cooperative intelligent transport systems including communication between vehicles and/or vehicles and the infrastructure. In this paper, we study the potential benefits of introducing infrastructure to vehicle communication, autonomous vehicle control and individualized speed limits in variable speed limit systems. We do this by proposing a cooperative variable speed limit system as an extension of an existing variable speed limit system. In the proposed system, communication between the infrastructure and the vehicles is used to transmit variable speed limits to upstream vehicles before the variable message signs become visible to the drivers. The system is evaluated by the means of microscopic traffic simulation. Traffic efficiency and environmental effects are considered in the analysis. The results of the study show benefits of the infrastructure to vehicle communication, autonomous vehicle control and individualized speed limits for variable speed limit systems in the form of lower acceleration rates and thereby harmonized traffic flow and reduced exhaust emissions.     

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.     

Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

Effect of speed limits in degradable transport networks

This paper studies how link-specific speed limits influence the performance of degradable transport networks, in which the capacity of each link is a degradable random variable. The distribution and cumulative distribution of link travel time have been presented with the effect of speed limits taken into account. The mean and variance of link and route travel time are formulated. Three link states have been classified, and their physical meanings have been discussed. The relationship between critical capacity, travel time and speed limit has been elaborated. We have proposed a Speed Limit- and Reliability-based User Equilibrium (SLRUE), adopting travel time budget as the principle of travelers’ route choice. A heuristic method employing the method of successive averages is developed to solve the SLRUE in degradable networks. Through numerical studies, we find that for some networks both the mean and standard deviation of the total travel time could be reduced simultaneously by imposing some speed limits. The speed limit design problem has been studied, and it is found that imposing speed limits cannot always reduce the total travel time budget of a network.     

Development of a corrected average speed model for calculating carbon dioxide emissions per link unit on urban roads

The purpose of our study is to develop a “corrected average emission model,” i.e., an improved average speed model that accurately calculates CO₂ emissions on the road. When emissions from the central roads of a city are calculated, the existing average speed model only reflects the driving behavior of a vehicle that accelerates and decelerates due to signals and traffic. Therefore, we verified the accuracy of the average speed model, analyzed the causes of errors based on the instantaneous model utilizing second-by-second data from driving in a city center, and then developed a corrected model that can improve the accuracy. We collected GPS data from probe vehicles, and calculated and analyzed the average emissions and instantaneous emissions per link unit. Our results showed that the average speed model underestimated CO₂ emissions with an increase in acceleration and idle time for a speed range of 20 km/h and below, which is the speed range for traffic congestion. Based on these results, we analyzed the relationship between average emissions and instantaneous emissions according to the average speed per link unit, and we developed a model that performed better with an improved accuracy of calculated CO₂ emissions for 20 km/h and below.     

Travel time estimation for urban road networks using low frequency probe vehicle data

The paper presents a statistical model for urban road network travel time estimation using vehicle trajectories obtained from low frequency GPS probes as observations, where the vehicles typically cover multiple network links between reports. The network model separates trip travel times into link travel times and intersection delays and allows correlation between travel times on different network links based on a spatial moving average (SMA) structure. The observation model presents a way to estimate the parameters of the network model, including the correlation structure, through low frequency sampling of vehicle traces. Link-specific effects are combined with link attributes (speed limit, functional class, etc.) and trip conditions (day of week, season, weather, etc.) as explanatory variables. The approach captures the underlying factors behind spatial and temporal variations in speeds, which is useful for traffic management, planning and forecasting. The model is estimated using maximum likelihood. The model is applied in a case study for the network of Stockholm, Sweden. Link attributes and trip conditions (including recent snowfall) have significant effects on travel times and there is significant positive correlation between segments. The case study highlights the potential of using sparse probe vehicle data for monitoring the performance of the urban transport system.     

Feedback control speed harmonization algorithm: Methodology and preliminary testing

The capacity drop phenomenon, which reduces the maximum bottleneck discharge rate following the onset of congestion, is a critical restriction in transportation networks that produces additional traffic congestion. Consequently, preventing or reducing the occurrence of the capacity drop not only mitigates traffic congestion, but can also produce environmental and traffic safety benefits. In addressing this problem, the paper develops a novel bang-bang feedback control speed harmonization (SH) or Variable Speed Limit (VSL) algorithm, that attempts to prevent or delay the breakdown of a bottleneck and thus reduce traffic congestion. The novelty of the system lies in the fact that it is both proactive and reactive in responding to the dynamic stochastic nature of traffic. The system is proactive because it uses a calibrated fundamental diagram to initially identify the optimum throughput to maintain within the SH zone. Furthermore, the system is reactive (dynamic) because it monitors the traffic stream directly upstream of the bottleneck to adjustment the metering rate to capture the dynamic and stochastic nature of traffic. The steady-state traffic states in the vicinity of a lane-drop bottleneck before and after applying the SH algorithm is analyzed to demonstrate the effectiveness of the algorithm in alleviating the capacity drop. We demonstrate theoretically that the SH algorithm is effective in enhancing the bottleneck discharge rate. A microscopic simulation of the network using the INTEGRATION software further demonstrates the benefits of the algorithm in increasing the bottleneck discharge rate, decreasing vehicle delay, and reducing vehicle fuel consumption and CO₂ emission levels. Specifically, compared with the base case without the SH algorithm, the advisory speed limit increases the bottleneck discharge rate by approximately 7%, reduces the overall system delay by approximately 20%, and reduces the system-wide fuel consumption and CO₂ emission levels by 5%.     

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.     

Evaluation of variable speed limits to improve traffic safety

This paper examines automated control strategies of variable speed limits that aim at reducing crash potential on instrumented freeways. A real-time crash prediction model was developed to estimate crash potential based on short-term variation of traffic flow characteristics. A microscopic traffic simulation model was used to realistically simulate changes in traffic conditions as an effect of variable speed limits and combined with the crash prediction model for the evaluation of control logics. Within this integrated evaluation framework, the study investigated the effect of strategy control factors on the crash potential reduction and total travel time. The study results indicated that variable speed limits could reduce crash potential by 5–17%, by temporarily reducing speed limits during risky traffic conditions when crash potential exceeded the pre-specified threshold.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

Mobility and environment improvement of signalized networks through Vehicle-to-Infrastructure (V2I) communications

Traffic signals, even though crucial for safe operations of busy intersections, are one of the leading causes of travel delays in urban settings, as well as the reason why billions of gallons of fuel are burned, and tons of toxic pollutants released to the atmosphere each year by idling engines. Recent advances in cellular networks and dedicated short-range communications make Vehicle-to-Infrastructure (V2I) communications a reality, as individual cars and traffic signals can now be equipped with communication and computing devices. In this paper, we first presented an integrated simulator with V2I, a car-following model and an emission model to simulate the behavior of vehicles at signalized intersections and calculate travel delays in queues, vehicle emissions, and fuel consumption. We then present a hierarchical green driving strategy based on feedback control to smooth stop-and-go traffic in signalized networks, where signals can disseminate traffic signal information and loop detector data to connected vehicles through V2I communications. In this strategy, the control variable is an individual advisory speed limit for each equipped vehicle, which is calculated from its location, signal settings, and traffic conditions. Finally, we quantify the mobility and environment improvements of the green driving strategy with respect to market penetration rates of equipped vehicles, traffic conditions, communication characteristics, location accuracy, and the car-following model itself, both in isolated and non-isolated intersections. In particular, we demonstrate savings of around 15% in travel delays and around 8% in fuel consumption and greenhouse gas emissions. Different from many existing ecodriving strategies in signalized road networks, where vehicles’ speed profiles are totally controlled, our strategy is hierarchical, since only the speed limit is provided, and vehicles still have to follow their leaders. Such a strategy is crucial for maintaining safety with mixed vehicles.     

Validation of an extended discrete first-order model with variable speed limits

This paper validates the prediction model embedded in a model predictive controller (MPC) of variable speed limits (VSLs). The MPC controller was designed based on an extended discrete first-order model with a triangular fundamental diagram. In our previous work, the extended discrete first-order model was designed to reproduce the capacity drop and the propagation of jam waves, and it was validated with reasonable accuracy without the presence of VSLs. As VSLs influence traffic dynamics, the dynamics including VSLs needs to be validated, before it can be applied as a prediction model in MPC. For conceptual illustrations, we use two synthetic examples to show how the model reproduces the key mechanisms of VSLs that are applied by existing VSL control approaches. Furthermore, the model is calibrated by use of real traffic data from Dutch freeway A12, where the field test of a speed limit control algorithm (SPECIALIST) was conducted. In the calibration, the original model is extended by using a quadrangular fundamental diagram which keeps the linear feature of the model and represents traffic states at the under-critical branch more accurately. The resulting model is validated using various traffic data sets. The accuracy of the model is compared with a second-order traffic flow model. The performance of two models is comparable: both models reproduce accurate results matching with real data. Flow errors of the calibration and validation are around 10%. The extended discrete first-order model-based MPC controller has been demonstrated to resolve freeway jam waves efficiently by synthetic cases. It has a higher computation speed comparing to the second-order model-based MPC.     

A linear programming formulation for autonomous intersection control within a dynamic traffic assignment and connected vehicle environment

This paper develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network, accounting for dynamic departure time, dynamic route choice, and autonomous intersection control in the context of system optimum network model. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only {−1, 0, 1} values. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. It is also shown that the traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control.     

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.     

Short/medium-term prediction for the aviation emissions in the en route airspace considering the fluctuation in air traffic demand

This paper proposes a novel short/medium-term prediction method for aviation emissions distribution in en route airspace. An en route traffic demand model characterizing both the dynamics and the fluctuation of the actual traffic demand is developed, based on which the variation and the uncertainty of the short/medium-term traffic growth are predicted. Building on the demand forecast the Boeing Fuel Flow Method 2 is applied to estimate the fuel consumption and the resulting aviation emissions in the en route airspace. Based on the traffic demand prediction and the en route emissions estimation, an aviation emissions prediction model is built, which can be used to forecast the generation of en route emissions with uncertainty limits. The developed method is applied to a real data set from Hefei Area Control Center for the en route emission prediction in the next 5 years, with time granularities of both months and years. To validate the uncertainty limits associated with the emission prediction, this paper also presents the prediction results based on future traffic demand derived from the regression model widely adopted by FAA and Eurocontrol. The analysis of the case study shows that the proposed method can characterize well the dynamics and the fluctuation of the en route emissions, thereby providing satisfactory prediction results with appropriate uncertainty limits. The prediction results show a gradual growth at an average annual rate of 7.74%, and the monthly prediction results reveal distinct fluctuation patterns in the growth.     

A dynamic stochastic assignment model for the analysis of general networks

The paper adopts the framework employed by the existing dynamic assignment models, which analyse specific network forms, and develops a methodology for analysing general networks. Traffic conditions within a link are assumed to be homogeneous, and the time varying O-D travel times and traffic flow patterns are calculated using elementary relationships from traffic flow theory and link volume conservation equations. Each individual is assumed to select a departure time and a route by trading off the travel time and schedule delay associated with each alternative. A route is considered as reasonable if it includes only links which do not take the traveller back to the origin. The set of reasonable routes is not consistant but depends on the time that an individual decides to depart from his origin. Equilibrium distributions are derived from a Markovian model which describes the evolution of travel patterns from day to day. Numerical simulation experiments are conducted to analyse the impact of different work start time flexibilities on the time dependent travel patterns. The similarity between link flows and travel times obtained from static and dynamic stochastic assignment is investigated. It is shown that in congested networks the application of static assignment results in travel times which are lower than the ones predicted by dynamic assignment.     

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.     

A multiclass cell transmission model for shared human and autonomous vehicle roads

Autonomous vehicles have the potential to improve link and intersection traffic behavior. Computer reaction times may admit reduced following headways and increase capacity and backwards wave speed. The degree of these improvements will depend on the proportion of autonomous vehicles in the network. To model arbitrary shared road scenarios, we develop a multiclass cell transmission model that admits variations in capacity and backwards wave speed in response to class proportions within each cell. The multiclass cell transmission model is shown to be consistent with the hydrodynamic theory. This paper then develops a car following model incorporating driver reaction time to predict capacity and backwards wave speed for multiclass scenarios. For intersection modeling, we adapt the legacy early method for intelligent traffic management (Bento et al., 2013) to general simulation-based dynamic traffic assignment models. Empirical results on a city network show that intersection controls are a major bottleneck in the model, and that the legacy early method improves over traffic signals when the autonomous vehicle proportion is sufficiently high.