Continuous formulations and analytical properties of the link transmission model

The link transmission model (LTM) has great potential for simulating traffic flow in large-scale networks since it is much more efficient and accurate than the Cell Transmission Model (CTM). However, there lack general continuous formulations of LTM, and there has been no systematic study on its analytical properties such as stationary states and stability of network traffic flow. In this study we attempt to fill the gaps. First we apply the Hopf–Lax formula to derive Newell’s simplified kinematic wave model with given boundary cumulative flows and the triangular fundamental diagram. We then apply the Hopf–Lax formula to define link demand and supply functions, as well as link queue and vacancy functions, and present two continuous formulations of LTM, by incorporating boundary demands and supplies as well as invariant macroscopic junction models. With continuous LTM, we define and solve the stationary states in a road network. We also apply LTM to directly derive a Poincaré map to analyze the stability of stationary states in a diverge-merge network. Finally we present an example to show that LTM is not well-defined with non-invariant junction models. We can see that Newell’s model and continuous LTM complement each other and provide an alternative formulation of the network kinematic wave theory. This study paves the way for further extensions, analyses, and applications of LTM in the future.     

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.     

Walking-distance introduced queueing model for pedestrian queueing system: Theoretical analysis and experimental verification

We have introduced the effect of delay in walking from the head of a queue to the service windows in the queueing model and obtain a suitable type of queueing system under various conditions by both computational simulation and theoretical analysis. When there are multiple service windows, the queueing theory indicates that mean waiting time in a fork-type queueing system (Fork), which collects pedestrians into a single queue, is smaller than that in a parallel-type queueing system (Parallel), i.e., queues for each service window. However, in our walking-distance introduced queueing model, we have examined that mean waiting time in Parallel becomes smaller when both the arrival probability of pedestrians and the effect of walking distance are large. Moreover, enhanced Forks, which shorten waiting time by reducing the effect of walking distance, are considered, and parts of our results are also verified by real queueing experiments.     

Analysing queueing at toll plazas using a coupled,multiple-queue,queueing system model: application to toll plaza design

A vehicle approaching a toll plaza observes the queues at each of the available toll-lanes before choosing which to join. This choice process, the arrival process of vehicles and the service characteristics of the toll-booths, affect the queues and delay the drivers. In this paper, queueing at a toll plaza is modelled as a multiple-queue queueing system where the arrival process to a queue (toll-lane) is dependent on the state of all the queues. In the past, such systems have been modelled mathematically only for two queues and are not applicable for toll plazas with three or more toll-lanes. The proposed model determines the steady-state probability density function (pdf) for the queues at large toll plazas. This study is used to determine the number of toll-lanes or the length of the upstream queueing area required to achieve certain user-specified levels-of-service. Expected delay and maximum queue length are used as level-of-service measures. Indicative design charts are also provided.     

Dynamic network loading: A stochastic differentiable model that derives link state distributions

We present a dynamic network loading model that yields queue length distributions, accounts for spillbacks, and maintains a differentiable mapping from the dynamic demand on the dynamic queue lengths. The model also captures the spatial correlation of all queues adjacent to a node, and derives their joint distribution. The approach builds upon an existing stationary queueing network model that is based on finite capacity queueing theory. The original model is specified in terms of a set of differentiable equations, which in the new model are carried over to a set of equally smooth difference equations. The physical correctness of the new model is experimentally confirmed in several congestion regimes. A comparison with results predicted by the kinematic wave model (KWM) shows that the new model correctly represents the dynamic build-up, spillback and dissipation of queues. It goes beyond the KWM in that it captures queue lengths and spillbacks probabilistically, which allows for a richer analysis than the deterministic predictions of the KWM. The new model also generates a plausible fundamental diagram, which demonstrates that it captures well the stationary flow/density relationships in both congested and uncongested conditions.     

Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model

Static traffic assignment models are still widely applied for strategic transport planning purposes in spite of the fact that such models produce implausible traffic flows that exceed link capacities and predict incorrect congestion locations. There have been numerous attempts to constrain link flows to capacity. Capacity constrained models with residual queues are often referred to as quasi-dynamic traffic assignment models. After reviewing the literature, we come to the conclusion that an important piece of the puzzle has been missing so far, namely the inclusion of a first order node model. In this paper we propose a novel path-based static traffic assignment model for finding a stochastic user equilibrium in general transportation networks. This model includes a first order (steady-state) node model that yields more realistic turn capacities, which are then used to determine consistent capacity constrained traffic flows, residual point (vertical) queues (upstream bottleneck links), and path travel times consistent with queuing theory. The route choice part of the model is specified as a variational inequality problem, while the network loading part is formulated as a fixed point problem. Both problems are solved using existing techniques to find a solution. We illustrate the model using hypothetical examples, and also demonstrate feasibility on large-scale networks.     

Effects of queue spillover in networks considering simultaneous departure time and route choices

This paper explores the effects of queue spillover in transportation networks, in the context of dynamic traffic assignment. A model of spatial queue is defined to characterize dynamic traffic flow and queuing formation in network links. Network users simultaneously choose departure time and travel route to minimize the travel cost including journey time and unpunctuality penalty. Using some necessary conditions of the dynamic user equilibrium, dynamic network flows are obtained exactly on some networks with typical structure. Various effects of queue spillover are discussed based on the results of these networks, and some new paradoxes of link capacity expansion have been found as a result of such effects. Analytical and exact results in these typical networks show that ignoring queuing length may generate biased solutions, and the link storage capacity is a very important factor concerning the performance of networks.     

Time-dependent queueing at road junctions: Observation and prediction

Measurements of queue lengths and vehicle delays have been used to test the predictions of time-dependent queueing models. Observations were made at eight public road sites for a number of peak periods at each site. In all, sixty-eight peaks were studied. The model predictions of the time-dependent trials-average queues and delays agreed with the observations within the limits set by day-to-day variability for seven of the sites, but for the eighth there was consistent overprediction.     

Bike route choice modeling using GPS data without choice sets of paths

Concerned by the nuisances of motorized travel on urban life, policy makers are faced with the challenge of making cycling a more attractive alternative for everyday transportation. Route choice models can help achieve this objective by gaining insights into the trade-offs cyclists make when choosing their routes and by allowing the effect of infrastructure improvements to be analyzed. We estimate a link-based bike route choice model from a sample of GPS observations in the city of Eugene on a network comprising over 40,000 links. The so-called recursive logit (RL) model (Fosgerau et al., 2013) does not require to sample any choice set of paths. We show the advantages of this approach in the context of prediction by focusing on two applications of the model: link flows and accessibility measures. Compared to the path-based approach which requires to generate choice sets, the RL model proves to make significant gains in computational time and to avoid paradoxical accessibility measure results discussed in previous works, e.g. Nassir et al. (2014).     

Real-time queue length estimation for congested signalized intersections

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic is not available once the detector is occupied by the queue. In this paper, instead of counting arrival traffic flow in the current signal cycle, we solve the problem of measuring intersection queue length by exploiting the queue discharge process in the immediate past cycle. Using high-resolution “event-based” traffic signal data, and applying Lighthill–Whitham–Richards (LWR) shockwave theory, we are able to identify traffic state changes that distinguish queue discharge flow from upstream arrival traffic. Therefore, our approach can estimate time-dependent queue length even when the signal links are congested with long queues. Variations of the queue length estimation model are also presented when “event-based” data is not available. Our models are evaluated by comparing the estimated maximum queue length with the ground truth data observed from the field. Evaluation results demonstrate that the proposed models can estimate long queues with satisfactory accuracy. Limitations of the proposed model are also discussed in the paper.     

Link-based day-to-day network traffic dynamics and equilibria

A general dynamical system model with link-based variables is formulated to characterize the processes of achieving equilibria from a non-equilibrium state in traffic networks. Several desirable properties of the dynamical system model are established, including the equivalence between its stationary state and user equilibrium, the invariance of its evolutionary trajectories, and the uniqueness and stability of its stationary points. Moreover, it is shown that not only a link-based version of two existing day-to-day traffic dynamics models but also two existing link-based dynamical system models of traffic flow are the special cases of the proposed model. The stabilities of stationary states of these special cases are also analyzed and discussed. In addition, an extension is made to the case with elastic demand. The study is helpful for better understanding the day-to-day adjustment mechanism of traffic flows in networks.     

Alternative pollution permit systems for transportation networks based on origin/destination pairs and paths

In this paper, we introduce two new pollution permit systems for congested transportation networks based, respectively, on origin/destination pairs and on paths. We derive the governing equilibrium conditions for each system, provide the variational inequality formulations, and compare these permit systems to the existing link-based permit system model. As in the case of the link-based permit system model, we show that either new system achieves the environmental quality standard provided that the initial license allocations are set accordingly. We also prove that, given the equilibrium solution to the origin/destination permit system problem, we can construct from it a solution to the path-based permit system problem and vice versa. We discuss qualitative properties of the equilibrium solution patterns and propose an algorithm for the computation of the patterns for both models. Finally, we present a numerical example that illustrates the permit systems. In light of this work, transportation planning agencies now have available alternative permit systems for their use for pollution reduction.     

A rolling-horizon quadratic-programming approach to the signal control problem in large-scale congested urban road networks

The paper investigates the efficiency of a recently developed signal control methodology, which offers a computationally feasible technique for real-time network-wide signal control in large-scale urban traffic networks and is applicable also under congested traffic conditions. In this methodology, the traffic flow process is modeled by use of the store-and-forward modeling paradigm, and the problem of network-wide signal control (including all constraints) is formulated as a quadratic-programming problem that aims at minimizing and balancing the link queues so as to minimize the risk of queue spillback. For the application of the proposed methodology in real time, the corresponding optimization algorithm is embedded in a rolling-horizon (model-predictive) control scheme. The control strategy’s efficiency and real-time feasibility is demonstrated and compared with the Linear-Quadratic approach taken by the signal control strategy TUC (Traffic-responsive Urban Control) as well as with optimized fixed-control settings via their simulation-based application to the road network of the city centre of Chania, Greece, under a number of different demand scenarios. The comparative evaluation is based on various criteria and tools including the recently proposed fundamental diagram for urban network traffic.     

Discretised link travel time models based on cumulative flows: Formulations and properties

In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear interpolation (LI) are used to approximate cumulative flows over time. New formulations of the SF-type and LI-type link travel time models are developed. We prove that these two types of link travel time models ensure first-in-first-out (FIFO) and continuity of travel times with respect to flows, and have other desirable properties. Since the LI-type link travel time model does not satisfy the causality property, a modified LI-type (MLI-type) link travel time model is proposed in this paper. We prove that the MLI-type link travel time model ensures causality, strong FIFO and travel time continuity, and that the MLI-type link travel time function is strictly monotone under the condition that the travel time of each vehicle on a link is greater than the free flow travel time on that link. Numerical examples are set up to illustrate the properties and accuracy of the three models.     

Conformity: How VMT-speed distributions can affect mobile emission inventories

Transportation conformity is a US regulatory process that requires that transportation modeling be integrated with air quality modeling. Consequently, every change to either modeling process is undertaken with great scrutiny by the regional governments, who have to use the models for demonstrating conformity. This paper explores the "trip versus link debate," which stems from the fact that the standard travel demand models used by most metropolitan planning organizations are primarily link oriented, while the air quality models have been primarily trip oriented. Using the Sacramento region we examine the effects on mobile source emissions inventories when speed-VMT distributions are constructed using the trip and link-based philosophies. The results of our study indicate that trip-based VMT-speed distributions produce consistently lower emissions estimates than the link-based distributions. We use the results to assert that deciding between a trip-based or link-based conformity modeling process involves more than the technical difficulty of changesto the models or the potential political ramifications, it involves assessing which method will provide the most accurate estimates of regional motor vehicle emissions. We also examine ways to think about constructing mobile source emission inventories.     

Performance analysis of the phase swap sorting strategy for an isolated intersection

A separate left-turn phase wastes the capacity of intersection, because all the lanes on the approach are not fully utilized during either the left-turn or through green phase. Under the phase swap sorting strategy (Xuan, 2011), different types of movements can be reorganized by a pre-signal so that all the lanes in the sorting area can be used to discharge vehicles during their green phases. Thus the capacity is improved significantly. In fact, when a pre-signal is installed upstream of the intersection signal (also named main signal), the two signals will have a great impact on not only the capacity, but other traffic performances, such as delays, queue formations, maximum queue length, residual queue, and spillback, etc., which are very important performance factors for the design and application of the phase swap sorting strategy. In order to more fully quantify and characterize the performance of the phase swap sorting strategy, a three-dimensional Markov queueing model is presented. Two levels of performance evaluation indices are formulated using the matrix analytic techniques. All these indices can be used to establish a more comprehensive analytical framework to evaluate the use of the phase swap sorting strategy. Model validation shows that the proposed model can provide a reliable performance analysis for the phase swap sorting strategy under various different conditions. In addition, in order to intuitively illustrate the effects of various factors on the performance of the phase swap sorting strategy, a series of numerical experiments is conducted.     

Metamodels for estimating waterway delays through series of queues

A numerical method has been developed for estimating delays on congested waterways. Analytic and numerical results are presented for series of G/G/1 queues, i.e. with generally distributed arrivals and service times and single chambers at each lock. One or two-way traffic operations are modelled. A metamodelling approach which develops simple formulas to approximate the results of simulation models is presented. The structure of the metamodels is developed from queueing theory while their coefficients are statistically estimated from simulation results. The numerical method consists of three modules: (1) delays, (2) arrivals and (3) departures. The first estimates the average waiting time for each lock when the arrival and service time distributions at this lock are known. The second identifies the relations between the arrival distributions at one lock and the departure distributions from the upstream and downstream locks. The third estimates the mean and variance of inter-departure times when the inter-arrival and service time distributions are known. The method can be applied to systems with two-way traffic through common bi-directional servers as well as to one-way traffic systems. Algorithms for both cases are presented. This numerical method is shown to produce results that are close to the simulation results. The metamodels developed for estimating delays and variances of inter-departure times may be applied to waterways and other series of G/G/1 queues. These metamodels for G/G/1 queues may provide key components of algorithms for analyzing networks of queues.     

Estimating probability distributions of dynamic queues

Queues are often associated with uncertainty or unreliability, which can arise from chance or climatic events, phase changes in system behaviour, or inherent randomness. Knowing the probability distribution of the number of customers in a queue is important for estimating the risk of stress or disruption to routine services and upstream blocking, potentially leading to exceeding critical limits, gridlock or incidents. The present paper focuses on time-varying queues produced by transient oversaturation during demand peaks where there is randomness in arrivals and service. The objective is to present practical methods for estimating a probability distribution from knowledge of the mean, variance and utilisation (degree of saturation) of a queue available from computationally efficient, if approximate, time-dependent calculation. This is made possible by a novel expression for time-dependent queue variance. The queue processes considered are those commonly used to represent isolated priority (M/M/1) and signal-like (M/D/1) systems, plus some statistical variations within the common Pollaczek-Khinchin framework. Results are verified by comparison with Markov simulation based on recurrence relations.     

Dynamic traffic assignment of cooperative adaptive cruise control

Advances in connected and automated vehicle technologies have resulted in new vehicle applications, such as cooperative adaptive cruise control (CACC). Microsimulation models have shown significant increases in capacity and stability due to CACC, but most previous work has relied on microsimulation. To study the effects of CACC on larger networks and with user equilibrium route choice, we incorporate CACC into the link transmission model (LTM) for dynamic network loading. First, we derive the flow-density relationship from the MIXIC car-following model of CACC (at 100% CACC market penetration). The flow-density relationship has an unusual shape; part of the congested regime has an infinite congested wave speed. However, we verify that the flow predictions match observations from MIXIC modeled in VISSIM. Then, we use the flow-density relationship from MIXIC in LTM. Although the independence of separate links restricts the maximum congested wave speed, for common freeway link lengths the congested wave speed is sufficiently high to fit the observed flows from MIXIC. Results on a freeway and regional networks (with CACC-exclusive lanes) indicate that CACC could reduce freeway congestion, but naïve deployment of CACC-exclusive lanes could cause an increase in total system travel time.