A multi-path progression model for synchronization of arterial traffic signals

To contend with congestion and spillback on commuting arterials, serving as connectors between freeway and surface-street flows, this paper presents three multi-path progression models to offer progression bands for multiple critical path-flows contributing to the high volume in each arterial link. The first proposed model is a direct extension of MAXBAND under a predetermined phasing plan, but using the path-flow data to yield the progression bands. The second model further takes the phase sequence at each intersection as a decision variable, and concurrently optimizes the signal plans with offsets for the entire arterial. Due to the competing nature of multi-path progression flows over the same green duration, the third model is proposed with a function to automatically select the optimal number of paths in their bandwidths maximization process. The results of extensive simulation studies have shown that the proposed models outperform conventional design methods, such as MAXBAND or TRANSYT, especially for those arterials with multiple heavy path-flows. The research results from this study have also reflected the need to collect more traffic pattern data such as major path-flow volumes, in addition to the typical intersection volume counts.     

Optimizing signals for arterials experiencing heavy mixed scooter-vehicle flows

Recognizing the increasing popularity of scooters among urban commuters in developing countries and the significant impacts of their dynamic maneuverability on the progression of mixed traffic, this study presents a simulation-based signal optimization model for arterials experiencing heavy scooter-vehicle flows. The proposed model consists of a macroscopic simulation and a signal optimization module, where the former functions to capture the interactions between scooter and passenger-car flows over the process of discharging, propagation, and formation of intersection queues. The latter offers a specially-designed algorithm to search for the optimal signal plan and arterial offsets, based on the complex departure and arrival patterns of mixed flows estimated with the simulation module. To account for scooters’ unique parallel moving and queue patterns in a travel lane, the proposed signal module has adopted the sub-lane concept in estimating the mixed-flow queue distribution across lanes and their discharging flow rates. The results of extensive experimental analyses with various mixed-flow scenarios confirm that the proposed model offers the potential for signal design for arterials plagued by heavy scooter-vehicle mixed flows.     

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.     

Network traffic control based on a mesoscopic dynamic flow model

The paper focuses on Network Traffic Control based on aggregate traffic flow variables, aiming at signal settings which are consistent with within-day traffic flow dynamics. The proposed optimisation strategy is based on two successive steps: the first step refers to each single junction optimisation (green timings), the second to network coordination (offsets). Both of the optimisation problems are solved through meta-heuristic algorithms: the optimisation of green timings is carried out through a multi-criteria Genetic Algorithm whereas offset optimisation is achieved with the mono-criterion Hill Climbing algorithm. To guarantee proper queuing and spillback simulation, an advanced mesoscopic traffic flow model is embedded within the network optimisation method. The adopted mesoscopic traffic flow model also includes link horizontal queue modelling. The results attained through the proposed optimisation framework are compared with those obtained through benchmark tools.     

Real-time network-wide traffic signal optimization considering long-term green ratios based on expected route flows

We propose a novel real-time network-wide traffic signal control scheme which is (1) applicable under modern data technologies, (2) flexible in response to variations of traffic flows due to its non-cyclic feature, (3) operable on a network-wide and real-time basis, and (4) capable of considering expected route flows in the form of long-term green time ratios for intersection movement. The proposed system has a two-level hierarchical architecture: (1) strategy level and (2) control level. Considering the optimal states for a long-term period found in the strategy level, the optimal signal timings for a short-term period are calculated in the control level which consists of two steps: (1) queue weight update and (2) signal optimization. Based on the ratio of the cumulative green time to the desired green time is the first step to update the queue weights, which are then used in the optimization to find signal timings for minimum total delay. A parametric queue weight function is developed, discussed and evaluated. Two numerical experiments were given. The first demonstrated that the proposed system performs effectively, and the second shows its capability in a real-world network.     

A probabilistic model for traffic at actuated control signals

Vehicle actuated controls are designed to adapt green and red times automatically, according to the actual dynamics of the arrival, departure and queuing processes. In turn, drivers experience variable delays and waiting times at these signals. However, in practice, delays and waiting times are computed at these systems with models that assume stationariety in the arrival process, and that are capable of computing simply expectation values, while no information is given on the uncertainty around this expectation. The growing interest on measures like travel time reliability, or network robustness motivates the development of models able to quantify the variability of traffic at these systems.This paper presents a new modeling approach for estimating queues and signal phase times, based on probabilistic theory. This model overcomes the limitations of existing models in that it does not assume stationary arrival rates, but it assumes any temporal distribution as input, and allows one to compute the temporal evolution of queue length and signal sequence probabilities. By doing so, one can also quantify the uncertainty in the estimation of delays and waiting times as time-dependent processes. The results of the probabilistic approach have been compared to the results of repeated microscopic simulations, showing good agreement. The smaller number of parameters and shorter computing times required in the probabilistic approach makes the model suitable for, e.g., planning and design problems, as well as model-based travel time estimation.     

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.     

A real-time adaptive signal control in a connected vehicle environment

The state of the practice traffic signal control strategies mainly rely on infrastructure based vehicle detector data as the input for the control logic. The infrastructure based detectors are generally point detectors which cannot directly provide measurement of vehicle location and speed. With the advances in wireless communication technology, vehicles are able to communicate with each other and with the infrastructure in the emerging connected vehicle system. Data collected from connected vehicles provides a much more complete picture of the traffic states near an intersection and can be utilized for signal control. This paper presents a real-time adaptive signal phase allocation algorithm using connected vehicle data. The proposed algorithm optimizes the phase sequence and duration by solving a two-level optimization problem. Two objective functions are considered: minimization of total vehicle delay and minimization of queue length. Due to the low penetration rate of the connected vehicles, an algorithm that estimates the states of unequipped vehicle based on connected vehicle data is developed to construct a complete arrival table for the phase allocation algorithm. A real-world intersection is modeled in VISSIM to validate the algorithms. Results with a variety of connected vehicle market penetration rates and demand levels are compared to well-tuned fully actuated control. In general, the proposed control algorithm outperforms actuated control by reducing total delay by as much as 16.33% in a high penetration rate case and similar delay in a low penetration rate case. Different objective functions result in different behaviors of signal timing. The minimization of total vehicle delay usually generates lower total vehicle delay, while minimization of queue length serves all phases in a more balanced way.     

A continuous-flow-intersection-lite design and traffic control for oversaturated bottleneck intersections

Oversaturation has become a severe problem for urban intersections, especially the bottleneck intersections that cause queue spillover and network gridlock. Further improvement of oversaturated arterial traffic using traditional mitigation strategies, which aim to improve intersection capacity by merely adjusting signal control parameters, becomes challenging since exiting strategies may (or already) have reached their “theoretical” limits of optimum. Under such circumstance, several novel unconventional intersection designs, including the well-recognized continuous flow intersection (CFI) design, are originated to improve the capacity at bottleneck intersections. However, the requirement of installing extra sub-intersections in a CFI design would increase vehicular stops and, more critically, is unacceptable in tight urban areas with closed spaced intersections. To address these issues, this research proposes a simplified continuous flow intersection (called CFI-Lite) design that is ideal for arterials with short links. It benefits from the CFI concept to enable simultaneous move of left-turn and through traffic at bottleneck intersections, but does not need installation of sub-intersections. Instead, the upstream intersection is utilized to allocate left-turn traffic to the displaced left-turn lane. It is found that the CFI-Lite design performs superiorly to the conventional design and regular CFI design in terms of bottleneck capacity. Pareto capacity improvement for every traffic stream in an arterial system can be achieved under effortless conditions. Case study using data collected at Foothill Blvd in Los Angeles, CA, shows that the new design is beneficial in more than 90% of the 408 studied cycles. The testing also shows that the average improvements of green bandwidths for the synchronized phases are significant.     

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.     

Lane-based real-time queue length estimation using license plate recognition data

License plate recognition (LPR) data are emerging data sources that provide rich information in estimating the traffic conditions of urban arterials. While large-scale LPR system is not common in US, last few years have seen rapid developments and implementations in many other parts of world (e.g. China, Thailand and Middle East). Due to privacy issues, LPR data are seldom available to research communities. However, when available, this data source can be valuable in estimating real-time operational metrics in transportation systems. This paper proposes a lane-based real-time queue length estimation model using the license plate recognition (LPR) data. In the model, an interpolation method based on Gaussian process is developed to reconstruct the equivalent cumulative arrival–departure curve for each lane. The missing information for unrecognized or unmatched vehicles is obtained from the reconstructed arrival curve. With the complete arrival and departure information, a car-following based simulation scheme is applied to estimate the real-time queue length for each lane. The proposed model is validated using ground truth information of the maximum queue lengths from the city of Langfang in China. The results show that the model can capture the variations in queue lengths in the ground truth data, and the maximum queue length for each signal cycle can be estimated with a reasonable accuracy. The estimated queue length information using the proposed model can serve as a useful performance metric for various real-time traffic control applications.     

Point queue models: A unified approach

In transportation and other types of facilities, various queues arise when the demands of service are higher than the supplies, and many point and fluid queue models have been proposed to study such queueing systems. However, there has been no unified approach to deriving such models, analyzing their relationships and properties, and extending them for networks. In this paper, we derive point queue models as limits of two link-based queueing model: the link transmission model and a link queue model. With two definitions for demand and supply of a point queue, we present four point queue models, four approximate models, and their discrete versions. We discuss the properties of these models, including equivalence, well-definedness, smoothness, and queue spillback, both analytically and with numerical examples. We then analytically solve Vickrey’s point queue model and stationary states in various models. We demonstrate that all existing point and fluid queue models in the literature are special cases of those derived from the link-based queueing models. Such a unified approach leads to systematic methods for studying the queueing process at a point facility and will also be helpful for studies on stochastic queues as well as networks of queues.     

Network Signal Setting Design: Meta-heuristic optimisation methods

This paper aims to investigate the application of meta-heuristic optimisation methods to Network Signal Setting Design. The adopted approaches are (i) three step optimisation, in which first the stage matrix (stage composition and sequence), the green timings at each single junction are optimised, then the node offsets are computed in three successive steps; (ii) two step optimisation, in which the stage matrix is defined at a first step, then the green timings and the node offsets are computed at a second step. In both approaches the stage matrix optimisation is carried out through explicit complete enumeration.In the first approach multi-criteria optimisation is followed for single junction signal setting design (green timings), whilst the coordination (node offsets) is approached through mono-criterion optimisation, as well as for the synchronisation (green timings and offsets) in the second approach.A new traffic flow model mixing CTM and PDM has been applied. This model allows to explicitly represent horizontal queuing phenomena as well as dispersion along a link. Some meta-heuristic algorithms (i.e. Genetic Algorithms, Hill Climbing and Simulated Annealing) are investigated in order to solve the two problems.The proposed strategies are applied to two different layouts (a two junction arterial vs. a four junction network) and their effectiveness is evaluated by comparing the obtained results with those from benchmark approaches implementing mono-criterion optimisation only.     

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.     

An application of shock wave theory to traffic signal control

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

An investigation of multiplier effects generated by implementing queue jump lanes at multiple intersections

This paper investigates the combination effects of queue jump lanes (QJLs) on signalised arterials to establish if a multiplier effect exists, that is, the benefit from providing QJLs at multiple intersections is higher than the sum of benefits from providing them individually at each of those intersections. To explore the combination effects on bus delay and total person delay, a delay estimation model is developed using kinematic wave theory, kinematic equations and Monte Carlo simulation. In addition, to investigate the combination effects in offset settings optimised for bus delay or total person delay, offset optimisation models are proposed. Validation results using traffic micro‐simulation indicate the effectiveness and computational efficiency of the proposed models. Results of a modelling test bed suggest that providing QJLs at multiple intersections can create a multiplier effect on one‐directional bus delay savings with signal offsets that provide bus progression. Furthermore, optimising offsets to minimise bus delay tends to create a multiplier effect on one‐directional bus delay savings, particularly when variations in dwell times are not high. The reason for the multiplier effect may be that providing QJLs reduces variations in bus travel times, which makes signal coordination for buses perform more effectively. From a policy perspective, the existence of a multiplier effect suggests that a corridor‐wide scale implementation of QJLs has considerable merit. Copyright © 2016 John Wiley & Sons, Ltd.     

Adaptive traffic signal control with equilibrium constraints under stochastic demand

This study develops a methodology to model transportation network design with signal settings in the presence of demand uncertainty. It is assumed that the total travel demand consists of commuters and infrequent travellers. The commuter travel demand is deterministic, whereas the demand of infrequent travellers is stochastic. Variations in demand contribute to travel time uncertainty and affect commuters’ route choice behaviour. In this paper, we first introduce an equilibrium flow model that takes account of uncertain demand. A two-stage stochastic program is then proposed to formulate the network signal design under demand uncertainty. The optimal control policy derived under the two-stage stochastic program is able to (1) optimize the steady-state network performance in the long run, and (2) respond to short-term demand variations. In the first stage, a base signal control plan with a buffer against variability is introduced to control the equilibrium flow pattern and the resulting steady-state performance. In the second stage, after realizations of the random demand, recourse decisions of adaptive signal settings are determined to address the occasional demand overflows, so as to avoid transient congestion. The overall objective is to minimize the expected total travel time. To solve the two-stage stochastic program, a concept of service reliability associated with the control buffer is introduced. A reliability-based gradient projection algorithm is then developed. Numerical examples are performed to illustrate the properties of the proposed control method as well as its capability of optimizing steady-state performance while adaptively responding to changing traffic flows. Comparison results show that the proposed method exhibits advantages over the traditional mean-value approach in improving network expected total travel times.     

Queue length estimation at metered freeway‐to‐freeway connectors

Freeway‐to‐freeway connector metering is a cost‐effective and proven freeway management strategy for relieving recurrent congestion. However, one of the critical challenges in design and operation of freeway‐to‐freeway connector metering is the lack of up‐to‐date queue storage length design guidance. In this study, it was found that ramp queue is dynamically related to the metering rate, on‐ramp demand, and traffic flow arrival pattern. Hence, simply using an average demand cannot provide accurate queue length estimation and is also not suitable for queue storage design where the maximum or a percentile queue length is generally used. A mesoscopic queue length simulation model was developed based on the input–output method for estimating queue lengths under various demand‐to‐capacity ratio scenarios. Simulation results indicate that for under‐saturated situations, the ramp queue may exist temporally due to the random short‐term surge of traffic arrivals, and the exponential function could best capture the relationship between queue length and demand‐to‐capacity ratio. For over‐saturated situations, the ramp queue tends to prolong linearly with the demand‐to‐capacity ratio. Based on the simulation, it was recommended that queue storage length be designed as 4.3% of on‐ramp demand when demand is lower than 1200 vph or 2.3% when demand is between 1200 and 2400 vph. Copyright © 2016 John Wiley & Sons, Ltd.     

A virtual vehicle probe model for time-dependent travel time estimation on signalized arterials

Estimation of time-dependent arterial travel time is a challenging task because of the interrupted nature of urban traffic flows. Many research efforts have been devoted to this topic, but their successes are limited and most of them can only be used for offline purposes due to the limited availability of traffic data from signalized intersections. In this paper, we describe a real-time arterial data collection and archival system developed at the University of Minnesota, followed by an innovative algorithm for time-dependent arterial travel time estimation using the archived traffic data. The data collection system simultaneously collects high-resolution “event-based” traffic data including every vehicle actuations over loop detector and every signal phase changes from multiple intersections. Using the “event-based” data, we estimate time-dependent travel time along an arterial by tracing a virtual probe vehicle. At each time step, the virtual probe has three possible maneuvers: acceleration, deceleration and no-speed-change. The maneuver decision is determined by its own status and surrounding traffic conditions, which can be estimated based on the availability of traffic data at intersections. An interesting property of the proposed model is that travel time estimation errors can be self-corrected, because the trajectory differences between a virtual probe vehicle and a real one can be reduced when both vehicles meet a red signal phase and/or a vehicle queue. Field studies at a 11-intersection arterial corridor along France Avenue in Minneapolis, MN, demonstrate that the proposed model can generate accurate time-dependent travel times under various traffic conditions.     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.