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.     

A methodology to estimate travel time using dynamic traffic assignment (DTA) under incident conditions

This paper presents results from a research case study that examined the distribution of travel time of origin–destination (OD) pairs on a transportation network under incident conditions. Using a transportation simulation dynamic traffic assignment (DTA) model, incident on a transportation network is executed under normal conditions, incident conditions without traveler information availability, and incident conditions assuming that users had perfect knowledge of the incident conditions and could select paths to avoid the incident location. The results suggest that incidents have a different impact on different OD pairs. The results confirm that an effective traveler information system has the potential to ease the impacts of incident conditions network wide. Yet it is also important to note that the use of information may detriment some OD pairs while benefiting other OD pairs. The methodology demonstrated in this paper provides insights into the usefulness of embedding a fully calibrated DTA model into the analysis tools of a traffic management and information center.     

Mobile phone data in transportation research: methods for benchmarking against other data sources

The ubiquity of personal cellular phones in society has led to a surging interest in using Big Data generated by mobile phones in transport research. Studies have suggested that the vast amount of data could be used to estimate origin–destination (OD) matrices, thereby potentially replacing traditional data sources such as travel surveys. However, constructing OD matrices from mobile phone data (MPD) entails multiple challenges, and the lack of ground truth hampers the evaluation and validation of the estimated matrices. Furthermore, national laws may prohibit the distribution of MPD for research purposes, compelling researchers to work with pre-compiled OD matrices with no insight into the methods used. In this paper, we analyse a set of such pre-compiled OD matrices from the greater Oslo area and perform validation procedures against several sources to assess the quality and robustness of the OD matrices as well as their usefulness in transportation planning applications. We find that while the OD matrices correlate well with other sources at a low resolution, the reliability decreases when a finer level of detail is chosen, particularly when comparing shorter trips between neighbouring areas. Our results suggest that coarseness of data and privacy concerns restrict the usefulness of MPD in transport research in the case where OD matrices are pre-compiled by the operator.

     

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.     

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

Estimating multi-year 24/7 origin-destination demand using high-granular multi-source traffic data

Dynamic origin-destination (OD) demand is central to transportation system modeling and analysis. The dynamic OD demand estimation problem (DODE) has been studied for decades, most of which solve the DODE problem on a typical day or several typical hours. There is a lack of methods that estimate high-resolution dynamic OD demand for a sequence of many consecutive days over several years (referred to as 24/7 OD in this research). Having multi-year 24/7 OD demand would allow a better understanding of characteristics of dynamic OD demands and their evolution/trends over the past few years, a critical input for modeling transportation system evolution and reliability. This paper presents a data-driven framework that estimates day-to-day dynamic OD using high-granular traffic counts and speed data collected over many years. The proposed framework statistically clusters daily traffic data into typical traffic patterns using t-Distributed Stochastic Neighbor Embedding (t-SNE) and k-means methods. A GPU-based stochastic projected gradient descent method is proposed to efficiently solve the multi-year 24/7 DODE problem. It is demonstrated that the new method efficiently estimates the 5-min dynamic OD demand for every single day from 2014 to 2016 on I-5 and SR-99 in the Sacramento region. The resultant multi-year 24/7 dynamic OD demand reveals the daily, weekly, monthly, seasonal and yearly change in travel demand in a region, implying intriguing demand characteristics over the years.     

Origin-destination pattern estimation based on trajectory reconstruction using automatic license plate recognition data

Origin-destination (OD) pattern estimation is a vital step for traffic simulation applications and active urban traffic management. Many methods have been proposed to estimate OD patterns based on different data sources, such as GPS data and automatic license plate recognition (ALPR) data. These data can be used to identify vehicle IDs and estimate their trajectories by matching vehicles identified by different sensors across the network. OD pattern estimation using ALPR data remains a challenge in real-life applications due to the difficulty in reconstructing vehicle trajectories. This paper proposes an offline method for historical OD pattern estimation based on ALPR data. A particle filter is used to estimate the probability of a vehicle’s trajectory from all possible candidate trajectories. The initial particles are generated by searching potential paths in a pre-determined area based on the time geography theory. Then, the path flow estimation process is conducted through dividing the reconstructed complete trajectories of all detected vehicles into multiple trips. Finally, the OD patterns are estimated by adding up the path flows with the same ODs. The proposed method was implemented on a real-world traffic network in Kunshan, China and verified through a calibrated microscopic traffic simulation model. The results show that the MAPEs of the OD estimation are lower than 19%. Further investigation shows that there exists a minimum required ALPR sampling rate (60% in the test network) for accurately estimating the OD patterns. The findings of this study demonstrate the effectiveness of the proposed method in OD pattern estimation.     

Traffic Performance Models for Dynamic Traffic Assignment: An Assessment of Existing Models

Abstract

This paper provides a review of the traffic performance models for dynamic traffic assignment (DTA) and it identifies the strength and weakness of existing models. Requirements for traffic performance models are identified and various forms of existing traffic performance models for DTA are reviewed and analysed according to the requirements. Non‐linear travel time models are shown to have some deficiencies that make them unsuitable for the analysis of time‐varying transportation networks. Even though linear‐type travel time models are identified as good candidates for the analysis of dynamic transportation networks, they have limitations from the practical point of view that travel time increases only linearly with the amount of traffic on the link. This poses a dilemma and it seems to be one whose resolution is an imminent precondition for DTA modelling to progress in a way that is both theoretically coherent and plausible in practical terms.     

Methodology for Validating Dynamic Origin–Destination Matrix Estimation Models with Implications for Advanced Traveler Information Systems

This paper describes a methodology for validating online dynamic O–D matrix estimation models using loop detector data in large-scale transportation networks. The simulation procedure focuses on travel aspects related to the collective trip structure of users, including the amount and duration of trips between O–D pairs, trip departure rates, average travel time from each origin and combinations of them. The analysis identifies emerging systematic patterns between these factors and issues related to the model performance, including network scale effects. This procedure aims to enhance the usage of prior O–D information based on, e.g. travel surveys, that are typically used in the estimation process. Moreover, it seeks to integrate the validation of dynamic O–D matrix estimation models with strategies for identifying target population groups for online planning and assessment of real-time travel information services within the context of Advanced Traveler Information Systems (ATIS).     

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.     

Analyzing the impact of a planned transit-oriented development on mode share and traffic conditions

ABSTRACT

Transit-oriented development (TOD) is a popular planning strategy used to maximize accessibility to transit for various trip purposes. The quantitative effects of TOD on travel mode shift and traffic congestion have not been extensively tested in the current literature. This paper utilizes a seemingly unrelated regressions (SUR) mode share model and a mesoscopic dynamic traffic assignment (DTA) model to analyze the impact of a planned TOD in Maryland. The proposed model aims at improving the understanding of the quantitative impacts of such a TOD on mode share and traffic congestion. The main result of the mode share model indicates that the increase in transit ridership for a transit accessible shopping center is not that significant. Local traffic conditions will deteriorate due to a lack of investment in road infrastructure planned for the TOD area. The proposed method could be a valuable tool for other indicative land development or transportation policy analyses.     

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.     

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.     

A network option portfolio management framework for adaptive transportation planning

A real option portfolio management framework is proposed to make use of an adaptive network design problem developed using stochastic dynamic programming methodologies. The framework is extended from Smit’s and Trigeorgis’ option portfolio framework to incorporate network synergies. The adaptive planning framework is defined and tested on a case study with time series origin-destination demand data. Historically, OD time series data is costly to obtain, and there has not been much need for it because most transportation models use a single time-invariant estimate based on deterministic forecasting of demand. Despite the high cost and institutional barriers of obtaining abundant OD time series data, we illustrate how having higher fidelity data along with an adaptive planning framework can result in a number of improved management strategies. An insertion heuristic is adopted to run the lower bound adaptive network design problem for a coarse Iran network with 834 nodes, 1121 links, and 10 years of time series data for 71,795 OD pairs.     

Dynamic network equilibrium for daily activity-trip chains of heterogeneous travelers: application to large-scale networks

Applications of dynamic network equilibrium models have, mostly, considered the unit of traffic demand either as one-way trip, or as multiple independent trips. However, individuals’ travel patterns typically follow a sequence of trips chained together. In this study we aim at developing a general simulation-based dynamic network equilibrium algorithm for assignment of activity-trip chain demand. The trip chain of each individual trip maker is defined by the departure time at origin, sequence of activity destination locations, including the location of their intermediate destinations and their final destination, and activity duration at each of the intermediate destinations. Spatial and temporal dependency of subsequent trips on each other necessitate time and memory consuming calculations and storage of node-to-node time-dependent least generalized cost path trees, which is not practical for very large metropolitan area networks. We first propose a reformulation of the trip-based demand gap function formulation for the variational inequality formulation of the Bi-criterion Dynamic User Equilibrium (BDUE) problem. Next, we propose a solution algorithm for solving the BDUE problem with daily chain of activity-trips. Implementation of the algorithm for very large networks circumvents the need to store memory-intensive node-to-node time-dependent shortest path trees by implementing a destination-based time-dependent least generalized cost path finding algorithm, while maintaining the spatial and temporal dependency of subsequent trips. Numerical results for a real-world large scale network suggest that recognizing the dependency of multiple trips of a chain, and maintaining the departure time consistency of subsequent trips provide sharper drops in gap values, hence, the convergence could be achieved faster (compared to when trips are considered independent of each other).     

Assessing the usage and level-of-service of pedestrian facilities in train stations: A Swiss case study

A framework for assessing the usage and level-of-service of rail access facilities is presented. It consists of two parts. A dynamic demand estimator allows to obtain time-dependent pedestrian origin–destination demand within walking facilities. Using that demand, a traffic assignment model describes the propagation of pedestrians through the station, providing an estimate of prevalent traffic conditions in terms of flow, walking times, speed and density. The corresponding level-of-service of the facilities can be directly obtained. The framework is discussed at the example of Lausanne railway station. For this train station, a rich set of data sources including travel surveys, pedestrian counts and trajectories has been collected in collaboration with the Swiss Federal Railways. Results show a good performance of the framework. To underline its practical applicability, a six-step planning guideline is presented that can be used to design and optimize rail access facilities for new or existing train stations. In the long term, the framework may also be used for crowd management, involving real-time monitoring and control of pedestrian flows.     

Urban university campus transportation and parking planning through a dynamic traffic simulation and assignment approach

Abstract

Many urban university campuses are considered major trip attractors. Considering the multimodal and complex nature of university campus transportation planning and operation, this paper proposes a dynamic traffic simulation and assignment analysis approach and demonstrates how such a methodology can be successfully applied. Central to the research is the estimation of trip origin–destinations and the calibration of a parking lot choice model. Dynamic simulation is utilized to simulate multiple modes of transportation within the transportation network while further assigning these modes with respect to various mode-specific roadway accessibilities. A multiple vehicle-class simulation analysis for planning purposes becomes a critical capability to predict how faculty and staff who once parked within the campus core choose other nearby alternate parking lots. The results highlight the effectiveness of the proposed approach in providing integrated and reliable solutions for challenging questions that face urban university campus planners and local transportation jurisdictions.     

Identifying the spatial distribution of public transportation trips by node and community characteristics

ABSTRACT

Identifying the spatial distribution of travel activities can help public transportation managers optimize the allocation of resources. In this paper, transit networks are constructed based on traffic flow data rather than network topologies. The PageRank algorithm and community detection method are combined to identify the spatial distribution of public transportation trips. The structural centrality and PageRank values are compared to identify hub stations; the community detection method is applied to reveal the community structures. A case study in Guangzhou, China is presented. It is found that the bus network has a community structure, significant weekday commuting and small-world characteristics. The metro network is tightly connected, highly loaded, and has no obvious community structure. Hub stations show distinct differences in terms of volume and weekend/weekday usage. The results imply that the proposed method can be used to identify the spatial distribution of urban public transportation and provide a new study perspective.     

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.