A maximum entropy-least squares estimator for elastic origin-destination trip matrix estimation

In transportation subnetwork-supernetwork analysis, it is well known that the origin-destination (O-D) flow table of a subnetwork is not only determined by trip generation and distribution, but also a result from traffic routing and diversion, due to the existence of internal-external, external-internal and external-external flows. This result indicates the variable nature of subnetwork O-D flows. This paper discusses an elastic O-D flow table estimation problem for subnetwork analysis. The underlying assumption is that each cell of the subnetwork O-D flow table contains an elastic demand function rather than a fixed demand rate and the demand function can capture all traffic diversion effect under various network changes. We propose a combined maximum entropy-least squares estimator, by which O-D flows are distributed over the subnetwork in terms of the maximum entropy principle, while demand function parameters are estimated for achieving the least sum of squared estimation errors. While the estimator is powered by the classic convex combination algorithm, computational difficulties emerge within the algorithm implementation until we incorporate partial optimality conditions and a column generation procedure into the algorithmic framework. Numerical results from applying the combined estimator to a couple of subnetwork examples show that an elastic O-D flow table, when used as input for subnetwork flow evaluations, reflects network flow changes significantly better than its fixed counterpart.     

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.     

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.     

Transport demand model estimation from traffic counts

Many problems in transport planning and management tasks require an origindestination (O-D) matrix to represent the travel pattern. However, O-D matrices obtained through a large scale survey such as home or roadside interviews, tend to be costly, labour intensive and time disruptive to trip makers. Therefore, the use of low cost and easily available data is particularly attractive.The need of low-cost methods to estimate current and future O-D matrices is even more valuable in developing countries because of the rapid changes in population, economic activity and land use. Models of transport demand have been used for many years to synthesize O-D matrices in study areas. A typical example of this is the gravity model; its functional form, plus the appropriate values for the parameters involved, is employed to produce acceptable matrices representing trip making behaviour for many trip purposes and time periods.The work reported in this paper has combined the advantages of acceptable travel demand models with the low cost and availability of traffic counts. Three types of demand models have been used: gravity (GR), opportunity (OP) and gravity-opportunity (GO) models. Three estimation methods have been developed to calibrate these models from traffic counts, namely: non-linear-least-squares (NLLS), weighted-non-linear-least-squares (WNLLS) and maximumlikelihood (ML).The 1978 Ripon (urban vehicle movement) survey was used to test these methods. They were found to perform satisfactorily since each calibrated model reproduced the observed O-D matrix fairly closely. The tests were carried out using two assignment techniques, all-or-nothing and the stochastic method due to Burrell, in determining the routes taken through the network.requests for offprints     

On the variance of recurrent traffic flow for statistical traffic assignment

This paper generalizes and extends classical traffic assignment models to characterize the statistical features of Origin-Destination (O-D) demands, link/path flow and link/path costs, all of which vary from day to day. The generalized statistical traffic assignment (GESTA) model has a clear multi-level variance structure. Flow variance is analytically decomposed into three sources, O-D demands, route choices and measurement errors. Consequently, optimal decisions on roadway design, maintenance, operations and planning can be made using estimated probability distributions of link/path flow and system performance. The statistical equilibrium in GESTA is mathematically defined. Its multi-level statistical structure well fits large-scale data mining techniques. The embedded route choice model is consistent with the settings of O-D demands considering link costs that vary from day to day. We propose a Method of Successive Averages (MSA) based solution algorithm to solve for GESTA. Its convergence and computational complexity are analyzed. Three example networks including a large-scale network are solved to provide insights for decision making and to demonstrate computational efficiency.     

A new class of dynamic methods for the identification of origin-destination flows

A new systems dynamics approach for the identification of origin-destination (O-D) flows in a traffic system is presented. It is the basic idea of this approach that traffic flow through a facility is treated as a dynamic process in which the sequences of short-time exit flow counts depend by causal relationships upon the time-variable sequences of entrance flow volumes. In that way enough information can be obtained from the counts at the entrances and the exits to obtain unique and bias-free estimates for the unknown O-D flows without further a priori information. Four different methods were developed: an ordinary least squares estimator involving cross-correlation matrices, a constrained optimization method, a simple recursive estimation formula and estimation by Kalman filtering. The methods need only moderate computational effort and are particularly useful for tracking time-variable O-D patterns for on-line identification and control purposes. An analysis of the accuracy of the estimates and a discussion of the convergence properties of the methods are given. Finally, a comparison with some conventional static estimation procedures is carried out using synthetic as well as real data from several intersections. These tests demonstrated that the presented dynamic methods are highly superior to conventional techniques and produce more accurate results.     

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.     

Hierarchical travel demand estimation using multiple data sources: A forward and backward propagation algorithmic framework on a layered computational graph

Aiming to develop a theoretically consistent framework to estimate travel demand using multiple data sources, this paper first proposes a multi-layered Hierarchical Flow Network (HFN) representation to structurally model different levels of travel demand variables including trip generation, origin/destination matrices, path/link flows, and individual behavior parameters. Different data channels from household travel surveys, smartphone type devices, global position systems, and sensors can be mapped to different layers of the proposed network structure. We introduce Big data-driven Transportation Computational Graph (BTCG), alternatively Beijing Transportation Computational Graph, as the underlying mathematical modeling tool to perform automatic differentiation on layers of composition functions. A feedforward passing on the HFN sequentially implements 3 steps of the traditional 4-step process: trip generation, spatial distribution estimation, and path flow-based traffic assignment, respectively. BTCG can aggregate different layers of partial first-order gradients and use the back-propagation of “loss errors” to update estimated demand variables. A comparative analysis indicates that the proposed methods can effectively integrate different data sources and offer a consistent representation of demand. The proposed methodology is also evaluated under a demonstration network in a Beijing subnetwork.     

Urban traffic state estimation: Fusing point and zone based data

Loop detectors are the oldest and widely used traffic data source. On urban arterials, they are mainly installed for signal control. Recently state-of-the art Bluetooth MAC Scanners (BMS) has significantly captured the interest of stakeholders for exploiting it for area-wide traffic monitoring. Loop detectors provide flow – a fundamental traffic parameter; whereas BMS provides individual vehicle travel time between BMS stations. Hence, these two data sources complement each other, and if integrated should increase the accuracy and reliability of the traffic state estimation.This paper proposed a model that integrates loops and BMS data for seamless travel time and density estimation for urban signalised network. The proposed model is validated using both real and simulated data and the results indicate that the accuracy of the proposed model is over 90%.     

The estimation of a time-dependent OD trip table with vehicle trajectory samples

Abstract

In this paper we discuss a dynamic origin–destination (OD) estimation problem that has been used for identifying time-dependent travel demand on a road network. Even though a dynamic OD table is an indispensable data input for executing a dynamic traffic assignment, it is difficult to construct using the conventional OD construction method such as the four-step model. For this reason, a direct estimation method based on field traffic data such as link traffic counts has been used. However, the method does not account for a logical relationship between a travel demand pattern and socioeconomic attributes. In addition, the OD estimation method cannot guarantee the reliability of estimated results since the OD estimation problem has a property named the ‘underdetermined problem.’ In order to overcome such a problem, the method developed in this paper makes use of vehicle trajectory samples with link traffic counts. The new method is applied to numerical examples and shows promising capability for identifying a temporal and spatial travel demand pattern.     

Inferring origin–destination trip matrices from aggregate volumes on groups of links: a case study using volumes inferred from mobile phone data

The origin–destination matrix is an important source of information describing transport demand in a region. Most commonly used methods for matrix estimation use link volumes collected on a subset of links in order to update an existing matrix. Traditional volume data collection methods have significant shortcomings because of the high costs involved and the fact that detectors only provide status information at specified locations in the network. Better matrix estimates can be obtained when information is available about the overall distribution of traffic through time and space. Other existing technologies are not used in matrix estimation methods because they collect volume data aggregated on groups of links, rather than on single links. That is the case of mobile systems. Mobile phones sometimes cannot provide location accuracy for estimating flows on single links but do so on groups of links; in contrast, data can be acquired over a wider coverage without additional costs. This paper presents a methodology adapted to the concept of volume aggregated on groups of links in order to use any available volume data source in traditional matrix estimation methodologies. To calculate volume data, we have used a model that has had promising results in transforming phone call data into traffic movement data. The proposed methodology using vehicle volumes obtained by such a model is applied over a large real network as a case study. The experimental results reveal the efficiency and consistency of the solution proposed, making the alternative attractive for practical applications. Copyright © 2011 John Wiley & Sons, Ltd.     

Efficient multiple model particle filtering for joint traffic state estimation and incident detection

This article proposes an efficient multiple model particle filter (EMMPF) to solve the problems of traffic state estimation and incident detection, which requires significantly less computation time compared to existing multiple model nonlinear filters. To incorporate the on ramps and off ramps on the highway, junction solvers for a traffic flow model with incident dynamics are developed. The effectiveness of the proposed EMMPF is assessed using a benchmark hybrid state estimation problem, and using synthetic traffic data generated by a micro-simulation software. Then, the traffic estimation framework is implemented using field data collected on Interstate 880 in California. The results show the EMMPF is capable of estimating the traffic state and detecting incidents and requires an order of magnitude less computation time compared to existing algorithms, especially when the hybrid system has a large number of rare models.     

Comparison of results of two models of transportation demand in Hong Kong: CDAM and a version of microTRIPS

CDAM is a new computer program for solving the combined trip distribution and assignment model for multiple user classes, which enables transport planners to estimate consistent Origin-Destination (O-D) matrices and equilibrium traffic flows simultaneously if the trip production and attraction of each user class at zone centroids are available. This paper reports an application of CDAM to the central Kowloon study area in Hong Kong. The coefficients of the model related to the components of generalized costs are calibrated on 1986 travel data. A comparison of results of CDAM and a version of MicroTRIPS models of transportation demand in Hong Kong are presented. Finally, some conclusions are drawn and the advantage of the CDAM are discussed.     

The most likely trip matrix estimated from traffic counts

For a large number of applications conventional methods for estimating an origin destination matrix become too expensive to use. Two models, based on information minimisation and entropy maximisation principles, have been developed by the authors to estimate an O-D matrix from traffic counts. The models assume knowledge of the paths followed by the vehicles over the network. The models then use the traffic counts to estimate the most likely O-D matrix consistent with the link volumes available and any prior information about the trip matrix. Both models can be used to update and improve a previous O-D matrix. An algorithm to find a solution to the model is then described. The models have been tested with artificial data and performed reasonably well. Further research is being carried out to validate the models with real data.     

A distributed origin–destination demand estimation approach for real-time traffic network management

Abstract

This paper describes a distributed recursive heuristic approach for the origin–destination demand estimation problem for real-time traffic network management applications. The distributed nature of the heuristic enables its parallelization and hence reduces significantly its processing time. Furthermore, the heuristic reduces dependency on historical data that are typically used to map the observed link flows to their corresponding origin–destination pairs. In addition, the heuristic allows the incorporation of any available partial information on the demand distribution in the study area to improve the overall estimation accuracy. The heuristic is implemented following a hierarchal multi-threading mechanism. Dividing the study area into a set of subareas, the demand of every two adjacent subareas is merged in a separate thread. The merging operations continue until the demand for the entire study area is estimated. Experiments are conducted to examine the performance of the heuristic using hypothetical and real networks. The obtained results illustrate that the heuristic can achieve reasonable demand estimation accuracy while maintaining superiority in terms of processing time.     

Path flow estimator for planning applications in small communities

This paper presents an alternative planning framework to model and forecast network traffic for planning applications in small communities, where limited resources debilitate the development and applications of the conventional four-step travel demand forecasting model. The core idea is to use the Path Flow Estimator (PFE) to estimate current and forecast future traffic demand while taking into account of various field and planning data as modeling constraints. Specifically, two versions of PFE are developed: a base year PFE for estimating the current network traffic conditions using field data and planning data, if available, and a future year PFE for predicting future network traffic conditions using forecast planning data and the estimated base year origin–destination trip table as constraints. In the absence of travel survey data, the proposed method uses similar data (traffic counts and land use data) as a four-step model for model development and calibration. Since the Institute of Transportation Engineers (ITE) trip generation rates and Highway Capacity Manual (HCM) are both utilized in the modeling process, the analysis scope and results are consistent with those of common traffic impact studies and other short-range, localized transportation improvement programs. Solution algorithms are also developed to solve the two PFE models and integrated into a GIS-based software called Visual PFE. For proof of concept, two case studies in northern California are performed to demonstrate how the tool can be used in practice. The first case study is a small community of St. Helena, where the city’s planning department has neither an existing travel demand model nor the budget for developing a full four-step model. The second case study is in the city of Eureka, where there is a four-step model developed for the Humboldt County that can be used for comparison. The results show that the proposed approach is applicable for small communities with limited resources.     

Computational experience with an application of a simultaneous transportation equilibrium model to urban travel in Austin,Texas

Safwat and Magnanti (1988) have developed a combined trip generation, trip distribution, modal split, and traffic assignment model that can predict demand and performance levels on large-scale transportation networks simultaneously, i.e. a simultaneous transportation equilibrium model (STEM). The major objective of this paper is to assess the computational efficiency of the STEM approach when applied to an urban large-scale network, namely the urban transportation system of Austin, Texas. The Austin network consisted of 520 zones, 19,214 origin-destination (O-D) pairs, 7,096 links and 2,137 nodes. The Central Processing Unit (CPU) time on an IBM 4381 mainframe computer was 430 seconds for a typical iteration and about 4,734 seconds, less than 79 minutes, to arrive at a reasonably accurate solution in no more than 10 iterations. The computational time at any given iteration is comparable to that of the standard fixed demand traffic assignment procedure. These results encourage further applications of the STEM model to large urban areas.     

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.     

When is big data big enough? Implications of using GPS-based surveys for travel demand analysis

A number of studies in the last decade have argued that Global Positioning Systems (GPS) based survey offer the potential to replace traditional travel diary surveys. GPS-based surveys impose lower respondent burden, offer greater spatiotemporal precision and incur fewer monetary costs. However, GPS-based surveys do not collect certain key inputs required for the estimation of travel demand models, such as the travel mode(s) taken or the trip purpose, relying instead on data-processing procedures to infer this information. This study assesses the impact that errors in inference can have on travel demand models estimated using data from GPS-based surveys and proposes ways in which these errors can be controlled for during both data collection and model estimation. We use simulated datasets to compare performance across different sample sizes, inference accuracies, model complexities and estimation methods. Findings from the simulated datasets are corroborated with real data collected from individuals living in the San Francisco Bay Area, United States. Results indicate that the benefits of using GPS-based surveys will vary significantly, depending upon the sample size of the data, the accuracy of the inference algorithm and the desired complexity of the travel demand model specification. In many cases, gains in the volume of data that can potentially be retrieved using GPS devices are found to be offset by the loss in quality caused by inaccuracies in inference. This study makes the argument that passively collected GPS-based surveys may never entirely replace surveys that require active interaction with study participants.     

Modeling measurement errors and missing initial values in freeway dynamic origin–destination estimation systems

Most existing dynamic origin–destination (O–D) estimation approaches are grounded on the assumption that a reliable initial O–D set is available and traffic volume data from detectors are accurate. However, in most traffic systems, both types of critical information are either not available or subjected to some level of measurement errors such as traffic counts and speed measurement from sensors. To contend with those critical issues, this study presents two robust algorithms, one for estimation of an initial O–D set and the other for tackling the input measurement errors with an extended estimation algorithm. The core concept of the initial O–D estimation algorithm is to decompose the target network in a number of sub-networks based on proposed rules, and then execute the estimation of the initial O–D set iteratively with the observable information at the first time interval. To contend with the inevitable detector measurement error, this study proposes an interval-based estimation algorithm that converts each model input data as an interval with its boundaries being set based on some prior knowledge. The performance of both proposed algorithms has been tested with a simulated system, the I-95 freeway corridor between I-495 and I-695, and the results are quite promising.