Estimation of origin–destination matrices using link counts and partial path data

Transportation - After several decades of work by several talented researchers, estimation of the origin–destination matrix using traffic data has remained very challenging. This paper...     

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.     

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.     

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.     

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.     

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 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.     

Estimation of population origin–interchange–destination flows on multimodal transit networks

Previous research has combined automated fare-collection (AFC) and automated vehicle-location (AVL) data to infer the times and locations of passenger origins, interchanges (transfers), and destinations on multimodal transit networks. The resultant origin–interchange–destination flows (and the origin–destination (OD) matrices that comprise those flows), however, represent only a sample of total ridership, as they contain only those journeys made using the AFC payment method that have been successfully recorded or inferred. This paper presents a method for scaling passenger-journey flows (i.e., linked-trip flows) using additional information from passenger counts at each station gate and bus farebox, thereby estimating the flows of non-AFC passengers and of AFC passengers whose journeys were not successfully inferred.The proposed method is applied to a hypothetical test network and to AFC and AVL data from London’s multimodal public transit network. Because London requires AFC transactions upon both entry and exit for rail trips, a rail-only OD matrix is extracted from the estimated multimodal linked-trip flows, and is compared to a rail OD matrix generated using the iterative proportional fitting method.     

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.     

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.     

Understanding travellers’ preferences for different types of trip destination based on mobile internet usage data

New mobility data sources like mobile phone traces have been shown to reveal individuals’ movements in space and time. However, socioeconomic attributes of travellers are missing in those data. Consequently, it is not possible to partition the population and have an in-depth understanding of the socio-demographic factors influencing travel behaviour. Aiming at filling this gap, we use mobile internet usage behaviour, including one’s preferred type of website and application (app) visited through mobile internet as well as the level of usage frequency, as a distinguishing element between different population segments. We compare the travel behaviour of each segment in terms of the preference for types of trip destinations. The point of interest (POI) data are used to cluster grid cells of a city according to the main function of a grid cell, serving as a reference to determine the type of trip destination. The method is tested for the city of Shanghai, China, by using a special mobile phone dataset that includes not only the spatial-temporal traces but also the mobile internet usage behaviour of the same users. We identify statistically significant relationships between a traveller’s favourite category of mobile internet content and more frequent types of trip destinations that he/she visits. For example, compared to others, people whose favourite type of app/website is in the “tourism” category significantly preferred to visit touristy areas. Moreover, users with different levels of internet usage intensity show different preferences for types of destinations as well. We found that people who used mobile internet more intensively were more likely to visit more commercial areas, and people who used it less preferred to have activities in predominantly residential areas.     

Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts

This paper proposes a generalized model to estimate the peak hour origin–destination (OD) traffic demand variation from day-to-day hourly traffic counts throughout the whole year. Different from the conventional OD estimation methods, the proposed modeling approach aims to estimate not only the mean but also the variation (in terms of covariance matrix) of the OD demands during the same peak hour periods due to day-to-day fluctuation over the whole year. For this purpose, this paper fully considers the first- and second-order statistical properties of the day-to-day hourly traffic count data so as to capture the stochastic characteristics of the OD demands. The proposed model is formulated as a bi-level optimization problem. In the upper-level problem, a weighted least squares method is used to estimate the mean and covariance matrix of the OD demands. In the lower-level problem, a reliability-based traffic assignment model is adopted to take account of travelers’ risk-taking path choice behaviors under OD demand variation. A heuristic iterative estimation-assignment algorithm is proposed for solving the bi-level optimization problem. Numerical examples are presented to illustrate the applications of the proposed model for assessment of network performance over the whole year.     

Multidimensional visualization of transit smartcard data using space–time plots and data cubes

Given the wide application of automatic fare collection systems in transit systems across the globe, smartcard data with on- and/or off-boarding information has become a new source of data to understand passenger flow patterns. This paper uses Nanjing, China as a case study and examines the possibility of using the data cube technique in data mining to understand space–time travel patterns of Nanjing rail transit users. One month of smartcard data in October, 2013 was obtained from Nanjing rail transit system, with a total of over 22 million transaction records. We define the original data cube for the smartcard data based on four dimensions—Space, Date, Time, and User, design a hierarchy for each dimension, and use the total number of transactions as the quantitative measure. We develop modules using the programming language Python and share them as open-source on GitHub to enable peer production and advancement in the field. The visualizations of two-dimensional slices of the data cube show some interesting patterns such as different travel behaviors across user groups (e.g. students vs. elders), and irregular peak hours during National Holiday (October 1st–7th) compared to regular morning and afternoon peak hours during regular working weeks. Spatially, multidimensional visualizations show concentrations of various activity opportunities near metro rail stations and the changing popularities of rail stations through time accordingly. These findings support the feasibility and efficiency of the data cube technique as a mean of visual exploratory analysis for massive smart-card data, and can contribute to the evaluation and planning of public transit systems.     

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 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....     

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.     

Estimating origin‐destination matrices from link volume counts: a simple intercity auto travel demand model for Sri Lanka

The cost of nation wide travel surveys is high. Hence in many developing countries, planners have found it difficult to develop intercity transportation plans due to the non availability of origin‐destination trip matrices. This paper will describe a method for the intercity auto travel estimation for Sri Lanka with link traffic volume data.

The paper outlines the rationale of selecting the district capitals of Sri Lanka as its “cities,” the methodology for selecting the intercity road network, determination of link travel times from express bus schedules and the location of link volume counting positions.

Initially, the total auto travel demand model is formulated with various trip purpose sub‐models. This model is finally modified to a simple demand model with district urban population and travel times between city pairs as the exogenous variables, to overcome statistical estimation difficulties. The final demand model has statistics within the acceptable regions.

The advantages of a simple model are discussed and possible extensions are proposed.     

A complex network perspective for characterizing urban travel demand patterns: graph theoretical analysis of large-scale origin–destination demand networks

Urban travel demand, consisting of thousands or millions of origin–destination trips, can be viewed as a large-scale weighted directed graph. The paper applies a complex network-motivated approach to understand and characterize urban travel demand patterns through analysis of statistical properties of origin–destination demand networks. We compare selected network characteristics of travel demand patterns in two cities, presenting a comparative network-theoretic analysis of Chicago and Melbourne. The proposed approach develops an interdisciplinary and quantitative framework to understand mobility characteristics in urban areas. The paper explores statistical properties of the complex weighted network of urban trips of the selected cities. We show that travel demand networks exhibit similar properties despite their differences in topography and urban structure. Results provide a quantitative characterization of the network structure of origin–destination demand in cities, suggesting that the underlying dynamical processes in travel demand networks are similar and evolved by the distribution of activities and interaction between places in cities.     

Origin–destination missing data estimation for freight transportation planning: a gravity model-based regression approach

This paper develops a log-linear regression approach to estimate missing data in a sparse origin–destination (O–D) matrix assuming the sampled or observed O–D trips follow a good gravity pattern. The approach is tested with randomly selected samples from the known portions of 1997, 2002, and 2007 US Commodity Flow Survey (CFS) O–D value and tonnage matrices and validated with 2007 US O–D tonnage matrix at the state level. The missing data are also estimated for the 2007 CFS tonnage matrix with the best intercept and coefficients obtained using all known entries of the matrix. The concept of the approach can be extended beyond the gravity model to any strong mathematical pattern embedded in the known set of a sparse O–D matrix to estimate its missing cells.     

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.