Comparison of pedestrian trip generation models

Using Poisson regression and negative binomial regression, this paper presents an empirical comparison of four different regression models for the estimation of pedestrian demand at the regional level and finds the most appropriate model with reference to the National Household Travel Survey (NHTS) 2001 data for the Baltimore (USA) region. The results show that Poisson regression seems to be more appropriate for pedestrian trip generation modeling in terms of χ² ratio test, Pseudo R², and Akaike's information criterion (AIC). However, R² based on deviance residuals and estimated log‐likelihood value at convergence confirmed the empirical studies that negative binomial regression is more appropriate for the over‐dispersed dependent variable than Poisson regression. Copyright © 2011 John Wiley & Sons, Ltd.     

Fine-grained OD estimation with automated zoning and sparsity regularisation

Given a road network, a fundamental object of interest is the matrix of origin destination (OD) flows. Estimation of this matrix involves at least three sub-problems: (i) determining a suitable set of traffic analysis zones, (ii) the formulation of an optimisation problem to determine the OD matrix, and (iii) a means of evaluating a candidate estimate of the OD matrix. This paper describes a means of addressing each of these concerns. We propose to automatically uncover a suitable set of traffic analysis zones based on observed link flows. We then employ regularisation to encourage the estimation of a sparse OD matrix. We finally propose to evaluate a candidate OD matrix based on its predictive power on held out link flows. Analysis of our approach on a real-world transport network reveals that it discovers automated zones that accurately capture regions of interest in the network, and a corresponding OD matrix that accurately predicts observed link flows.     

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.     

A dynamic linear model for the estimation of time‐varying origin–destination matrices from link counts

We propose a dynamic linear model (DLM) for the estimation of day‐to‐day time‐varying origin–destination (OD) matrices from link counts. Mean OD flows are assumed to vary over time as a locally constant model. We take into account variability in OD flows, route flows, and link volumes. Given a time series of observed link volumes, sequential Bayesian inference is applied in order to estimate mean OD flows. The conditions under which mean OD flows may be estimated are established, and computational studies on two benchmark transportation networks from the literature are carried out. In both cases, the DLM converged to the unobserved mean OD flows when given sufficient observations of traffic link volumes despite assuming uninformative prior OD matrices. We discuss limitations and extensions of the proposed DLM. Copyright © 2017 John Wiley & Sons, Ltd.     

Forecasting Travel Demand with Alternatively Structured Models of Trip Frequency

Abstract

This paper develops alternatively structured trip frequency/generation models, and investigates their forecast performance. The first model presented is the simple linear model with a discussion of its theoretical shortcomings. Models that address, in a progressive fashion, the underlying shortcomings of the linear model are then presented. These models are namely the truncated normal model, the Poisson model, the negative binomial model, and an ordered logit model. The modeling unit employed in the study is the individual. The models are assessed by how closely they are able to replicate trips produced by each individual in the dataset, and by each traffic zone. This assessment of performance in prediction is conducted on an estimation dataset collected in the Toronto Region in 1986, and on an independent dataset collected in the same geographic region, 10 years later, in 1996. The results show that, notwithstanding the simplicity of the simple linear model and its lack of an explicit underlying travel behavioral theory, it predicts travel in the base and forecast years with less error compared to any of the more complex models.     

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.     

Development of origin–destination matrices using mobile phone call data

In this research, we propose a methodology to develop OD matrices using mobile phone Call Detail Records (CDR) and limited traffic counts. CDR, which consist of time stamped tower locations with caller IDs, are analyzed first and trips occurring within certain time windows are used to generate tower-to-tower transient OD matrices for different time periods. These are then associated with corresponding nodes of the traffic network and converted to node-to-node transient OD matrices. The actual OD matrices are derived by scaling up these node-to-node transient OD matrices. An optimization based approach, in conjunction with a microscopic traffic simulation platform, is used to determine the scaling factors that result best matches with the observed traffic counts. The methodology is demonstrated using CDR from 2.87 million users of Dhaka, Bangladesh over a month and traffic counts from 13 key locations over 3 days of that month. The applicability of the methodology is supported by a validation study.     

Analysis of the factors that influence the relationship between business air travel and videoconferencing

This paper seeks to investigate the relationship between business air travel and videoconferencing for intra-firm communication using econometric models developed through survey data from Taiwan’s technology industry. The survey respondents include business firms that either use or do not use videoconferencing currently. Based on survey data analyses, negative binomial models are developed for the set of current adopters of videoconferencing, and a Poisson regression model is developed for the non-adopters. They suggest substitution relationships between business air travel and videoconferencing for the two groups. However, the substitution effect is perceptibly stronger when videoconferencing is used as a substitute for business air travel. The analysis highlights that the meeting context significantly influences the choice of the communication mechanism; meeting contexts that do not specifically require face-to-face interaction tend to foster increased videoconferencing usage. Further, the perceptions of the respondents in terms of the relative benefits and weaknesses of each communication option influence the likelihood of substitution.     

Covariance, identification, and finite-sample performance of the MSL and Bayes estimators of a logit model with latent attributes

In this paper we discuss the specification, covariance structure, estimation, identification, and point-estimate analysis of a logit model with endogenous latent attributes that avoids problems of inconsistency. We show first that the total error term induced by the stochastic latent attributes is heteroskedastic and nonindependent. In addition, we show that the exact identification conditions support the two-stage analysis found in much current work. Second, we set up a Monte Carlo experiment where we compare the finite-sample performance of the point estimates of two alternative methods of estimation, namely frequentist full information maximum simulated likelihood and Bayesian Metropolis Hastings-within-Gibbs sampling. The Monte Carlo study represents a virtual case of travel mode choice. Even though the two estimation methods we analyze are based on different philosophies, both the frequentist and Bayesian methods provide estimators that are asymptotically equivalent. Our results show that both estimators are feasible and offer comparable results with a large enough sample size. However, the Bayesian point estimates outperform maximum likelihood in terms of accuracy, statistical significance, and efficiency when the sample size is low.     

A model and solution algorithm for dynamic deterministic user equilibrium assignment

Abstract

In this paper a route-based dynamic deterministic user equilibrium assignment model is presented. Some features of the linear travel time model are first investigated and then a divided linear travel time model is proposed for the estimation of link travel time: it addresses the limitations of the linear travel time model. For the application of the proposed model to general transportation networks, this paper provides thorough investigations on the computational issues in dynamic traffic assignment with many-to-many OD pairs and presents an efficient solution procedure. The numerical calculations demonstrate that the proposed model and solution algorithm produce satisfactory solutions for a network of substantial size with many-to-many OD pairs. Comparisons of assignment results are also made to show the impacts of incorporation of different link travel time models on the assignment results.     

Boundedly rational user equilibria (BRUE): Mathematical formulation and solution sets

Boundedly rational user equilibria (BRUE) represent traffic flow distribution patterns where travellers can take any route whose travel cost is within an ‘indifference band’ of the shortest path cost. Those traffic flow patterns satisfying the above condition constitute a set, named the BRUE solution set. It is important to obtain all the BRUE flow patterns, because it can help predict the variation of the link flow pattern in a traffic network under the boundedly rational behavior assumption. However, the methodology of constructing the BRUE set has been lacking in the established literature. This paper fills the gap by constructing the BRUE solution set on traffic networks with fixed demands. After defining ε-BRUE, where ε is the indifference band for the perceived travel cost, we formulate the ε-BRUE problem as a nonlinear complementarity problem (NCP), so that a BRUE solution can be obtained by solving a BRUE–NCP formulation. To obtain the BRUE solution set encompassing all BRUE flow patterns, we propose a methodology of generating acceptable path set which may be utilized under the boundedly rational behavior assumption. We show that with the increase of the indifference band, the acceptable path set that contains boundedly rational equilibrium flows will be augmented, and the critical values of indifference band to augment these path sets can be identified by solving a family of mathematical programs with equilibrium constraints (MPEC) sequentially. The BRUE solution set can then be obtained by assigning all traffic demands to the acceptable path set. Various numerical examples are given to illustrate our findings.     

An integrated Bayesian approach for passenger flow assignment in metro networks

This paper proposes an integrated Bayesian statistical inference framework to characterize passenger flow assignment model in a complex metro network. In doing so, we combine network cost attribute estimation and passenger route choice modeling using Bayesian inference. We build the posterior density by taking the likelihood of observing passenger travel times provided by smart card data and our prior knowledge about the studied metro network. Given the high-dimensional nature of parameters in this framework, we apply the variable-at-a-time Metropolis sampling algorithm to estimate the mean and Bayesian confidence interval for each parameter in turn. As a numerical example, this integrated approach is applied on the metro network in Singapore. Our result shows that link travel time exhibits a considerable coefficient of variation about 0.17, suggesting that travel time reliability is of high importance to metro operation. The estimation of route choice parameters conforms with previous survey-based studies, showing that the disutility of transfer time is about twice of that of in-vehicle travel time in Singapore metro system.     

Freight Data Assembling and Modeling: Methodologies and Practice

Abstract

In comparison to personal travel, freight movements within large metropolitan areas are much less studied. Most conventional transportation models and planning analysis that disregarded freight flows have been criticized on the plausibility of their results and conclusions. To alleviate these problems, this study proposes a non-survey based approach to assemble and process freight data in a systematic way. A freight origin–destination (OD) matrix of freight flows can be developed using secondary data sources. The estimated freight flows can be loaded together with conventional passenger flows onto the regional highway network of a large metropolitan area. As a case study, this non-survey based approach was applied to build a freight OD and study the traffic flows in Los Angeles. It concluded that this approach can be used to analyze urban freight movement in a low-cost way in which planning agencies can overcome the common omission of freight flow information in their transportation plans.     

Distribution-free travel time reliability assessment with probability inequalities

An assumption that pervades the current transportation system reliability assessment literature is that probability distributions of the sources of uncertainty are known explicitly. However, this distribution may be unavailable (inaccurate) in reality as we may have no (insufficient) data to calibrate the distribution. In this paper we relax this assumption and present a new method to assess travel time reliability that is distribution-free in the sense that the methodology only requires that the first N moments (where N is a user-specified positive integer) of the travel time to be known and that the travel times reside in a set of bounded and known intervals. Because of our modeling approach, all sources of uncertainty are automatically accounted for, as long as they are statistically independent. Instead of deriving exact probabilities on travel times exceeding certain thresholds via computationally intensive methods, we develop semi-analytical probability inequalities to quickly (i.e. within a fraction of a second) obtain upper bounds on the desired probability. Numerical experiments suggest that the inclusion of higher order moments can potentially significantly improve the bounds. The case study also demonstrates that the derived bounds are nontrivial for a large range of travel time values.     

The value of travel time and reliability-evidence from a stated preference survey and actual usage

This research examined travel behavior of Managed Lane (ML) users to better understand the value travelers place on travel time savings and travel time reliability. We also highlight the importance of survey design techniques. These objectives were accomplished through a stated preference survey of Houston’s Katy Freeway travelers. Three stated choice experiment survey design techniques were tested in this study: Bayesian (D_b) efficient, random level attribute generation, and an adaptive random approach. Mixed logit models were developed from responses using each of those designs. The value of travel time savings (VTTSs) estimates do vary across the design strategies, with the VTTS estimates based on the D_b-efficient design being approximately half the estimates from the other two designs. However, among the three design strategies, the value of travel time reliability (VOR) was only significant in the D_b-efficient design.The estimated VTTS from actual Katy Freeway usage (as measured using actual tolls paid and travel time saved on the managed lanes) is $51/h. This likely also includes any value that travelers place on travel time reliability. In comparison, our combined estimate of VTTS and VOR based on the SP survey (D_b-efficient design) was $50/h, which is remarkably close to the estimate from the actual usage data. Based on our dataset, the D_b-efficient design technique proved superior to the other two techniques. Finally, this research also supports the importance of including both travel time and travel time reliability parameters when estimating the willingness to pay for, and therefore benefits derived from, ML travel.     

Reducing bias in probe-based arterial link travel time estimates

The use of probe vehicles to provide estimates of link travel times has been suggested as a means of obtaining travel times within signalized networks for use in advanced traveler information systems. Previous research has shown that bias in arrival time distributions of probe vehicles will lead to a systematic bias in the sample estimate of the mean. This paper proposes a methodology for reducing the effect of this bias. The method, based on stratified sampling techniques, requires that vehicle count data be obtained from an in-road loop detector or other traffic surveillance method. The effectiveness of the methodology is illustrated using simulation results for a single intersection approach and for an arterial corridor. The results for the single intersection approach indicate a correlation (R²) between the biased estimate and the population mean of 0.61, and an improved correlation between the proposed estimation method and the population mean of 0.81. Application of the proposed method to the arterial corridor resulted in a reduction in the mean travel time error of approximately 50%, further indicating that the proposed estimation method provides improved accuracy over the typical method of computing the arithmetic mean of the probe reports.     

Identifying optimal data aggregation interval sizes for link and corridor travel time estimation and forecasting

With the recent increase in the deployment of ITS technologies in urban areas throughout the world, traffic management centers have the ability to obtain and archive large amounts of data on the traffic system. These data can be used to estimate current conditions and predict future conditions on the roadway network. A general solution methodology for identifying the optimal aggregation interval sizes for four scenarios is proposed in this article: (1) link travel time estimation, (2) corridor/route travel time estimation, (3) link travel time forecasting, and (4) corridor/route travel time forecasting. The methodology explicitly considers traffic dynamics and frequency of observations. A formulation based on mean square error (MSE) is developed for each of the scenarios and interpreted from a traffic flow perspective. The methodology for estimating the optimal aggregation size is based on (1) the tradeoff between the estimated mean square error of prediction and the variance of the predictor, (2) the differences between estimation and forecasting, and (3) the direct consideration of the correlation between link travel time for corridor/route estimation and forecasting. The proposed methods are demonstrated using travel time data from Houston, Texas, that were collected as part of the automatic vehicle identification (AVI) system of the Houston Transtar system. It was found that the optimal aggregation size is a function of the application and traffic condition.

c-SPSA: Cluster-wise simultaneous perturbation stochastic approximation algorithm and its application to dynamic origin–destination matrix estimation

The simultaneous perturbation stochastic approximation (SPSA) algorithm has been used in the literature for the solution of the dynamic origin–destination (OD) estimation problem. Its main advantage is that it allows quite general formulations of the problem that can include a wide range of sensor measurements. While SPSA is relatively simple to implement, its performance depends on a set of parameters that need to be properly determined. As a result, especially in cases where the gradient of the objective function changes quickly, SPSA may not be as stable and even diverge. A modification of the SPSA algorithm, referred to as c-SPSA, is proposed which applies the simultaneous perturbation approximation of the gradient within a small number of carefully constructed “homogeneous” clusters one at a time, as opposed to all elements at once. The paper establishes the theoretical properties of the new algorithm with an upper bound for the bias of the gradient estimate and shows that it is lower than the corresponding SPSA bias. It also proposes a systematic approach, based on the k-means algorithm, to identify appropriate clusters. The performance of c-SPSA, with alternative implementation strategies, is evaluated in the context of estimating OD flows in an actual urban network. The results demonstrate the efficiency of the proposed c-SPSA algorithm in finding better OD estimates and achieve faster convergence and more robust performance compared to SPSA with fewer overall number of function evaluations.     

Application of the support vector machine and heuristic k-shortest path algorithm to determine the most eco-friendly path with a travel time constraint

This study aims to determine an eco-friendly path that results in minimum CO₂ emissions while satisfying a specified budget for travel time. First, an aggregated CO₂ emission model for light-duty cars is developed in a link-based level using a support vector machine. Second, a heuristic k-shortest path algorithm is proposed to solve the constrained shortest path problem. Finally, the CO₂ emission model and the proposed eco-routing model are validated in a real-world network. Specifically, the benefit of the trade-off between CO₂ emission reduction and the travel time budget is discussed by carrying out sensitivity analysis on a network-wide scale. A greater spare time budget may enable the eco-routing to search for the most eco-friendly path with higher probability. Compared to the original routes selected by travelers, the eco-friendly routes can save an average of 11% of CO₂ emissions for the trip OD pairs with a straight distance between 6 km and 9 km when the travel time budget is set to 10% above the least travel time. The CO₂ emission can also be reduced to some degree for other OD pairs by using eco-routing. Furthermore, the impact of market penetration of eco-routing users is quantified on the potential benefit for the environment and travel-time saving.