Conference Paper

Analytical Model for Queue Length Estimation at Signalized Intersections from Travel Time

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

Article
Full-text available
With the progress of information and sensing technologies, estimating vehicular queue length at signalized intersections becomes feasible and has attracted considerable attention. The existing studies provided a solid theoretical foundation for the estimation, however, the studies have some restrictions or limitations more or less. This paper presents a new methodology for estimating vehicular queue length at signalized intersections using multi-source detection data under both undersaturated and oversaturated conditions. The methodology applies the shockwave theory to model queue dynamics. Using data from probe vehicles and point detectors, analytical formulations for calculating the maximum and minimum (residual) queue lengths of each cycle are developed. Ground truth data was collected from numerical experiments conducted at two intersections in Shanghai, China to verify the proposed methodology. It is found that the methodology has mean absolute percentage errors of 17.09% and 12.28% respectively for maximum queue length estimation in two tests, which are reasonably effective. However, the methodology is unsatisfactory in estimating the residual queue length. Other limitations of the proposed models and algorithms are also discussed in the paper.
Article
Full-text available
We introduce in this paper the concept of vehicle indices in a cycle at a signalized intersection which are the positions of vehicles in the departure process of the cycle. We show that vehicle indices are closely related to the vehicle arrival and the departure processes at the intersection. Based on vehicle indices and sample travel times collected from mobile sensors, a three-layer Bayesian Network model is constructed to describe the stochastic intersection traffic flow by capturing the relationship of vehicle indices, and the arrival and departure processes. The non-homogeneous Poisson process and log-normal distributions are used respectively to model the stochastic arrival and departure processes. The methods of parameter learning and vehicle index inference are presented based on the observed intersection travel times. Simplification to the methods is discussed to reduce the computational effort of parameter learning and vehicle index estimation. The model is tested using data from NGSIM, a field test, and simulation with reasonable results.
Article
Full-text available
Vehicle delay and queue length are quantitative measures of intersection performance. The technological advancement in the field of vehicle sensors and traffic controllers has reached a point where it has enabled efficient measurement of these performance measures. Two techniques are presented for real-time measurement of vehicle delay and queue length at a signalized intersection, and these automated delay and queue estimates are compared with manually ground-truthed measurement. These techniques were evaluated at an instrumented intersection in Noblesville, Indiana. The root-mean-square error by both techniques was below 0.7 veh-s for estimation of average delay and less than 0.15 vehicle for estimation of average maximum queue length, both on a cycle-by-cycle basis.
Article
Full-text available
Intersection delays are the major contributing factor to arterial delays. Methods to estimate intersection delay patterns by using measured travel times are studied. The delay patterns provide a way to estimate the delay for any vehicle arriving at the intersection at any time, which is useful for providing time-dependent intersection delay information to the driving public. The model requires sampled travel times between two consecutive locations on arterial streets, one upstream and the other downstream of a signalized intersection, without the need to know sig- nal timing or traffic flow information. Signal phases can actually be esti- mated from the delay patterns, which is a unique feature of the proposed method in this paper. The proposed model is based on two observations regarding delays for signalized intersections: (a) delay can be approxi- mately represented by piecewise linear curves due to the characteristics of queue forming and discharging and (b) there is a nontrivial increase in delay after the start of the red time that enables detection of the start of a cycle. A least-squares-based algorithm is developed to match mea- sured delays in each cycle by using piecewise linear curves. The pro- posed model and algorithm are tested by using field experiment data with reasonable results.
Book
Full-text available
This book presents a systematic introduction to a new generation of models for solving dynamic travel choice problems including traveler's destination choice, departure/arrival time choice and route choice. These models are expected to function as off-line travel forecasting and evaluation tools, and eventually as on-line prediction and control models in advanced traveler information and traffic management systems. In addition to a rich set of new formulations and solution algorithms, the book provides a summary of the necessary mathematical background and concludes with a discussion of the requirements for model implementation.
Article
Full-text available
In urban transportation planning, it has become critical (1) to determine the travel time of a traveler and how it is affected by congestion, and (2) to understand how traffic distributes in a transportation network. In the first part of this paper, we derive an analytical function of travel time, based on the theory of kinematic waves. This travel-time function integrates the traffic dynamics as well as the effects of shocks. Numerical examples demonstrate the quality of the analytical function, in comparison with simulated travel times. In the second part of this paper, we incorporate the travel-time model within a dynamic user equilibrium (DUE) setting. We prove that the travel-time function is continuous and strictly monotone if the flow varies smoothly. We illustrate how the model applies to solve a large network assignment problem through a numerical example.
Article
This paper develops estimators for market penetration level and arrival rate in finding queue lengths from probe vehicles at isolated traffic intersections. Closed-form analytical expressions for expectations and variances of these estimators are formulated. Derived estimators are compared based on squared error losses. Effect of number of cycles (i.e., short-term and long-term performances), estimation at low penetration rates, and impact of combinations of derived estimators on queue length problem are also addressed. Fully analytical formulas with unknown parameters are derived to evaluate how queue length estimation errors change with respect to percent of probe vehicles in the traffic stream. Developed models can be used for the real-time cycle-to-cycle estimation of the queue lengths by inputting some of the fundamental information that probe vehicles provide (e.g., location, time, and count). Models are evaluated using VISSIM microscopic simulations with different arrival patterns. Numerical experiments show that the developed estimators are able to point the true arrival rate values at 5% probe penetration level with 10 cycles of data. For low penetrations such as 0.1%, large number of cycles of data is required by arrival rate estimators which are essential for overflow queue and volume-to-capacity ratios. Queue length estimation with tested parameter estimators is able to provide cycle-to-cycle errors within ± 5% of coefficient of variations with less than 5 cycles of probe data at 0.1% penetration for all arrival rates used.
Article
Queue length is one of the key measures in assessing arterial performances. Under heavy congestion, queues are difficult to estimate from either fixed-location sensors (such as loop detectors) or mobile sensors since they may exceed the region of detection, which is defined as long queue in the literature. While the long queue problem has been successfully addressed in the past using fixed-location sensors, whether this can be done using mobile traffic sensors remains unclear. In this paper, a queue length estimation method is proposed to solve this long queue problem using short vehicle trajectories obtained from mobile sensors. The method contains vehicle trajectory reconstruction models to estimate the missing deceleration or acceleration process of a vehicle. Long queue estimation models are then developed using the reconstructed vehicle trajectories. The proposed method can provide estimates of the queue profile and the maximum queue length of a cycle. The method is tested in a field experiment with reasonable results.
Article
This article presents methods to estimate the location of a vehicle in the queue based on the vehicle's travel time traversing a signalized intersection. The methods focus on the queue discharging process, and calculate the location (in the queue) and acceleration rate of the vehicle simultaneously using kinematic equations. If such location information can be calculated for multiple sampled vehicles in a cycle, the dynamic profile of queue length of the cycle can be estimated. By using travel times, the methods can be applied to data collected via many newly emerged traffic data collection systems such as mobile sensors. The proposed methods are tested using data from simulation, a field experiment, and the Next Generation Simulation (NGSIM), and are compared with a previously developed queue length method.
Article
In this study, we develop a real-time estimation approach for lane-based queue lengths. Our aim is to determine the numbers of queued vehicles in each lane, based on detector information at isolated signalized junctions. The challenges involved in this task are to identify whether there is a residual queue at the start time of each cycle and to determine the proportions of lane-to-lane traffic volumes in each lane. Discriminant models are developed based on time occupancy rates and impulse memories, as calculated by the detector and signal information from a set of upstream and downstream detectors. To determine the proportions of total traffic volume in each lane, the downstream arrivals for each cycle are estimated by using the Kalman filter, which is based on upstream arrivals and downstream discharges collected during the previous cycle. Both the computer simulations and the case study of real-world traffic show that the proposed method is robust and accurate for the estimation of lane-based queue lengths in real time under a wide range of traffic conditions. Calibrated discriminant models play a significant role in determining whether there are residual queued vehicles in each lane at the start time of each cycle. In addition, downstream arrivals estimated by the Kalman filter enhance the accuracy of the estimates by minimizing any error terms caused by lane-changing behavior.
Article
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.
Article
We propose Bayesian Network based methods for estimating the cycle by cycle queue length distribution of a signalized intersection. Queue length here is defined as the number of vehicles in a cycle which have experienced significant delays. The data input to the methods are sample travel times from mobile traffic sensors collected between an upstream location and a downstream location of the intersection. The proposed methods first classify traffic conditions and sample scenarios to seven cases. BN models are then developed for each case. The methods are tested using data from NGSIM, a field experiment, and microscopic traffic simulation. The results are satisfactory compared with two specific queue length estimation methods previously developed in the literature.
Article
As mobile traffic sensor technology gets more attention, mathematical models are being developed that utilize this new data type in various intelligent transportation systems applications. This study introduces simple analytical estimation models for queue lengths from tracked or probe vehicles at traffic signals using stochastic modeling approach. Developed models estimate cycle-to-cycle queue lengths by using primary parameters such as arrival rate, probe vehicle proportions, and signal phase durations. Valuable probability distributions and moment generating functions for probe information types are formulated. Fully analytical closed-form expressions are given for the case ignoring the overflow queue and approximation models are presented for the overflow case. Derived models are compared with the results from VISSIM-microscopic simulation. Analytical steady-state and cycle-to-cycle estimation errors are also derived. Numerical examples are shown for the errors of these estimators that change with probe vehicle market penetration levels, arrival rates, and volume-to-capacity ratios.
Article
The dynamics of formation and dissipation of queues at isolated signalized intersections are investigated by analyzing the vehicle conservation equation along the street. Solution of the conservation equation is obtained by the method of characteristics for general initial and boundary conditions, and the effect of the control variables (cycle length, green and red intervals) and system parameters (arrival rates, capacity) on the length of the queue is examined. The theoretical results are obtained by examining the dynamics of the shock waves which are formed because of the intermitted service of traffic by the signal. These results include analytical criteria for the development of saturated or unsaturated situations, analytical expressions for the maximum queue length and limits on the control variables so that the queues remain bounded. The basic findings of this study can be employed for the solution of the traffic signal optimal control problem.
Article
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.
Article
A new analytical multiclass dynamic network loading (DNL) model is proposed as part of a simulation-based dynamic traffic assignment (DTA) model. In contrast to many other proposed DNL models, this model explicitly deals with queuing and spillback without relying on link travel time functions as input. Different vehicle types (e.g., cars and trucks) are considered with different speeds. Use of link travel times is likely to under-or overestimate the true travel times in a dynamic model if queues are considered. The proposed DNL model consists of a link model and a node model. The link model computes queue inflows and potential outflows, whereas the node model determines the actual outflows depending on the node structure. In the end, the link travel times are computed backward in time for each vehicle type separately. The model has been implemented in the Indy DTA software, and an application shows that the approach is viable in real-life networks.
Article
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.
Article
Probe vehicles are increasingly receiving more attention as an alternative means of collecting real-time traffic data needed for system optimization. This paper focuses on real-time estimation of queue lengths from the location information of probe vehicles in a queue at an isolated and undersaturated intersection. The paper also addresses the evaluation of the accuracy of such estimates as a function of the market penetration of probe vehicles. An analytical formulation based on conditional probability distributions is developed for estimating the expected queue length and its variance. It is found that, for the given settings, only the location information of the last probe vehicle in the queue is sufficient for the estimation. Exact expressions for the conditional mean and variance of queue length are derived. Various numerical results are documented to show how estimation errors behave by the volume to capacity ratio and by market penetration.
Article
The number of vehicles included in a metered motorway ramp or an urban signalized link at any time is valuable information for real-time control. A Kalman-Filter is employed to produce reliable estimates of this quantity based on real-time measurements of flow and occupancy provided by (at least) three loop detectors. The resulting vehicle-count estimator is tested via microscopic simulation for a variety of metered ramp scenarios and traffic conditions. Several related fundamental issues are addressed: the effects of loop density, update period, downstream signal cycle, vehicle length and link length. The simulation investigations indicate a robust estimation performance with low calibration effort needed, which facilitates easy applicability of the method. (c) 2007 Elsevier Ltd. All rights reserved.
Article
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.
A Flow Based Approach To Dynamic Traffic Assignment
  • Y He