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.     

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.     

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.     

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.     

Estimation of mean and covariance of stochastic multi-class OD demands from classified traffic counts

This paper proposes a new model to estimate the mean and covariance of stochastic multi-class (multiple vehicle classes) origin–destination (OD) demands from hourly classified traffic counts throughout the whole year. It is usually assumed in the conventional OD demand estimation models that the OD demand by vehicle class is deterministic. Little attention is given on the estimation of the statistical properties of stochastic OD demands as well as their covariance between different vehicle classes. Also, the interactions between different vehicle classes in OD demand are ignored such as the change of modes between private car and taxi during a particular hourly period over the year. To fill these two gaps, the mean and covariance matrix of stochastic multi-class OD demands for the same hourly period over the year are simultaneously estimated by a modified lasso (least absolute shrinkage and selection operator) method. The estimated covariance matrix of stochastic multi-class OD demands can be used to capture the statistical dependency of traffic demands between different vehicle classes. In this paper, the proposed model is formulated as a non-linear constrained optimization problem. An exterior penalty algorithm is adapted to solve the proposed model. Numerical examples are presented to illustrate the applications of the proposed model together with some insightful findings on the importance of covariance of OD demand between difference vehicle classes.     

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.     

Modeling traffic operation at signalized intersections without explicit left‐turn yielding rules with an enhanced cell transmission model

This paper presents an enhanced cell transmission model (CTM) to capture traffic operation at signalized intersections without explicit permissive left‐turn yielding rules (i.e. aggressive permissive left‐turn maneuvers may not necessarily yield to opposing through traffic), which can be widely observed in many developing countries. Different from previous studies that focus on traffic dynamics on approaching links, this study contributes to modeling traffic operations within the intersection. A novel cell transmission framework with various types of virtual cells is proposed to model the dynamics of traffic movements from approach to exit. The unique phenomenon of competitive occupying of the conflict point between the left turn and opposing through movements is modeled. The cell state indicating its blockage is proposed to capture the dynamic queue formulation and dissipation and to evaluate the operational traffic performance at the intersection. Field validation results show that the proposed model can capture the operation of traffic at signalized intersections without explicit permissive left‐turn yielding rules with significantly higher level of accuracy than traditional traffic flow models. Copyright © 2016 John Wiley & Sons, Ltd.     

Network traffic flow optimization under performance constraints

In this paper, a model-based perimeter control policy for large-scale urban vehicular networks is proposed. Assuming a homogeneously loaded vehicle network and the existence of a well-posed Network Fundamental Diagram (NFD), we describe a protected network throughout its aggregated dynamics including nonlinear exit flow characteristics. Within this framework of constrained optimal boundary flow gating, two main performance metrics are considered: (a) first, connected to the NFD, the concept of average network travel time and delay as a performance metric is defined; (b) second, at boundaries, we take into account additional external network queue dynamics governed by uncontrolled inflow demands. External queue capacities in terms of finite-link lengths are used as the second performance metric. Hence, the corresponding performance requirement is an upper bound of external queues. While external queues represent vehicles waiting to enter the protected network, internal queue describes the protected network’s aggregated behavior.By controlling the number of vehicles joining the internal queue from the external ones, herewith a network traffic flow maximization solution subject to the internal and external dynamics and their performance constraints is developed. The originally non-convex optimization problem is transformed to a numerically efficiently convex one by relaxing the performance constraints into time-dependent state boundaries. The control solution can be interpreted as a mechanism which transforms the unknown arrival process governing the number of vehicles entering the network to a regulated process, such that prescribed performance requirements on travel time in the network and upper bound on the external queue are satisfied. Comparative numerical simulation studies on a microscopic traffic simulator are carried out to show the benefits of the proposed method.     

Some comments on origin–destination matrix estimation

Estimation of origin–destination (O–D) matrices from link count data is considered. This problem is challenging because the number of parameters to be estimated is typically larger than the number of network links. As a result, it is (usually) impossible to identify a unique optimal estimate of the O–D matrix from mean link traffic counts. However, information from the covariance matrix of link count data collected over a sequence of days can relieve this problem of indeterminacy. This fact is illustrated through a simple example. The use of second-order statistical properties of the data in O–D matrix estimation is then explored, and a class of estimators proposed. Practical problems of model mis-specification are discussed and some avenues for future research outlined.     

Dynamic network traffic control

This study developed a dynamic traffic control formulation designated as dynamic intersection signal control optimization (DISCO). Traffic in DISCO is modeled after the cell-transmission model (CTM), which is a convergent numerical approximation to the hydrodynamic model of traffic flow. It considers the entire fundamental diagram and captures traffic phenomena such as shockwaves and queue dynamics. As a dynamic approach, the formulation derives dynamic timing plans for time-variant traffic patterns. We solved DISCO based on a genetic algorithm (GA) approach and applied it to a traffic black spot in Hong Kong that is notorious for severe congestion. For performance comparisons, we also applied TRANSYT to the same scenarios. The Results showed that DISCO outperformed TRANSYT for all the scenarios tested especially in congested traffic. For the congested scenarios, DISCO could reduce delay by as much as 33% when compared with TRANSYT. Even for the uncongested scenarios, DISCO’s delays could be smaller by as much as 23%.     

A novel traffic signal control formulation

A novel traffic signal control formulation is developed through a mixed integer programming technique. The formulation considers dynamic traffic, uses dynamic traffic demand as input, and takes advantage of a convergent numerical approximation to the hydrodynamic model of traffic flow. As inherent from the underlying hydrodynamic model, this formulation covers the whole range of the fundamental relationships between speed, flow, and density. Kinematic waves of the stop-and-go traffic associated with traffic signals are also captured. Because of this property, one does not need to tune or switch the model for the different traffic conditions. It “automatically” adjusts to the different traffic conditions. We applied the model to three demand scenarios in a simple network. The results seemed promising. This model produced timing plans that are consistent with models that work for unsaturated conditions. In gridlock conditions, it produced a timing plan that was better than conventional queue management practices.     

A dynamic linear model for the estimation of time‐varying origin–destination matrices from link counts

We propose a dynamic linear model (DLM) for the estimation of day‐to‐day time‐varying origin–destination (OD) matrices from link counts. Mean OD flows are assumed to vary over time as a locally constant model. We take into account variability in OD flows, route flows, and link volumes. Given a time series of observed link volumes, sequential Bayesian inference is applied in order to estimate mean OD flows. The conditions under which mean OD flows may be estimated are established, and computational studies on two benchmark transportation networks from the literature are carried out. In both cases, the DLM converged to the unobserved mean OD flows when given sufficient observations of traffic link volumes despite assuming uninformative prior OD matrices. We discuss limitations and extensions of the proposed DLM. Copyright © 2017 John Wiley & Sons, Ltd.     

Variable speed limit control for severe non-recurrent freeway bottlenecks

Variable speed limit (VSL) schemes are developed based on the Kinematic Wave theory to increase discharge rates at severe freeway bottlenecks induced by non-recurrent road events such as incidents or work zones while smoothing speed transition. The main control principle is to restrict upstream demand (in free-flow) progressively to achieve three important objectives: (i) to provide gradual speed transition at the tail of an event-induced queue, (ii) to clear the queue around the bottleneck, and (iii) to discharge traffic at the stable maximum flow that can be sustained at the bottleneck without breakdown. These control objectives are accomplished without imposing overly restrictive speed limits. We further provide remedies for (a) underutilized bottleneck capacity due to underestimated stable maximum flow and (b) a re-emergent queue at the bottleneck due to an overestimated stable maximum flow. We analytically formulate the reductions in total delay in terms of control parameters to provide an insight into the system performance and sensitivity. The results from the parameter analysis suggest that significant delay savings can be realized with the proposed VSL control strategies.     

A stochastic model of traffic flow: Theoretical foundations

In a variety of applications of traffic flow, including traffic simulation, real-time estimation and prediction, one requires a probabilistic model of traffic flow. The usual approach to constructing such models involves the addition of random noise terms to deterministic equations, which could lead to negative traffic densities and mean dynamics that are inconsistent with the original deterministic dynamics. This paper offers a new stochastic model of traffic flow that addresses these issues. The source of randomness in the proposed model is the uncertainty inherent in driver gap choice, which is represented by random state dependent vehicle time headways. A wide range of time headway distributions is allowed. From the random time headways, counting processes are defined, which represent cumulative flows across cell boundaries in a discrete space and continuous time conservation framework. We show that our construction implicitly ensures non-negativity of traffic densities and that the fluid limit of the stochastic model is consistent with cell transmission model (CTM) based deterministic dynamics.     

The treatment of uncertainty in the dynamic origin–destination estimation problem using a fuzzy approach

Regardless of existing types of transportation and traffic model and their applications, the essential input to these models is travel demand, which is usually described using origin–destination (OD) matrices. Due to the high cost and time required for the direct development of such matrices, they are sometimes estimated indirectly from traffic measurements recorded from the transportation network. Based on an assumed demand profile, OD estimation problems can be categorized into static or dynamic groups. Dynamic OD demand provides valuable information on the within-day fluctuation of traffic, which can be employed to analyse congestion dissipation. In addition, OD estimates are essential inputs to dynamic traffic assignment (DTA) models. This study presents a fuzzy approach to dynamic OD estimation problems. The problems are approached using a two-level model in which demand is estimated in the upper level and the lower level performs DTA via traffic simulation. Using fuzzy rules and the fuzzy C-Mean clustering approach, the proposed method treats uncertainty in historical OD demand and observed link counts. The approach employs expert knowledge to model fitted link counts and to set boundaries for the optimization problem by defining functions in the fuzzification process. The same operation is performed on the simulation outputs, and the entire process enables different types of optimization algorithm to be employed. The Box-complex method is utilized as an optimization algorithm in the implementation of the approach. Empirical case studies are performed on two networks to evaluate the validity and accuracy of the approach. The study results for a synthetic network and a real network demonstrate the robust performance of the proposed method even when using low-quality historical demand data.     

Identifying optimal data aggregation interval sizes for link and corridor travel time estimation and forecasting

With the recent increase in the deployment of ITS technologies in urban areas throughout the world, traffic management centers have the ability to obtain and archive large amounts of data on the traffic system. These data can be used to estimate current conditions and predict future conditions on the roadway network. A general solution methodology for identifying the optimal aggregation interval sizes for four scenarios is proposed in this article: (1) link travel time estimation, (2) corridor/route travel time estimation, (3) link travel time forecasting, and (4) corridor/route travel time forecasting. The methodology explicitly considers traffic dynamics and frequency of observations. A formulation based on mean square error (MSE) is developed for each of the scenarios and interpreted from a traffic flow perspective. The methodology for estimating the optimal aggregation size is based on (1) the tradeoff between the estimated mean square error of prediction and the variance of the predictor, (2) the differences between estimation and forecasting, and (3) the direct consideration of the correlation between link travel time for corridor/route estimation and forecasting. The proposed methods are demonstrated using travel time data from Houston, Texas, that were collected as part of the automatic vehicle identification (AVI) system of the Houston Transtar system. It was found that the optimal aggregation size is a function of the application and traffic condition.

Analytical model for information flow propagation wave under an information relay control strategy in a congested vehicle-to-vehicle communication environment

Vehicular traffic congestion in a vehicle-to-vehicle (V2V) communication environment can lead to congestion effects for information flow propagation. Such congestion effects can impact whether a specific information packet of interest can reach a desired location, and if so, in a timely manner to influence the traffic system performance. Motivated by the usefulness and timeliness of information propagation, this paper aims to characterize the information flow propagation wave (IFPW) for an information packet in a congested V2V communication environment under an information relay control strategy. This strategy seeks to exclude information that is dated in the communication buffer under a first-in, first-out queue discipline, from being relayed if the information flow regime is congested. It trades off the need to enable the dissemination of every information packet as far as possible, against the congestion effects that accrue because of the presence of multiple information packets. A macroscopic two-layer model is proposed to characterize the IFPW. The upper layer is formulated as integro-differential equations to characterize the information dissemination in space and time under this control strategy. The lower layer adopts the Lighthill-Whitham-Richards model to capture the traffic flow dynamics. Based on the upper layer model, a necessary condition is derived which quantifies the expected time length that needs to be reserved for broadcasting the information packet of interest so as to ensure the formation of an IFPW under a given density of V2V-equipped vehicles. When the necessary condition is satisfied under homogeneous conditions, it is shown that the information packet can be propagated at an asymptotic speed whose value can be derived analytically. Besides, under the proposed control strategy, only a proportion of vehicles (labeled asymptotic density of informed vehicles) can receive the specific information packet, which can be estimated by solving a nonlinear equation. The asymptotic IFPW speed, the asymptotic density of informed vehicles, and the necessary condition for the IFPW, help in evaluating the timeliness of information propagation and the influence of traffic dynamics on information propagation. In addition, the proposed model can be used to numerically estimate the IFPW speed for heterogeneous conditions, which can aid in the design of traffic management strategies built upon the timely propagation of information through V2V communication.     

Nonlinear gating control for urban road traffic network using the network fundamental diagram

This work proposes a nonlinear model predictive controller for the urban gating problem. The system model is formalized based on a research on existing models of the network fundamental diagram and the perimeter control systems. For the existing models, modifications are suggested: additional state variables are allocated to describe the queue dynamics at the network gates. Using the extended model, a nonlinear model predictive controller is designed offering a ‘non‐greedy’ policy compared with previous, ‘greedy’ gating control designs. The greedy and non‐greedy nonlinear model predictive control (NMPC) controllers are compared with a greedy linear feedback proportional‐integral‐derivative (PID) controller in different traffic situations. The proposed non‐greedy NMPC controller outperforms the other two approaches in terms of travel distance performance and queue lengths. The performance results justify the consideration of queue lengths in dynamic modeling, and the use of NMPC approach for controller design. Copyright © 2014 John Wiley & Sons, Ltd.     

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

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

Entropy weighted average method for the determination of a single representative path flow solution for the static user equilibrium traffic assignment problem

The formulation of the static user equilibrium traffic assignment problem (UETAP) under some simplifying assumptions has a unique solution in terms of link flows but not in terms of path flows. Large variations are possible in the path flows obtained using different UETAP solution algorithms. Many transportation planning and management applications entail the need for path flows. This raises the issue of generating a meaningful path flow solution in practice. Past studies have sought to determine a single path flow solution using the maximum entropy concept. This study proposes an alternate approach to determine a single path flow solution that represents the entropy weighted average of the UETAP path flow solution space. It has the minimum expected Euclidean distance from all other path flow solution vectors of the UETAP. The mathematical model of the proposed entropy weighted average method is derived and its solution stability is proved. The model is easy to interpret and generalizes the proportionality condition of Bar-Gera and Boyce (1999). Results of numerical experiments using networks of different sizes suggest that the path flow solutions for the UETAP using the proposed method are about identical to those obtained using the maximum entropy approach. The entropy weighted average method requires low computational effort and is easier to implement, and can therefore serve as a potential alternative to the maximum entropy approach in practice.