A zone design methodology for national freight origin–destination data and transportation modeling

The zone system used for freight data collection and the geographic resolution of published data has a significant impact on analysis and planning. The majority of existing freight model zones are created in an ad hoc way. In this paper, a new model-based design method is introduced to develop freight zones for the continental USA. It focuses on two methodology issues: (1) the criteria that represent the desired properties of a zone system and (2) the constraints that govern the shape, size, and continuity of zones. The method is applied to the continental USA by optimizing an interzonal travel distance weighted by freight flows using county-level freight data. Several optimal national-level freight zone systems with different numbers of zones are developed. The results indicate that a 300-zone system provides a balance between the number of zones and optimization measures where the currently available public freight data are provided with approximately 100 zones.     

Origin–destination table disaggregation using biproportional least squares estimation

This paper describes a group of techniques for disaggregating origin–destination tables for travel forecasting that makes explicit use of observed traffic on a network. Five models within the group are presented, each of which uses nonlinear least-squares estimation to obtain row and column factors for splitting trip totals from and to larger geographical areas into smaller ones. The techniques are philosophically similar to Fratar factoring, although the solution method is quite different. The techniques are tested on a full-sized network for Northfield, MN and are found to work effectively.     

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.     

Vehicle identification sensor models for origin–destination estimation

The traditional approach to origin–destination (OD) estimation based on data surveys is highly expensive. Therefore, researchers have attempted to develop reasonable low-cost approaches to estimating the OD vector, such as OD estimation based on traffic sensor data. In this estimation approach, the location problem for the sensors is critical. One type of sensor that can be used for this purpose, on which this paper focuses, is vehicle identification sensors. The information collected by these sensors that can be employed for OD estimation is discussed in this paper. We use data gathered by vehicle identification sensors that include an ID for each vehicle and the time at which the sensor detected it. Based on these data, the subset of sensors that detected a given vehicle and the order in which they detected it are available. In this paper, four location models are proposed, all of which consider the order of the sensors. The first model always yields the minimum number of sensors to ensure the uniqueness of path flows. The second model yields the maximum number of uniquely observed paths given a budget constraint on the sensors. The third model always yields the minimum number of sensors to ensure the uniqueness of OD flows. Finally, the fourth model yields the maximum number of uniquely observed OD flows given a budget constraint on the sensors. For several numerical examples, these four models were solved using the GAMS software. These numerical examples include several medium-sized examples, including an example of a real-world large-scale transportation network in Mashhad.     

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.     

A data-driven approach for origin–destination matrix construction from cellular network signalling data: a case study of Lyon region (France)

Transportation - Spatiotemporal data, and more specifically origin–destination matrices, are critical inputs to mobility studies for transportation planning and urban management purposes....     

Validating and improving public transport origin–destination estimation algorithm using smart card fare data

Smart card data are increasingly used for transit network planning, passengers’ behaviour analysis and network demand forecasting. Public transport origin–destination (O–D) estimation is a significant product of processing smart card data. In recent years, various O–D estimation methods using the trip-chaining approach have attracted much attention from both researchers and practitioners. However, the validity of these estimation methods has not been extensively investigated. This is mainly because these datasets usually lack data about passengers’ alighting, as passengers are often required to tap their smart cards only when boarding a public transport service. Thus, this paper has two main objectives. First, the paper reports on the implementation and validation of the existing O–D estimation method using the unique smart card dataset of the South-East Queensland public transport network which includes data on both boarding stops and alighting stops. Second, the paper improves the O–D estimation algorithm and empirically examines these improvements, relying on this unique dataset. The evaluation of the last destination assumption of the trip-chaining method shows a significant negative impact on the matching results of the differences between actual boarding/alighting times and the public transport schedules. The proposed changes to the algorithm improve the average distance between the actual and estimated alighting stops, as this distance is reduced from 806 m using the original algorithm to 530 m after applying the suggested improvements.     

Towards a generic benchmarking platform for origin–destination flows estimation/updating algorithms: Design,demonstration and validation

Estimation/updating of Origin–Destination (OD) flows and other traffic state parameters is a classical, widely adopted procedure in transport engineering, both in off-line and in on-line contexts. Notwithstanding numerous approaches proposed in the literature, there is still room for considerable improvements, also leveraging the unprecedented opportunity offered by information and communication technologies and big data. A key issue relates to the unobservability of OD flows in real networks – except from closed highway systems – thus leading to inherent difficulties in measuring performance of OD flows estimation/updating methods and algorithms. Starting from these premises, the paper proposes a common evaluation and benchmarking framework, providing a synthetic test bed, which enables implementation and comparison of OD estimation/updating algorithms and methodologies under “standardized” conditions. The framework, implemented in a platform available to interested parties upon request, has been flexibly designed and allows comparing a variety of approaches under various settings and conditions. Specifically, the structure and the key features of the framework are presented, along with a detailed experimental design for the application of different dynamic OD flow estimation algorithms. By way of example, applications to both off-line/planning and on-line algorithms are presented, together with a demonstration of the extensibility of the presented framework to accommodate additional data sources.     

Data dependent input control for origin–destination demand estimation using observability analysis

In this paper, we address the observability issue of static O–D estimation based on link counts. Unlike most classic observability analyses that relied only on network topological relationships, our analysis incorporates the actual values of input parameters, thus including network operational relations as well. We first analyze possible mathematical properties of an O–D estimation problem with different data input. We then propose a modeling approach based on mixed-integer program for selecting model input that ensures observability and estimation quality. Through establishing a stronger connection between observability analysis and the corresponding estimation problem, the proposed method aims to improve estimation quality while reducing reliance on erroneous data.     

Platooning for sustainable freight transportation: an adoptable practice in the near future?

ABSTRACT

Platooning is an emerging transportation practice that has the potential to solve the problems of the burgeoning transportation industry. A platoon is a group of vehicles, with vehicle to vehicle communication, that travel closely behind one another such that the platoon can accelerate, brake and cruise together. Platoons can improve road safety, be energy efficient and reduce costs. Its complete socio-economic benefits include congestion mitigation, smoother traffic flow, better lane usage and throughput, incentives for green logistics and driver safety. The long-term effect of platooning on road transportation, if extensively deployed, would be better organised traffic flow and efficient tracking of vehicles on the road ushering a multilevel positive impact on the industry. In this study, we attempt to answer the critical question of whether platooning is an adoptable practice in the near future and discuss an agenda to take platooning closer to implementation on the ground by highlighting the opportunities for future research. We also present a conceptual framework to help researchers, academicians, policy makers and practitioners for the adoption of platooning into the transportation industry.     

A generalized sensor location model for the estimation of network origin–destination matrices

This study examined the network sensor location problem by using heterogeneous sensor information to estimate link-based network origin–destination (O–D) demands. The proposed generalized sensor location model enables different sensors’ traffic monitoring capabilities to be used efficiently and the optimal number and deployment locations of both passive- and active-type sensors to be determined simultaneously without path enumeration. The proposed sensor location model was applied to solve the network O–D demand estimation problem. One unique aspect of the proposed model and solution algorithms is that they provide satisfactory network O–D demand estimates without requiring unreasonable assumptions of known prior information on O–D demands, turning proportions, or route choice probabilities. Therefore, the proposed model and solution algorithms can be practically used in numerous offline transportation planning and online traffic operation applications.     

Is a new applied transportation research field emerging?––A review of intermodal rail–truck freight transport literature

Intermodal freight transport has developed into a significant sector of the transport industry in its own right. This development has been followed by an increase in intermodal freight transportation research. We contend that a new transportation research application field is emerging; and that, while still in a pre-paradigmatic phase, it is now time to move on to a more mature independent research field. An independent research field can be justified because intermodal transport is a complex system that has characteristics which distinguishes it from other transport systems. We have reviewed 92 publications in order to identify the characteristics of the intermodal research community and scientific knowledge base. This paper will discuss aspects of this research, assessing the status quo and seeking directions for the future. To conclude, we will propose an intermodal research agenda which can direct the intermodal research field towards a period of “normal science”.     

Data display techniques for transportation analysis and planning: an investigation of three computer‐produced graphics

Graphics are a powerful but often costly means of communication. Computer‐drawn graphics offer a new and relatively inexpensive way to assist the communication of complex technical information to both planners and non‐technical people whose full potential is now beginning to be realized. This paper discusses the utility of graphics and introduces three computer‐drawn graphic techniques which may be useful, both for analysis and presentation of results, in the transportation planning process. CENVUE(S) produces a three‐dimensional, perspective‐view map, on which virtually any type of transportation data or performance indicator can be displayed. VAP is designed to display origin‐destination travel patterns in any region. TDN transforms a physical‐distance network into a time‐distance network so that effects of different speeds in the transportation network can be readily seen. The cost‐effectiveness of each technique is briefly discussed and some recommendations for evaluating computer graphics techniques are provided to aid the user in further assessing their utility in the transportation planning process.     

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.     

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.     

Public–private partnerships: a review of economic considerations with particular reference to transportation projects

The paper sets in context some of the more recent work that has been conducted on public–private partnerships (PPPs) in the provision and operation of infrastructure. PPPs essentially involve a government or its agent signing an agreement with a private company or consortium to supply it with services with the private sector actor involved in major elements of designing, building, temporarily ‘owning’, and running the physical assets; basically they are long-term development and service contracts between government and a private partner. The paper outlines the development of economic thinking regarding the rationale behind PPPs, the extent to which unbundling is optimal and the forms that it may take, the nature of the contracts that are enacted and their renegotiation, the awarding of contracts, and matters of possible corruption. By way of focus, it also provides some indication of what empirical studies in the transportation have thrown up regarding the outcomes of PPPs.     

Stochastic frontier estimation of budgets for Kuhn–Tucker demand systems: Application to activity time-use analysis

We propose a stochastic frontier approach to estimate budgets for the multiple discrete–continuous extreme value (MDCEV) model. The approach is useful when the underlying time and/or money budgets driving a choice situation are unobserved, but the expenditures on the choice alternatives of interest are observed. Several MDCEV applications hitherto used the observed total expenditure on the choice alternatives as the budget to model expenditure allocation among choice alternatives. This does not allow for increases or decreases in the total expenditure due to changes in choice alternative-specific attributes, but only allows a reallocation of the observed total expenditure among different alternatives. The stochastic frontier approach helps address this issue by invoking the notion that consumers operate under latent budgets that can be conceived (and modeled) as the maximum possible expenditure they are willing to incur. The proposed method is applied to analyze the daily out-of-home activity participation and time-use patterns in a survey sample of non-working adults in Florida. First, a stochastic frontier regression is performed on the observed out-of-home activity time expenditure (OH-ATE) to estimate the unobserved out-of-home activity time frontier (OH-ATF). The estimated frontier is interpreted as a subjective limit or maximum possible time individuals can allocate to out-of-home activities and used as the time budget governing out-of-home time-use choices in an MDCEV model. The efficacy of this approach is compared with other approaches for estimating time budgets for the MDCEV model, including: (a) a log-linear regression on the total observed expenditure for out-of-home activities and (b) arbitrarily assumed, constant time budgets for all individuals in the sample. A comparison of predictive accuracy in time-use patterns suggests that the stochastic frontier and log-linear regression approaches perform better than arbitrary assumptions on time budgets. Between the stochastic frontier and log-linear regression approaches, the former results in slightly better predictions of activity participation rates while the latter results in slightly better predictions of activity durations. A comparison of policy simulations demonstrates that the stochastic frontier approach allows for the total out-of-home activity time expenditure to either expand or shrink due to changes in alternative-specific attributes. The log-linear regression approach allows for changes in total time expenditure due to changes in decision-maker attributes, but not due to changes in alternative-specific attributes.     

Quasi-dynamic estimation of o–d flows from traffic counts: Formulation,statistical validation and performance analysis on real data

The paper proposes a “quasi-dynamic” framework for estimation of origin–destination (o–d) flow from traffic counts, under the assumption that o–d shares are constant across a reference period, whilst total flows leaving each origin vary for each sub-period within the reference period. The advantage of this approach over conventional within-day dynamic estimators is that of reducing drastically the number of unknowns given the same set of observed time-varying traffic counts. Obviously, the gain in accuracy depends on how realistic is the underlying assumption that total demand levels vary more rapidly over time than o–d shares. Firstly, the paper proposes a theoretical specification of the quasi-dynamic estimator. Subsequently, it proposes empirical and statistical tests to check the quasi-dynamic assumption and then compares the performances of the quasi-dynamic estimator of o–d flows with both classical off-line simultaneous dynamic estimators and on-line recursive Kalman filter-based estimators. Experiments are carried out on the real test site of A4–A23 motorways in North-Eastern Italy. Results confirm the acceptability of the assumption of quasi-dynamic o–d flows, even under the hypothesis of constant distribution shares for the whole day and show that the quasi-dynamic estimator outperforms significantly the simultaneous estimator. Data also suggest that using the quasi-dynamic estimates instead of the simultaneous estimates as historical o–d flows improves significantly the performances of the Kalman filter, which strongly depends of the quality of the seed o–d flows. In addition, it is shown that the aggregation of quasi-dynamic o–d estimates across subsequent time slices represents also the most effective way to obtain o–d estimates for larger time horizons (e.g. hourly estimates). Finally, a validation based on an hold-out sample of link flows (i.e. counts not used as inputs in the o–d estimation/updating process) revealed the quasi-dynamic estimator to be overall more robust and effective with respect to the other tested estimators.     

Exploring the impact of walk–bike infrastructure,safety perception,and built-environment on active transportation mode choice: a random parameter model using New York City commuter data

This study estimates a random parameter (mixed) logit model for active transportation (walk and bicycle) choices for work trips in the New York City (using 2010–2011 Regional Household Travel Survey Data). We explored the effects of traffic safety, walk–bike network facilities, and land use attributes on walk and bicycle mode choice decision in the New York City for home-to-work commute. Applying the flexible econometric structure of random parameter models, we capture the heterogeneity in the decision making process and simulate scenarios considering improvement in walk–bike infrastructure such as sidewalk width and length of bike lane. Our results indicate that increasing sidewalk width, total length of bike lane, and proportion of protected bike lane will increase the likelihood of more people taking active transportation mode This suggests that the local authorities and planning agencies to invest more on building and maintaining the infrastructure for pedestrians. Further, improvement in traffic safety by reducing traffic crashes involving pedestrians and bicyclists, will increase the likelihood of taking active transportation modes. Our results also show positive correlation between number of non-motorized trips by the other family members and the likelihood to choose active transportation mode. The model would be an essential tool to estimate the impact of improving traffic safety and walk–bike infrastructure which will assist in investment decision making.