Norm approximation method for handling traffic count inconsistencies in path flow estimator

Path flow estimator (PFE) is a one-stage network observer proposed to estimate path flows and hence origin–destination (O–D) flows from traffic counts in a transportation network. Although PFE does not require traffic counts to be collected on all network links when inferring unmeasured traffic conditions, it does require all available counts to be reasonably consistent. This requirement is difficult to fulfill in practice due to errors inherited in data collection and processing. The original PFE model handles this issue by relaxing the requirement of perfect replication of traffic counts through the specification of error bounds. This method enhances the flexibility of PFE by allowing the incorporation of local knowledge, regarding the traffic conditions and the nature of traffic data, into the estimation process. However, specifying appropriate error bounds for all observed links in real networks turns out to be a difficult and time-consuming task. In addition, improper specification of the error bounds could lead to a biased estimation of total travel demand in the network. This paper therefore proposes the norm approximation method capable of internally handling inconsistent traffic counts in PFE. Specifically, three norm approximation criteria are adopted to formulate three L_p-PFE models for estimating consistent path flows and O–D flows that simultaneously minimize the deviation between the estimated and observed link volumes. A partial linearization algorithm embedded with an iterative balancing scheme and a column generation procedure is developed to solve the three L_p-PFE models. In addition, the proposed L_p-PFE models are illustrated with numerical examples and the characteristics of solutions obtained by these models are discussed.     

Designing heterogeneous sensor networks for estimating and predicting path travel time dynamics: An information-theoretic modeling approach

With a particular emphasis on the end-to-end travel time prediction problem, this paper proposes an information-theoretic sensor location model that aims to minimize total travel time uncertainties from a set of point, point-to-point and probe sensors in a traffic network. Based on a Kalman filtering structure, the proposed measurement and uncertainty quantification models explicitly take into account several important sources of errors in the travel time estimation/prediction process, such as the uncertainty associated with prior travel time estimates, measurement errors and sampling errors. By considering only critical paths and limited time intervals, this paper selects a path travel time uncertainty criterion to construct a joint sensor location and travel time estimation/prediction framework with a unified modeling of both recurring and non-recurring traffic conditions. An analytical determinant maximization model and heuristic beam-search algorithm are used to find an effective lower bound and solve the combinatorial sensor selection problem. A number of illustrative examples and one case study are used to demonstrate the effectiveness of the proposed methodology.     

Estimation of a time‐dependent origin‐destination matrix for congested highway networks

This paper presents a time‐dependent origin‐destination (O‐D) matrix estimation procedure embedded with a dynamic traffic assignment model, in which the predictive dynamic user optimal conditions in congested networks are maintained. Two solution algorithms are proposed, namely: an iterative (ITR) scheme and a method of successive averages (MSA) scheme. It is found that the MSA scheme outperforms the ITR scheme. As a prior O‐D matrix is an important input for the problem, its quality is essential for the reliability of the matrix estimation procedure. Empirical constraints are set in relation to the quality of the prior O‐D matrix for the estimation procedure. Numerical examples are used to demonstrate the effectiveness of the proposed methodology.     

Confidence interval estimation for path flow estimator

The uncertainty of an origin-destination (O-D) trip table estimate is affected by two factors: (i) the multiplicity of solutions due to the underspecified nature of the problem, and (ii) the errors of traffic counts. In this paper, a confidence interval estimation procedure for path flow estimator (PFE) is developed for assessing the quality of O-D trip tables estimated from traffic counts. The confidence interval estimation consists of two parts: (i) a generalized demand scale (GDS) measure for quantifying the intrinsic underspecified nature of the O-D estimation problem at various spatial levels, and (ii) an error bound to quantify the contribution of input errors (traffic counts) to the estimation results. Numerical results using PFE as the O-D estimator show that the proposed confidence interval estimation procedure is able to separate the two sources of uncertainty in constructing the confidence intervals at various spatial levels. Simulation results also confirm that the proposed quality measure indeed contain the true estimates within the defined confidence intervals.     

Cooperative GNSS positioning aided by road-features measurements

Cooperation between road users through V2X communication is a way to improve GNSS localization accuracy. When vehicles localization systems involve standalone GNSS receivers, the resulting accuracy can be affected by satellite-specific errors of several meters. This paper studies how road-features like lane marking detected by on-board cameras can be exploited to reduce absolute position errors of cooperative vehicles sharing information in real-time in a network. The algorithms considered in this work are based on a error bounded set membership strategy. In every vehicle, a set membership algorithm computes the absolute position and an estimation of the satellite-specific errors by using raw GNSS pseudoranges, lane boundary measurements and a 2D georeferenced road map which provides absolute geometric constraints. As lane-boundary measurements provide essentially cross-track corrections in the position estimation process, cooperation enables the vehicles to improve their own estimates thanks to the different orientation of the roads. Set-membership methods are very efficient to solve this problem since they do not involve any independence hypothesis of the errors and so, the same information can be used several times in the computation. Such class of algorithm provides a novel approach to improve position accuracy for connected vehicles guaranteeing the integrity of the computed solution which is pivoting for automated automotive systems requiring guaranteed safety-critical solutions. Results from simulations and real experiments show that sharing position corrections reduces significantly satellite-specific GNSS errors effects in both cross-track and along-track components. Moreover, it is shown that lane-boundary measurements help reducing estimation errors for all the networked vehicles even those which are not equipped with an embedded perception system.     

Modeling the effects of traveler information on freeway origin–destination demand prediction

The primary focus of this research is to develop an approach to capture the effect of travel time information on travelers’ route switching behavior in real-time, based on on-line traffic surveillance data. It also presents a freeway Origin–Destination demand prediction algorithm using an adaptive Kalman Filtering technique, where the effect of travel time information on users’ route diversion behavior has been explicitly modeled using a dynamic, aggregate, route diversion model. The inherent dynamic nature of the traffic flow characteristics is captured using a Kalman Filter modeling framework. Changes in drivers’ perceptions, as well as other randomness in the route diversion behavior, have been modeled using an adaptive, aggregate, dynamic linear model where the model parameters are updated on-line using a Bayesian updating approach. The impact of route diversion on freeway Origin–Destination demands has been integrated in the estimation framework. The proposed methodology is evaluated using data obtained from a microscopic traffic simulator, INTEGRATION. Experimental results on a freeway corridor in northwest Indiana establish that significant improvement in Origin–Destination demand prediction can be achieved by explicitly accounting for route diversion behavior.     

Minimal-revenue congestion pricing Part II: An efficient algorithm for the general case

The second of a two-part series, this paper derives an efficient solution to the minimal-revenue tolls problem. As introduced in Part I, this problem can be defined as follows: Assuming each trip uses only a path whose generalized cost is smallest, find a set of arc tolls that simultaneously minimizes both average travel time and out-of-pocket cost. As a point of departure, this paper first re-solves the single-origin problem of Part I, modeling it as a linear program. Then with a change of variable, it transforms the LP's dual into a simple longest-path problem on an acyclic network. The multiple-origin problem – where one toll for each arc applies to all origins – solves analogously. In this case, however, the dual becomes an elementary linear multi-commodity max-cost flow problem with an easy bundling constraint and infinite arc capacities. After a minor reformulation that simplifies the model's input to better accommodate output from common traffic assignment software, a solution algorithm is exemplified with a numerical example.     

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.     

Origin-destination trip table estimation based on subarea network OD flow and vehicle trajectory data

Identifying accurate origin-destination (O-D) travel demand is one of the most important and challenging tasks in the transportation planning field. Recently, a wide range of traffic data has been made available. This paper proposes an O-D estimation model using multiple field data. This study takes advantage of emerging technologies – car navigation systems, highway toll collecting systems and link traffic counts – to determine O-D demand. The proposed method is unique since these multiple data are combined to improve the accuracy of O-D estimation for an entire network. We tested our model on a sample network and found great potential for using multiple data as a means of O-D estimation. The errors of a single input data source do not critically affect the model’s overall accuracy, meaning that combining multiple data provides resilience to these errors. It is suggested that the model is a feasible means for more reliable O-D estimation.     

Computing 4D near-optimal trajectories for dynamic air traffic flow management with column generation and branch-and-price

Abstract

The current air traffic system faces recurrent saturation problems. Numerous studies are dedicated to this issue, including the present research on a new dynamic regulation filter holding frequent trajectory optimisations in a real-time sliding horizon loop process. We consider a trajectory optimisation problem arising in this context, where a feasible four-dimensional (4D) trajectory is to be built and assigned to each regulated flight to suppress sector overloads while minimising the cost of the chosen policy. We model this problem with a mixed integer linear programme and solve it with a branch-and-price approach. The pricing sub-problem looks for feasible trajectories in a dynamic three-dimensional (3D) network and is solved with a specific algorithm based on shortest path labelling algorithms and on dynamic programming. Each algorithm is tested on real-world data corresponding to a complete traffic day in the European air traffic system; experimental results, including computing times measurement, validate the solution process.     

Estimation of origin-destination matrices from link traffic counts on congested networks

Conventional methods for estimating origin-destination (O-D) trip matrices from link traffic counts assume that route choice proportions are given constants. In a network with realistic congestion levels, this assumption does not hold. This paper shows how existing methods such as the generalized least squares technique can be integrated with an equilibrium traffic assignment in the form of a convex bilevel optimization problem. The presence of measurement errors and time variations in the observed link flows are explicitly considered. The feasibility of the model is always guaranteed without a requirement for estimating consistent link flows from counts. A solution algorithm is provided and numerical simulation experiments are implemented in investigating the model's properties. Some related problems concerning O-D matrix estimation are also discussed.     

More robust and better: a multiple kernel support vector machine ensemble approach for traffic incident detection

This paper presents a multiple kernel support vector machine (MKL‐SVM) ensemble algorithm to detect traffic incidents. It uses resampling technology to generate training set, test set, and training subset firstly; then uses different training subsets to train individual MKL‐SVM classifiers; and finally introduces ensemble methods to construct MKL‐SVM ensemble to detect traffic incidents. Extensive experiments have been performed to evaluate the performances of the four algorithms: standard SVM, SVM ensemble, MKL‐SVM, and the proposed algorithm (MKL‐SVM ensemble). The experimental results show that the proposed algorithm has the best comprehensive performances in traffic incidents detection. To achieve better performances, the proposed algorithm needs less individual classifiers to construct the ensemble than SVM ensemble algorithm. Thus, compared with SVM ensemble algorithm, the complexity of the ensemble classifier of the proposed algorithm is reduced greatly. Conveniently, the proposed algorithm also avoids the burden of selecting the appropriate kernel function and parameters. Copyright © 2013 John Wiley & Sons, Ltd.     

A real-time traffic signal control system: architecture, algorithms, and analysis

The paper discusses a real-time traffic-adaptive signal control system referred to as RHODES. The system takes as input detector data for real-time measurement of traffic flow, and “optimally” controls the flow through the network. The system utilizes a control architecture that (1) decomposes the traffic control problem into several subproblems that are interconnected in an hierarchical fashion, (2) predicts traffic flows at appropriate resolution levels (individual vehicles and platoons) to enable pro-active control, (3) allows various optimization modules for solving the hierarchical subproblems, and (4) utilizes a data structure and computer/communication approaches that allow for fast solution of the subproblems, so that each decision can be downloaded in the field appropriately within the given rolling time horizon of the corresponding subproblem. The RHODES architecture, algorithms, and its analysis are presented. Laboratory test results, based on implementation of RHODES on simulation models of actual scenarios, illustrate the effectiveness of the system.     

Real-time estimation of turning movement counts at signalized intersections using signal phase information

A variety of sensor technologies, such as loop detectors, traffic cameras, and radar have been developed for real-time traffic monitoring at intersections most of which are limited to providing link traffic information with few being capable of detecting turning movements. Accurate real-time information on turning movement counts at signalized intersections is a critical requirement for applications such as adaptive traffic signal control. Several attempts have been made in the past to develop algorithms for inferring turning movements at intersections from entry and exit counts; however, the estimation quality of these algorithms varies considerably. This paper introduces a method to improve accuracy and robustness of turning movement estimation at signalized intersections. The new algorithm makes use of signal phase status to minimize the underlying estimation ambiguity. A case study was conducted based on turning movement data obtained from a four-leg signalized intersection to evaluate the performance of the proposed method and compare it with two other existing well-known estimation methods. The results show that the algorithm is accurate, robust and fairly straightforward for real world implementation.     

Isolated intersection control for various levels of vehicle technology: Conventional,connected, and automated vehicles

Connected vehicle technology can be beneficial for traffic operations at intersections. The information provided by cars equipped with this technology can be used to design a more efficient signal control strategy. Moreover, it can be possible to control the trajectory of automated vehicles with a centralized controller. This paper builds on a previous signal control algorithm developed for connected vehicles in a simple, single intersection. It improves the previous work by (1) integrating three different stages of technology development; (2) developing a heuristics to switch the signal controls depending on the stage of technology; (3) increasing the computational efficiency with a branch and bound solution method; (4) incorporating trajectory design for automated vehicles; (5) using a Kalman filter to reduce the impact of measurement errors on the final solution. Three categories of vehicles are considered in this paper to represent different stages of this technology: conventional vehicles, connected but non-automated vehicles (connected vehicles), and automated vehicles. The proposed algorithm finds the optimal departure sequence to minimize the total delay based on position information. Within each departure sequence, the algorithm finds the optimal trajectory of automated vehicles that reduces total delay. The optimal departure sequence and trajectories are obtained by a branch and bound method, which shows the potential of generalizing this algorithm to a complex intersection.Simulations are conducted for different total flows, demand ratios and penetration rates of each technology stage (i.e. proportion of each category of vehicles). This algorithm is compared to an actuated signal control algorithm to evaluate its performance. The simulation results show an evident decrease in the total number of stops and delay when using the connected vehicle algorithm for the tested scenarios with information level of as low as 50%. Robustness of this algorithm to different input parameters and measurement noises are also evaluated. Results show that the algorithm is more sensitive to the arrival pattern in high flow scenarios. Results also show that the algorithm works well with the measurement noises. Finally, the results are used to develop a heuristic to switch between the different control algorithms, according to the total demand and penetration rate of each technology.     

Guaranteed prediction and estimation of the state of a road network

The paper presents an algorithm for the prediction and estimation of the state of a road network comprising freeways and arterials, described by a Cell Transmission Model (CTM). CTM divides the network into a collection of links. Each link is characterized by its fundamental diagram, which relates link speed to link density. The state of the network is the vector of link densities. The state is observed through measurements of speed and flow on some links. Demand is specified by the volume of vehicles entering the network at some links, and by split ratios according to which vehicles are routed through the network. There is model uncertainty: the parameters of the fundamental diagram are uncertain. There is uncertainty in the demand around the nominal forecast. Lastly, the measurements are uncertain. The uncertainty in each model parameter, demand, and measurement is specified by an interval. Given measurements over a time interval [0, t] and a horizon τ ? 0, the algorithm computes a set of states with the guarantee that the actual state at time (t + τ) will lie in this set, consistent with the given measurements. In standard terminology the algorithm is a state prediction or an estimate accordingly as τ > 0 or =0. The flow exiting a link may be controlled by an open- or closed-loop controller such as a signal or ramp meter. An open-loop controller does not change the algorithm, indeed it may make the system more predictable by tightening density bounds downstream of the controller. In the feedback case, the value of the control depends on the estimated state bounds, and the algorithm is extended to compute the range of possible closed-loop control values. The algorithm is used in a proposed design of a decision support system for the I-80 integrated corridor.     

Vehicle reidentification and travel time measurement on congested freeways

The paper presents an algorithm for matching individual vehicles measured at a freeway detector with the vehicles’ corresponding measurements taken earlier at another detector located upstream. Although this algorithm is potentially compatible with many vehicle detector technologies, the paper illustrates the method using existing dual-loop detectors to measure vehicle lengths. This detector technology has seen widespread deployment for velocity measurement. Since the detectors were not developed to measure vehicle length, these measurements can include significant errors. To overcome this problem, the algorithm exploits drivers’ tendencies to retain their positions within dense platoons. The otherwise complicated task of vehicle reidentification is carried out by matching these platoons rather than individual vehicles. Of course once a vehicle has been matched across neighboring detector stations, the difference in its arrival time at each station defines the vehicle’s travel time on the intervening segment.Findings from an application of the algorithm over a 1/3 mile long segment are presented herein and they indicate that a sufficient number of vehicles can be matched for the purpose of traffic surveillance. As such, the algorithm extracts travel time data without requiring the deployment of new detector technologies. In addition to the immediate impacts on traffic monitoring, the work provides a means to quantify the potential benefits of emerging detector technologies that promise to extract more detailed information from individual vehicles.     

RENAISSANCE – A unified macroscopic model-based approach to real-time freeway network traffic surveillance

The paper presents a unified macroscopic model-based approach to real-time freeway network traffic surveillance as well as a software tool RENAISSANCE that has been recently developed to implement this approach for field applications. RENAISSANCE is designed on the basis of stochastic macroscopic freeway network traffic flow modeling, extended Kalman filtering, and a number of traffic surveillance algorithms. Fed with a limited amount of real-time traffic measurements, RENAISSANCE enables a number of freeway network traffic surveillance tasks, including traffic state estimation and short-term traffic state prediction, travel time estimation and prediction, queue tail/head/length estimation and prediction, and incident alarm. The traffic state estimation and prediction lay the operating foundation of RENAISSANCE since RENAISSANCE bases the other traffic surveillance tasks on its traffic state estimation or prediction results. The paper first introduces the utilized stochastic macroscopic freeway network traffic flow model and a real-time traffic measurement model, upon which the complete dynamic system model of RENAISSANCE is established with special attention to the handling of some important model parameters. The algorithms for the various traffic surveillance tasks addressed are described along with the functional architecture of the tool. A simulation test was conducted via application of RENAISSANCE to a hypothetical freeway network example with a sparse detector configuration, and the testing results are presented in some detail. Final conclusions and future work are outlined.     

A unified framework for estimating or updating origin/destination matrices from traffic counts

This paper presents an in-depth study of the methodology for estimating or updating origin-to-destination trip matrices from traffic counts. Following an analysis of the statistical foundation of the estimation and updating problems, various basic approaches are reviewed using a generic traffic assignment map. Computational issues related to specific assignment maps and estimation models for both road and transit networks are then discussed. Finally, additional insight into the relative performance of several estimators is provided by a set of test problems with varying input data.     

Multi-step prediction of experienced travel times using agent-based modeling

This paper develops an agent-based modeling approach to predict multi-step ahead experienced travel times using real-time and historical spatiotemporal traffic data. At the microscopic level, each agent represents an expert in a decision-making system. Each expert predicts the travel time for each time interval according to experiences from a historical dataset. A set of agent interactions is developed to preserve agents that correspond to traffic patterns similar to the real-time measurements and replace invalid agents or agents associated with negligible weights with new agents. Consequently, the aggregation of each agent’s recommendation (predicted travel time with associated weight) provides a macroscopic level of output, namely the predicted travel time distribution. Probe vehicle data from a 95-mile freeway stretch along I-64 and I-264 are used to test different predictors. The results show that the agent-based modeling approach produces the least prediction error compared to other state-of-the-practice and state-of-the-art methods (instantaneous travel time, historical average and k-nearest neighbor), and maintains less than a 9% prediction error for trip departures up to 60 min into the future for a two-hour trip. Moreover, the confidence boundaries of the predicted travel times demonstrate that the proposed approach also provides high accuracy in predicting travel time confidence intervals. Finally, the proposed approach does not require offline training thus making it easily transferable to other locations and the fast algorithm computation allows the proposed approach to be implemented in real-time applications in Traffic Management Centers.