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.     

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     

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.     

The use of demand correlation in the modeling of air carrier departure delays as first‐order autoregressive random processes

A method for modeling air carrier departure delays at commercial‐service airports as autoregressive random processes is presented. This method employs the correlation of a priori demand data to significantly reduce prediction error in the optimal least‐squares estimator for additive white noise. The reduction factor of the prediction error is demonstrated to be on the order of 10² over that of the unbiased estimator. Copyright © 2011 John Wiley & Sons, Ltd.     

Traffic assignment in a two-dimensional continuous representation of a traffic network with flow-dependent speeds

The work deals with the assignment of traffic to a two-dimensional continuous representation of a traffic network. An important aspect of the treatment is that the reciprocal of the speed on each road in the network is at all times a linear function of the flow on that road. This speed-flow relationship is generalized to two-dimensional space using travel intensities and taking account of road densities, so that there is direct dependence of speeds upon flows at all points regardless of their location. There is also dependence of flows upon speeds at all points because Wardrop's first assignment principle is adopted. That is, for a given O-D pair, journey times on all routes actually used are identical, and less than journey times on all other possible routes. This results in the identification for each O-D pair of an “assignment zone”, an area within which all trips between that O-D pair are made, and beyond which no such trips are made. For a single O-D pair the assignment zone is identified by ?_m, the maximum angular divergence of a path from the straight line between O and D. Paths are then assumed to be bilinear so that for a single O-D pair the assignment zone is a parallelogram. Journey times, speeds, lateral displacement and other related quantities are obtained as functions of the flow Q between O and D. The work is extended to three O-D pairs located at the extremities of an equilateral triangle and four O-D pairs located at the corners of a square. At low flows these two configurations are trivial extensions of the single O-D pair problem because assignment zones do not overlap. At higher flows account is taken of this tendency to overlapping, so that although they do not overlap they do touch, becoming kite-shaped. Origins and destinations are assumed to be at the periphery of small circles of arbitrary radius. The work is inelegant to the extent that it involves a numerical integration but it is possible that this might eventually be circumvented.     

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.     

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.     

Real-time estimation of turning movement proportions from partial counts on urban networks

Modern traffic signal control systems require reliable estimates of turning flows in real time to formulate effective control actions, and accommodate disturbances in traffic demand without deteriorating the system performance. The more accurate the estimation is, the more effective the control plan is. Most of the previous research works assumed that a full set of detector counts is available and employed the least-squares methods to produce unbiased estimates of the turning movement proportions. However, in practice, such a dense detector configuration is expensive to install and maintain. Also, the least-squares estimates are not feasible when the travel time between inflows and outflows is significant, or when intervening traffic conditions change the travel time. This study proposes a nonlinear least-square (NLS) approach and a quasi maximum likelihood (QML) approach to recursively estimate turning movement proportions in a network of intersections where only a partial set of detector counts are available. Using large population approximation technique, a class of nonlinear, discrete-time traffic flow models are transformed into a linear state–space model tractable for on-line applications. The quality of estimates is demonstrated by implementing the proposed algorithms with simulation and real data. As a comparison, the NLS estimator shows less bias but with higher variance than the QML estimator. The QML estimator outperforms the NLS estimator in terms of total mean square error, due to an increase in bias being traded for a decrease in variance.     

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.     

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.     

The reliability of using the gravity model for forecasting trip distribution

The main purpose of this study is to assess the forecasting capability of the gravity model and to investigate the merit of including K-factors when using the model. Peak hour trip data was obtained for four study year periods 1962, 1971, 1976 and 1981 for the City of Winnipeg. Analysis of the calibration results indicated that the F-factors for the twenty year period were stable within a range of values. In general, however, the K-factors were found to be inconsistent from one prediction period to the next, and when used in forecasting trips they resulted in larger errors than without their use. The validity of using K-factors or the method which has been used to determine them is questionable. It was concluded that while K-factors are very meaningful in theory (as defined), they are not appropriate for use in predicting O-D matrices based on the method by which they are currently estimated (i.e. as a simple ratio). Further study is needed to investigate an alternative method of calibrating the gravity model such as the cell-by-cell regression method.     

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.     

Estimating multimodal transit ridership with a varying fare structure

This paper studies public transport demand by estimating a system of equations for multimodal transit systems where different modes may act competitively or cooperatively. Using data from Athens, Greece, we explicitly correct for higher-order serial correlation in the error terms and investigate two, largely overlooked, questions in the transit literature; first, whether a varying fare structure in a multimodal transit system affects demand and, second, what the determinants of ticket versus travelcard sales may be. Model estimation results suggest that the effect of fare type on ridership levels in a multimodal system varies by mode and by relative ticket to travelcard prices. Further, regardless of competition or cooperation between modes, fare increases will have limited effects on ridership, but the magnitude of these effects does depend on the relative ticket to travelcard prices. Finally, incorrectly assuming serial independence for the error terms during model estimation could yield upward or downward biased parameters and hence result in incorrect inferences and policy recommendations.     

Exploration of correlation between environmental factors and mobility at signalized intersections

Characterizing the relationship between environmental factors and mobility is critical for developing a sustainable traffic signal control system. In this study, the authors investigate the correlation of the environmental impacts of transport and mobility measurements at signalized intersections. A metamodeling-based method involving experimental design, simulations, and regression analysis was developed. The simulations, involving microscopic traffic modeling and emission estimation with an emerging emission estimator, provide the flexibility of generating cases with various intersection types, vehicle types, and other parameters such as driver behavior, fuel types, and meteorological factors. A multivariate multiple linear regression (MMLR) analysis was applied to determine the relationship between environmental and mobility measurements. Given the limitations of using the built-in emissions modules within current traffic simulation and signal optimization tools, the metamodeling-based approach presented in this paper makes a methodological contribution. The findings of this study set up the base for extensive application of simulation optimization to sustainable traffic operations and management. Moreover, the comparison of outputs from an advanced estimator with those from the current tool recommend improving the emissions module for more accurate analysis (e.g., benefit-cost analysis) in practical signal retiming projects.     

A theoretical foundation for the relationship between generalized origin–destination matrix and flow matrix based on ordinal graph trajectories

This paper shows the relationship between flow, generalized origin–destination (OD), and alternative route flow from a set of ordinal graph trajectories. In contrast to traffic assignment methods that employ OD matrix to produce flow matrix, we use ordinal trajectory on a network graph as input and produce both the generalized OD matrix and the flow matrix, with the alternative and substitute route flow matrices as additional outputs. By using linear algebra‐like operations on matrix sets, the relationship between network utilization (in terms of flow, generalized OD, alternative route flow, and desire line) and network structure (in terms of distance matrix and adjacency matrix) are derived. Copyright © 2012 John Wiley & Sons, Ltd.     

A new generalized travel cost based connectivity metric applied to Scandinavian airports

This article proposes a new, generalized travel cost based method to operationalize network accessibility provided by airports. The approach is novel as it integrates features of network topology with multiple quality aspects of scheduled air transport services into one metric. The method estimates generalized travel costs for the full set of feasible travel paths between an airport and all network destinations. Rooftop modeling accounts for schedule delay and isolates the most cost-efficient travel paths per O-D relation. Respecting the assumed arrival time preference of passengers and adjusting for destination importance, connectivity scores are derived. The method is then applied to explore changes in the global connectivity pattern of Scandinavian airports from 2004 to 2018. The results suggest distinct spatial differences throughout the network, but less pronounced in size than suggested by popularly applied connectivity measures. Findings also highlight the importance of the geographical location as a determinate of an airport’s connectivity.     

Inference on mode preferences,vehicle purchases,and the energy paradox using a Bayesian structural choice model

Discrete choice modeling is experiencing a reemergence of research interest in the inclusion of latent variables as explanatory variables of consumer behavior. There are several reasons that motivate the integration of latent attributes, including better-informed modeling of random consumer heterogeneity and treatment of endogeneity. However, current work still is at an early stage and multiple simplifying assumptions are usually imposed. For instance, most previous applications assume all of the following: independence of taste shocks and of latent attributes, exclusion restrictions, linearity of the effect of the latent attributes on the utility function, continuous manifest variables, and an a priori bound for the number of latent constructs. We derive and apply a structural choice model with a multinomial probit kernel and discrete effect indicators to analyze continuous latent segments of travel behavior, including inference on the energy paradox. Our estimator allows for interaction and simultaneity among the latent attributes, residual correlation, nonlinear effects on the utility function, flexible substitution patterns, and temporal correlation within responses of the same individual. Statistical properties of the Bayes estimator that we propose are exact and are not affected by the number of latent attributes.     

A spatial Difference-in-Differences estimator to evaluate the effect of change in public mass transit systems on house prices

Evaluating the impact of public mass transit systems on real-estate values is an important application of the hedonic price model (HPM). Recently, a mathematical transformation of this approach has been proposed to account for the potential omission of latent spatial variables that may overestimate the impact of accessibility to mass transit systems on values. The development of a Difference-in-Differences (DID) estimator, based on the repeat-sales approach, is a move in the right direction. However, such an estimator neglects the possibility that specification of the price equation may follow a spatial autoregressive process with respect to the dependent variable. The objective of this paper is to propose a spatial Difference-in-Differences (SDID) estimator accounting for possible spatial spillover effects. Particular emphasis is placed on the development of a suitable weights matrix accounting for spatial links between observations. Finally, an empirical application of the SDID estimator based on the development of a new commuter rail transit system for the suburban agglomeration of Montréal (Canada) is presented and compared to the usual DID estimator.     

Mixed RP/SP models incorporating interaction effects

In order to analyse the impact of a new train service in Cagliari (Italy) a databank including information from a revealed preference (RP) and a stated preference (SP) survey was set up. The RP data concern choice between car, bus and train; the SP data consider the binary choice between a new train service (quicker, more frequent, with a lower fare and more stations than the current one) and the alternative currently chosen by car and bus users. Logit models allowing for correlation among RP alternatives were estimated for this mixed RP/SP data set using the artificial tree structure method. The analysis included level-of-service variables measured with an unusually high level of precision, latent or second order variables (such as comfort), inertia and interaction variables. Different specifications of the utility function were tested, including the expenditure rate model, and the effects of these specifications on modelling results are highlighted. Our results show that for a population mainly composed of fixed income workers, the expenditure rate model is superior to the traditional wage rate model, yielding lower and more significant subjective values of time. Moreover, we found that the non-linear specifications appear to be more suitable as not only better model results were obtained, but also the real distribution of the error terms was revealed (i.e. highlighting correlation among public transport options).