Data fusion algorithm for macroscopic fundamental diagram estimation

A promising framework that describes traffic conditions in urban networks is the macroscopic fundamental diagram (MFD), relating average flow and average density in a relatively homogeneous urban network. It has been shown that the MFD can be used, for example, for traffic access control. However, an implementation requires an accurate estimation of the MFD with the available data sources.Most scientific literature has considered the estimation of MFDs based on either loop detector data (LDD) or floating car data (FCD). In this paper, however, we propose a methodology for estimating the MFD based on both data sources simultaneously. To that end, we have defined a fusion algorithm that separates the urban network into two sub-networks, one with loop detectors and one without. The LDD and the FCD are then fused taking into account the accuracy and network coverage of each data type. Simulations of an abstract grid network and the network of the city of Zurich show that the fusion algorithm always reduces the estimation error significantly with respect to an estimation where only one data source is used. This holds true, even when we account for the fact that the probe penetration rate of FCD needs to be estimated with loop detectors, hence it might also include some errors depending on the number of loop detectors, especially when probe vehicles are not homogeneously distributed within the network.     

A simulation evaluation of the maximum approximate composite marginal likelihood (MACML) estimator for mixed multinomial probit models

This paper evaluates the ability of the maximum approximate composite marginal likelihood (MACML) estimation approach to recover parameters from finite samples in mixed cross-sectional and panel multinomial probit models. Comparisons with the maximum simulated likelihood (MSL) estimation approach are also undertaken. The results indicate that the MACML approach recovers parameters much more accurately than the MSL approach in all model structures and covariance specifications. The MACML inference approach also estimates the parameters efficiently, with the asymptotic standard errors being, in general, only a small proportion of the true values. As importantly, the MACML inference approach takes only a very small fraction of the time needed for MSL estimation. In particular, the results suggest that, for the case of five random coefficients, the MACML approach is about 50 times faster than the MSL for the cross-sectional random coefficients case, about 15 times faster than the MSL for the panel inter-individual random coefficients case, and about 350 times or more faster than the MSL for the panel intra- and inter-individual random coefficients case. As the number of alternatives in the unordered-response model increases, one can expect even higher computational efficiency factors for the MACML over the MSL approach. Further, as should be evident in the panel intra- and inter-individual random coefficients case, the MSL is all but practically infeasible when the mixing structure leads to an explosion in the dimensionality of integration in the likelihood function, but these situations are handled with ease in the MACML approach. It is hoped that the MACML procedure will spawn empirical research into rich model specifications within the context of unordered multinomial choice modeling, including autoregressive random coefficients, dynamics in coefficients, space-time effects, and spatial/social interactions.     

Estimation of origin-destination matrices from link counts and sporadic routing data

Estimation of origin-destination (OD) matrices from link count data is a challenging problem because of the highly indeterminate relationship between the observations and the latent route flows. Conversely, estimation is straightforward if we observe the path taken by each vehicle. We consider an intermediate problem of increasing practical importance, in which link count data is supplemented by routing information for a fraction of vehicles on the network. We develop a statistical model for these combined data sources and derive some tractable normal approximations thereof. We examine likelihood-based inference for these normal models under the assumption that the probability of vehicle tracking is known. We show that the likelihood theory can be non-standard because of boundary effects, and provide conditions under which such irregular behaviour will be observed in practice. For regular cases we outline connections with existing generalised least squares methods. We then consider estimation of OD matrices under estimated and/or misspecified models for the probability of vehicle tracking. Theoretical developments are complemented by simulation experiments and an illustrative example using a section of road network from the English city of Leicester.     

Probe vehicle data sampled by time or space: Consistent travel time allocation and estimation

A characteristic of low frequency probe vehicle data is that vehicles traverse multiple network components (e.g., links) between consecutive position samplings, creating challenges for (i) the allocation of the measured travel time to the traversed components, and (ii) the consistent estimation of component travel time distribution parameters. This paper shows that the solution to these problems depends on whether sampling is based on time (e.g., one report every minute) or space (e.g., one every 500 m). For the special case of segments with uniform space-mean speeds, explicit formulae are derived under both sampling principles for the likelihood of the measurements and the allocation of travel time. It is shown that time-based sampling is biased towards measurements where a disproportionally long time is spent on the last segment. Numerical experiments show that an incorrect likelihood formulation can lead to significantly biased parameter estimates depending on the shapes of the travel time distributions. The analysis reveals that the sampling protocol needs to be considered in travel time estimation using probe vehicle data.     

A new estimation approach for the multiple discrete–continuous probit (MDCP) choice model

This paper develops a blueprint (complete with matrix notation) to apply Bhat’s (2011) Maximum Approximate Composite Marginal Likelihood (MACML) inference approach for the estimation of cross-sectional as well as panel multiple discrete–continuous probit (MDCP) models. A simulation exercise is undertaken to evaluate the ability of the proposed approach to recover parameters from a cross-sectional MDCP model. The results show that the MACML approach does very well in recovering parameters, as well as appears to accurately capture the curvature of the Hessian of the log-likelihood function. The paper also demonstrates the application of the proposed approach through a study of individuals’ recreational (i.e., long distance leisure) choice among alternative destination locations and the number of trips to each recreational destination location, using data drawn from the 2004 to 2005 Michigan statewide household travel survey.