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     

Simplified transport models based on traffic counts

Having accepted the need for the development of simpler and less cumbersome transport demand models, the paper concentrates on one possible line for simplification: estimation of trip matrices from link volume counts. Traffic counts are particularly attractive as a data basis for modelling because of their availability, low cost and nondisruptive character. It is first established that in normal conditions it may be possible to find more than one trip matrix which, when loaded onto a network, reproduces the observed link volumes. The paper then identifies three approaches to reduce this underspecification problem and produce a unique trip matrix consistent with the counts. The first approach consists of assuming that trip-making behaviour can be explained by a gravity model whose parameters can be calibrated from the traffic counts. Several forms of this gravity model have been put forward and they are discussed in Section 3. The second approach uses mathematical programming techniques associated to equilibrium assignment problems to estimate a trip matrix in congested areas. This method can also be supplemented by a special distribution model developed for small areas. The third approach relies on entropy and information theory considerations to estimate the most likely trip matrix consistent with the observed flows. A particular feature of this group is that they can include prior, perhaps outdated, information about the matrix.These three approaches are then compared and their likely areas for application identified. Problems for further research are discussed and finally an assessment is made of the possible role of these models vis-a-vis recent developments in transport planning.     

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.     

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.     

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.     

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.     

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.     

Calibrating aggregate travel demand models with traffic counts: Estimators and statistical performance

Traffic counts on network links constitute an information source on travel demand which is easy to collect, cheap and repeatable. Many models proposed in recent years deal with the use of traffic counts to estimate Origin/Destination (O/D) trip matrices under different assumptions on the type of "a-priori" information available on the demand (surveys, outdated estimates, models, etc.) and the type of network and assignment mapping (see Cascetta & Nguyen 1988). Less attention has been paid to the possibility of using traffic counts to estimate the parameters of demand models. In this case most of the proposed methods are relative to particular demand model structures (e.g. gravity-type) and the statistical analysis of estimator performance is not thoroughly carried out. In this paper a general statistical framework defining Maximum Likelihood, Non Linear Generalized Least Squares (NGLS) and Bayes estimators of aggregated demand model parameters combining counts-based information with other sources (sample or a priori estimates) is proposed first, thus extending and generalizing previous work by the authors (Cascetta & Russo 1992). Subsequently a solution algorithm of the projected-gradient type is proposed for the NGLS estimator given its convenient theoretical and computational properties. The algorithm is based on a combination of analytical/numerical derivates in order to make the estimator applicable to general demand models. Statistical performances of the proposed estimators are evaluated on a small test network through a Monte Carlo method by repeatedly sampling "starting estimates" of the (known) parameters of a generation/distribution/modal split/assignment system of models. Tests were carried out assuming different levels of "quality" of starting estimates and numbers of available counts. Finally NGLS estimator was applied to the calibration of the described model system on the network of a real medium-size Italian town using real counts with very satisfactory results in terms of both parameter values and counted flows reproduction.     

Simultaneous estimation of an origin–destination matrix and link choice proportions using traffic counts

A procedure for the simultaneous estimation of an origin–destination (OD) matrix and link choice proportions from OD survey data and traffic counts for congested network is proposed in this paper. Recognizing that link choice proportions in a network change with traffic conditions, and that the dispersion parameter of the route choice model should be updated for a current data set, this procedure performs statistical estimation and traffic assignment alternately until convergence in order to obtain the best estimators for both the OD matrix and link choice proportions, which are consistent with the survey data and traffic counts.Results from a numerical study using a hypothetical network have shown that a model allowing θ to be estimated simultaneously with an OD matrix from the observed data performs better than the model with a fixed predetermined θ. The application of the proposed model to the Tuen Mun Corridor network in Hong Kong is also presented in this paper. A reasonable estimate of the dispersion parameter θ for this network is obtained.     

Development of crash prediction models with individual vehicular data

Typical engineering research on traffic safety focuses on identifying either dangerous locations or contributing factors through a post-crash analysis using aggregated traffic flow data and crash records. A recent development of transportation engineering technologies provides ample opportunities to enhance freeway traffic safety using individual vehicular information. However, little research has been conducted regarding methodologies to utilize and link such technologies to traffic safety analysis. Moreover, traffic safety research has not benefited from the use of hurdle-type models that might treat excessive zeros more properly than zero-inflated models.This study developed a new surrogate measure, unsafe following condition (UFC), to estimate traffic crash likelihood by using individual vehicular information and applied it to basic sections of interstate highways in Virginia. Individual vehicular data and crash data were used in the development of statistical crash prediction models including hurdle models. The results showed that an aggregated UFC measure was effective in predicting traffic crash occurrence, and the hurdle Poisson model outperformed other count data models in a certain case.     

Traffic state estimation and uncertainty quantification based on heterogeneous data sources: A three detector approach

This study focuses on how to use multiple data sources, including loop detector counts, AVI Bluetooth travel time readings and GPS location samples, to estimate macroscopic traffic states on a homogeneous freeway segment. With a generalized least square estimation framework, this research constructs a number of linear equations that map the traffic measurements as functions of cumulative vehicle counts on both ends of a traffic segment. We extend Newell’s method to solve a stochastic three-detector problem, where the mean and variance estimates of cell-based density and flow can be analytically derived through a multinomial probit model and an innovative use of Clark’s approximation method. An information measure is further introduced to quantify the value of heterogeneous traffic measurements for improving traffic state estimation on a freeway segment.     

Estimating origin-destination matrices from roadside survey data

The purpose of this study is to develop a valid and efficient method for estimating origin-destination tables from roadside survey data. Roadside surveys, whether conducted by interviews or postcard mailback methods, typically have in common the sampling of trip origin and destination information at survey stations. These survey stations are generally located where roads cross “screenlines,” which are imaginary barriers drawn to intercept the trip types of interest.Such surveys also include counts of traffic volumes, by which the partial origin-destination (O-D) tables obtained at the different stations can be expanded and combined to obtain the complete O-D table which represents travel throughout the entire study area. The procedure used to expand the sample O-D information from the survey stations must recognize and deal appropriately with a number of problems:

• 1.(i) The “double counting” problem: Long-distance trips may pass through more than one survey station location; thus certain trips have the possibility of being sampled and expanded more than once, leading to a potentially serious overrepresentation of long-distance trips in the complete expanded trip table.
• 2.(ii) The “leaky screenline” problem: Some route choices, particularly those using very lightly traveled roads, may miss the survey stations entirely, leading to an underestimation of certain O-D patterns, or to distorted estimates if such sites are arbitrarily coupled with actual nearby station locations.
• 3.(iii) The efficient use of the data: There is a need to adjust expansion factors to compensate for double counting and leaky screenlines. How can this be accomplished such that all of the data obtained at the stations are used without loss of information?
• 4.(iv) The consequences of uncertainty and unknown travel behavior: Since the O-D data and other sampled variables are subject to random error, and since in general the probability of encountering a long-distance trip at some survey stations is affected by traveler route-choice behavior, which is not understood, the sample expansion procedure must rely on the use of erroneous input data and questionable assumptions. The preferred procedure must minimize, rather than amplify, the effects of such input errors.

Here, five alternate methods for expanding roadside survey data in an unbiased manner are proposed and evaluated. In all cases, it is assumed that traveler route choice generally follows the pattern described by Dial's multipath assignment method. All methods are applied to a simple hypothetical network in order to examine their efficiency and error amplification properties. The evaluation of the five methods reveals that their performance properties vary considerably and that no single method is best in all circumstances. A microcomputer program has been provided as a tool to facilitate comparison among methods and to select the most appropriate expansion method for a particular application.     

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.     

Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach

Previous methods for estimating a trip matrix from traffic volume counts have used the principles of maximum entropy and minimum information. These techniques implicitly give as little weight to prior information on the trip matrix as possible. The new method proposed here is based on Bayesian statistical inference and has several advantages over these earlier approaches. It allows complete flexibility in the degree of belief placed on the prior estimate of the trip matrix and also allows for different degrees of belief in diffeent parts of the prior estimate. Furthermore under certain assumptions the method reduces to a simple updating scheme in which observations on the link flows successively modify the trip matrix. At the end of the scheme confidence intervals are available for the estimates of the trip matrix elements.     

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 fuzzy approach to estimate the O–D matrix from link volumes

Abstract

Estimation of the origin–destination (O–D) trip demand matrix plays a key role in travel analysis and transportation planning and operations. Many researchers have developed different O–D matrix estimation methods using traffic counts, which allow simple data collection as opposed to the costly traditional direct estimation methods based on home and roadside interviews.

In this paper, we present a new fuzzy model to estimate the O–D matrix from traffic counts. Since link data only represent a snapshot situation, resulting in inconsistency of data and poor quality of the estimated O–Ds, the proposed method considers the link data as a fuzzy number that varies within a certain bandwidth. Shafahi and Ramezani's fuzzy assignment method is improved upon and used to assign the estimated O–D matrix, which causes the assigned volumes to be fuzzy numbers similar to what is proposed for observed link counts. The shortest path algorithm of the proposed method is similar to the Floyd–Warshall algorithm, and we call it the Fuzzy Floyd–Warshall Algorithm. A new fuzzy comparing index is proposed by improving the fuzzy comparison method developed by Dubois and Prade to estimate and compare the distance between the assigned and observed link volumes. The O–D estimation model is formulated as a convex minimization problem based on the proposed fuzzy index to minimize the fuzzy distance between the observed and assigned link volumes. A gradient-based method is used to solve the problem. To ensure the original O–D matrix does not change more than necessary during the iterations, a fuzzy rule-based approach is proposed to control the matrix changes.     

Estimating intersection O-D matrices from observed time-series of traffic counts: The zellner estimator

The problem of estimating intersection O-D matrices from input and output time-series of traffic counts is considered in this paper. Because of possible existence of significant correlation between the error terms across structural equations forming the O-D matrices, the seemingly unrelated estimator (Zellner estimator) was suggested. Estimation results showed evidence of strong correlation between error terms across-equations. Generally, the Zellner estimator produced more efficient estimates than did the ordinary least-squares estimator. Furthermore, the Zellner estimator satisfied all constraints and reproduced turning movements comparable to the actual ones.     

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.     

Public transport demand estimation by calibrating a trip distribution-mode choice (TDMC) model from passenger counts: A case study in Bandung,Indonesia

A problem always found in developing countries is the lack of information required for short, medium and long term planning purposes due to money and time constraints. This becomes even more valuable for problems which require ‘quick-response’ treatment. A flexible model approach allows monitoring a long term plan in order to check its short term performance at regular intervals using easily-available data. If found necessary, changes to the plan may be evaluated and eventually implemented. For this reason, the approach is deemed appropriate for long term planning and project evaluation even in the case of rapid changes in land-use, socio-economic and population parameters usually occurs in most of developing countries. A key element of the approach is a system to update the forecasting model (in particular its trip distribution and mode choice elements) using low-cost and/or easily-available information. Traffic counts are particularly attractive to be used in developing countries for planning purposes. The estimation of public transport demand, particularly important for planning purposes, is an expensive and time consuming undertaking. The need for a low-cost method to estimate the public transport demand is therefore obvious. The objective of this paper is the development of methods and techniques for modelling the public transport demand using traffic (passenger) count information and other simple zonal-planning data. We will report on a family of aggregate model combined with a family of mode choice logit models which can be calibrated from traffic (passenger) counts and other low-cost data. The model examined was the Gravity (GR) model combined with the Multi-Nominal-Logit (MNL) model. Non-Linear-Least-Squares (NLLS) estimation method was used to calibrate the parameter of the combined model. The combined TDMC model and the calibration method have been implemented into a micro-computer package capable of dealing with the study area consisting of up to 300 zones, 3000 links and 6000 nodes. The approach has been tested using the 1988 Public Transport Data Survey in Bandung (Indonesia). The model was found to provide a reasonably good fit and the calibrated parameter can then be used for forecasting purposes. General conclusion regarding the advantageous and the applicability of the approach to other environments are given.     

Flexible long range planning using low cost information

Contemporary transport planning requires a flexible modelling approach which can be used to monitor the implementation of a long term plan checking regularly its short term performance with easily available data; the original model is periodically updated using low cost information and this allows the evaluation of the changes to the plan which may be required. Such an approach requires models suited to regular updating and to the use of data from different sources. Models to update trip matrices from traffic counts have been available for some time; however, the estimation and/or updating of other model stages with low cost data has escaped analytical treatment. The paper discusses this idea and formulates the updating problem for an example involving a joint destination/mode choice model under various assumptions about the nature of the available data. Analytical solutions are proposed as well as some general conclusions.requests for offprints