Lane-based real-time queue length estimation using license plate recognition data

License plate recognition (LPR) data are emerging data sources that provide rich information in estimating the traffic conditions of urban arterials. While large-scale LPR system is not common in US, last few years have seen rapid developments and implementations in many other parts of world (e.g. China, Thailand and Middle East). Due to privacy issues, LPR data are seldom available to research communities. However, when available, this data source can be valuable in estimating real-time operational metrics in transportation systems. This paper proposes a lane-based real-time queue length estimation model using the license plate recognition (LPR) data. In the model, an interpolation method based on Gaussian process is developed to reconstruct the equivalent cumulative arrival–departure curve for each lane. The missing information for unrecognized or unmatched vehicles is obtained from the reconstructed arrival curve. With the complete arrival and departure information, a car-following based simulation scheme is applied to estimate the real-time queue length for each lane. The proposed model is validated using ground truth information of the maximum queue lengths from the city of Langfang in China. The results show that the model can capture the variations in queue lengths in the ground truth data, and the maximum queue length for each signal cycle can be estimated with a reasonable accuracy. The estimated queue length information using the proposed model can serve as a useful performance metric for various real-time traffic control applications.     

Aircraft initial mass estimation using Bayesian inference method

Aircraft mass is a crucial piece of information for studies on aircraft performance, trajectory prediction, and many other topics of aircraft traffic management. However, It is a common challenge for researchers, as well as air traffic control, to access this proprietary information. Previously, several studies have proposed methods to estimate aircraft weight based on specific parts of the flight. Due to inaccurate input data or biased assumptions, this often leads to less confident or inaccurate estimations. In this paper, combined with a fuel-flow model, different aircraft initial masses are computed independently using the total energy model and reference model at first. It then adopts a Bayesian approach that uses a prior probability of aircraft mass based on empirical knowledge and computed aircraft initial masses to produce the maximum a posteriori estimation. Variation in results caused by dependent factors such as prior, thrust and wind are also studied. The method is validated using 50 test flights of a Cessna Citation II aircraft, for which measurements of the true mass were available. The validation results show a mean absolute error of 4.3% of the actual aircraft mass.     

Speed profile estimation using license plate recognition data

Vehicle speed profile is a fundamental data support for calculating vehicular emission using the micro-emission model. However, achieving accuracy and breadth for the speed profile estimation is difficult. This study proposes a new vehicle speed profile estimation model using license plate recognition (LPR) data. This model allows speed profile estimation of every individual vehicle between two consecutive intersections. A systematic LPR data-mending method is developed to infer the information of unmatched vehicles. Using the complete arrival and departure information as boundary conditions, a customized car-following model combined with dummy-overtaking hypothesis and boundary constraints is then applied to estimate the speed profile of vehicles. The proposed model is validated using ground truth speed information from a field experiment conducted in Langfang City in China. Results show that the model can fully capture the pattern of ground truth speed profile. A complementary model validation using the Next Generation Simulation dataset and a model application for calculating emissions are also conducted. The numerical results indicate the effectiveness of the proposed model in estimating vehicle speed profile and emissions.     

Origin-destination trip table estimation based on subarea network OD flow and vehicle trajectory data

Identifying accurate origin-destination (O-D) travel demand is one of the most important and challenging tasks in the transportation planning field. Recently, a wide range of traffic data has been made available. This paper proposes an O-D estimation model using multiple field data. This study takes advantage of emerging technologies – car navigation systems, highway toll collecting systems and link traffic counts – to determine O-D demand. The proposed method is unique since these multiple data are combined to improve the accuracy of O-D estimation for an entire network. We tested our model on a sample network and found great potential for using multiple data as a means of O-D estimation. The errors of a single input data source do not critically affect the model’s overall accuracy, meaning that combining multiple data provides resilience to these errors. It is suggested that the model is a feasible means for more reliable O-D estimation.     

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.     

Passenger travel characteristics and bus operational states: a study based on IC card and GPS data in Yinchuan,China

ABSTRACT

In recent years, public transport has been developing rapidly and producing large amounts of traffic data. Emerging big data-mining techniques enable the application of these data in a variety of ways. This study uses bus intelligent card (IC card) data and global positioning system (GPS) data to estimate passenger boarding and alighting stations. First, an estimation model for boarding stations is introduced to determine passenger boarding stations. Then, the authors propose an innovative uplink and downlink information identification model (UDI) to generate information for estimating alighting stations. Subsequently, the estimation model for the alighting stations is introduced. In addition, a transfer station identification model is also developed to determine transfer stations. These models are applied to Yinchuan, China to analyze passenger flow characteristics and bus operations. The authors obtain passenger flows based on stations (stops), bus lines, and traffic analysis zones (TAZ) during weekdays and weekends. Moreover, average bus operational speeds are obtained. These findings can be used in bus network planning and optimization as well as bus operation scheduling.     

Travel time estimation for urban road networks using low frequency probe vehicle data

The paper presents a statistical model for urban road network travel time estimation using vehicle trajectories obtained from low frequency GPS probes as observations, where the vehicles typically cover multiple network links between reports. The network model separates trip travel times into link travel times and intersection delays and allows correlation between travel times on different network links based on a spatial moving average (SMA) structure. The observation model presents a way to estimate the parameters of the network model, including the correlation structure, through low frequency sampling of vehicle traces. Link-specific effects are combined with link attributes (speed limit, functional class, etc.) and trip conditions (day of week, season, weather, etc.) as explanatory variables. The approach captures the underlying factors behind spatial and temporal variations in speeds, which is useful for traffic management, planning and forecasting. The model is estimated using maximum likelihood. The model is applied in a case study for the network of Stockholm, Sweden. Link attributes and trip conditions (including recent snowfall) have significant effects on travel times and there is significant positive correlation between segments. The case study highlights the potential of using sparse probe vehicle data for monitoring the performance of the urban transport system.     

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.     

An adaptive hawkes process formulation for estimating time-of-day zonal trip arrivals with location-based social networking check-in data

Location-Based Social Networking (LBSN) services, such as Foursquare, Facebook check-ins, and Geo-tagged Twitter tweets, have emerged as new secondary data sources for studying individual travel mobility patterns at a fine-grained level. However, the differences between human social behavioral and travel patterns can cause significant sampling bias for travel demand estimation. This paper presents a dynamic model to estimate time-of-day zonal trip arrival patterns. In the proposed model, the state propagation is formulated by the Hawkes process; the observation model implements LBSN sampling. The proposed model is applied to Foursquare check-in data collected from Austin, Texas in 2010 and calibrated with Origin-Destination (OD) data and time of day factor from Capital Area Metropolitan Planning Organization (CAMPO). The proposed model is compared with a simple aggregation model of trip purposes and time of day based on a prior daily OD estimation model using the LBSN data. The results illustrate the promising benefits of applying stochastic point process models and state-space modeling in time-of-day zonal arrival pattern estimation with the LBSN data. The proposed model can significantly reduce the number of parameters to calibrate in order to reduce the sampling bias of LBSN data for trip arrival estimation.     

Hierarchical travel demand estimation using multiple data sources: A forward and backward propagation algorithmic framework on a layered computational graph

Aiming to develop a theoretically consistent framework to estimate travel demand using multiple data sources, this paper first proposes a multi-layered Hierarchical Flow Network (HFN) representation to structurally model different levels of travel demand variables including trip generation, origin/destination matrices, path/link flows, and individual behavior parameters. Different data channels from household travel surveys, smartphone type devices, global position systems, and sensors can be mapped to different layers of the proposed network structure. We introduce Big data-driven Transportation Computational Graph (BTCG), alternatively Beijing Transportation Computational Graph, as the underlying mathematical modeling tool to perform automatic differentiation on layers of composition functions. A feedforward passing on the HFN sequentially implements 3 steps of the traditional 4-step process: trip generation, spatial distribution estimation, and path flow-based traffic assignment, respectively. BTCG can aggregate different layers of partial first-order gradients and use the back-propagation of “loss errors” to update estimated demand variables. A comparative analysis indicates that the proposed methods can effectively integrate different data sources and offer a consistent representation of demand. The proposed methodology is also evaluated under a demonstration network in a Beijing subnetwork.     

Deriving macroscopic fundamental diagrams from probe data: Issues and proposed solutions

Well-defined relationships between flow and density averaged spatially across urban traffic networks, more commonly known as Macroscopic Fundamental Diagrams (MFDs), have been recently verified to exist in reality. Researchers have proposed using MFDs to monitor the status of urban traffic networks and to inform the design of network-wide traffic control strategies. However, it is also well known that empirical MFDs are not easy to estimate in practice due to difficulties in obtaining the requisite data needed to construct them. Recent works have devised ways to estimate a network’s MFD using limited trajectory data that can be obtained from GPS-equipped mobile probe vehicles. These methods assume that the market penetration level of mobile probe vehicles is uniform across the entire set of OD pairs in the network; however, in reality the probe vehicle market penetration rate varies regionally within a network. When this variation is combined with the imbalance of probe trip lengths and travel times, the compound effects will further complicate the estimation of the MFD.To overcome this deficit, we propose a method to estimate a network’s MFD using mobile probe data when the market penetration rates are not necessarily the same across an entire network. This method relies on the determination of appropriate average probe penetration rates, which are weighted harmonic means using individual probe vehicle travel times and distances as the weights. The accuracy of this method is tested using synthetic data generated in the INTEGRATION micro-simulation environment by comparing the estimated MFDs to the ground truth MFD obtained using a 100% market penetration of probe vehicles. The results show that the weighted harmonic mean probe penetration rates outperform simple (arithmetic) average probe penetration rates, as expected. This especially holds true as the imbalance of demand and penetration level increases. Furthermore, as the probe penetration rates are generally not known, an algorithm to estimate the probe penetration rates of regional OD pairs is proposed. This algorithm links count data from sporadic fixed detectors in the network to information from probe vehicles that pass the detectors. The simulation results indicate that the proposed algorithm is very effective. Since the data needed to apply this algorithm are readily available and easy to collect, the proposed algorithm is practically feasible and offers a better approach for the estimation of the MFD using mobile probe data, which are becoming increasingly available in urban environments.     

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

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

A generic data assimilation framework for vehicle trajectory reconstruction on signalized urban arterials using particle filters

With trajectory data, a complete microscopic and macroscopic picture of traffic flow operations can be obtained. However, trajectory data are difficult to observe over large spatiotemporal regions—particularly in urban contexts—due to practical, technical and financial constraints. The next best thing is to estimate plausible trajectories from whatever data are available. This paper presents a generic data assimilation framework to reconstruct such plausible trajectories on signalized urban arterials using microscopic traffic flow models and data from loops (individual vehicle passages and thus vehicle counts); traffic control data; and (sparse) travel time measurements from whatever source available. The key problem we address is that loops suffer from miss- and over-counts, which result in unbounded errors in vehicle accumulations, rendering trajectory reconstruction highly problematic. Our framework solves this problem in two ways. First, we correct the systematic error in vehicle accumulation by fusing the counts with sparsely available travel times. Second, the proposed framework uses particle filtering and an innovative hierarchical resampling scheme, which effectively integrates over the remaining error distribution, resulting in plausible trajectories. The proposed data assimilation framework is tested and validated using simulated data. Experiments and an extensive sensitivity analysis show that the proposed method is robust to errors both in the model and in the measurements, and provides good estimations for vehicle accumulation and vehicle trajectories with moderate sensor quality. The framework does not impose restrictions on the type of microscopic models used and can be naturally extended to include and estimate additional trajectory attributes such as destination and path, given data are available for assimilation.     

On the cost of misperceived travel time variability

Because individuals may misperceive travel time distributions, using the implied reduced form of the scheduling model might fall short of capturing all costs of travel time variability. We reformulate a general scheduling model employing rank-dependent utility theory and derive two special cases as econometric specifications to study these uncaptured costs. It is found that reduced-form expected cost functions still have a mean–variance form when misperception is considered, but the value of travel time variability is higher. We estimate these two models with stated-preference data and calculate the empirical cost of misperception. We find that: (i) travelers are mostly pessimistic and thus tend to choose departure times too early to achieve a minimum cost, (ii) scheduling preferences elicited using a stated-choice method can be relatively biased if probability weighting is not considered, and (iii) the extra cost of misperceiving the travel time distribution might be nontrivial when time is valued differently over the time of day and is substantial for some people.     

Generalized extreme value (GEV)-based error structures for multiple discrete-continuous choice models

This paper formally derives the class of multiple discrete-continuous generalized extreme value (MDCGEV) models, a general class of multiple discrete-continuous choice models based on generalized extreme value (GEV) error specifications. Specifically, the paper proves the existence of, and derives the general form of, closed-form consumption probability expressions for multiple discrete-continuous choice models with GEV-based error structures. In addition to deriving the general form, the paper derives a compact and readily usable form of consumption probability expressions that can be used to estimate multiple discrete-continuous choice models with general cross-nested error structures.The cross-nested version of the MDCGEV model is applied to analyze household annual expenditure patterns in various transportation-related expenses using data from a Consumer Expenditure Survey in the United States. Model estimation results and predictive log-likelihood based validation tests indicate the superiority of the cross-nested model over the mutually exclusively nested and non-nested model specifications. Further, the cross-nested model was amenable to the accommodation of socio-demographic heterogeneity in inter-alternative covariance across decision-makers through a parameterization of the allocation parameters.     

Activity imputation for trip-chains elicited from smart-card data using a continuous hidden Markov model

Although smart-card data were expected to substitute for conventional travel surveys, the reality is that only a few automatic fare collection (AFC) systems can recognize an individual passenger's origin, transfer, and destination stops (or stations). The Seoul metropolitan area is equipped with a system wherein a passenger's entire trajectory can be tracked. Despite this great advantage, the use of smart-card data has a critical limitation wherein the purpose behind a trip is unknown. The present study proposed a rigorous methodology to impute the sequence of activities for each trip chain using a continuous hidden Markov model (CHMM), which belongs to the category of unsupervised machine-learning technologies. Coupled with the spatial and temporal information on trip chains from smart-card data, land-use characteristics were used to train a CHMM. Unlike supervised models that have been mobilized to impute the trip purpose to GPS data, A CHMM does not require an extra survey, such as the prompted-recall survey, in order to obtain labeled data for training. The estimated result of the proposed model yielded plausible activity patterns that are intuitively accountable and consistent with observed activity patterns.     

An improved cellular automata model for heterogeneous work zone traffic

This paper aims to develop an improved cellular automata (ICA) model for simulating heterogeneous traffic in work zone. The proposed ICA model includes the forwarding rules to update longitudinal speeds and positions of work zone vehicles. The randomization probability parameter used by the ICA is formulated as a function of the activity length, the transition length and the volumes of different types of vehicles traveling across work zone. Compared to the existing cellular automata models, the ICA model possesses a novel and realistic lateral speed and position updating rule so that the simulation of vehicle’s lateral movement in work zone is close to the reality. The ICA model is calibrated and validated microscopically and macroscopically by using the real work zone data. Comparisons of field data and ICA for trajectories, speed and speed–flow relationship in work zone show very close agreement. Finally, the proposed ICA model is applied to estimate traffic delay occurred in work zone.     

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.     

Calibrating aggregate travel demand models with traffic counts: Estimators and statistical performance

Traffic counts on network links constitute an information source on travel demand which is easy to collect, cheap and repeatable. Many models proposed in recent years deal with the use of traffic counts to estimate Origin/Destination (O/D) trip matrices under different assumptions on the type of "a-priori" information available on the demand (surveys, outdated estimates, models, etc.) and the type of network and assignment mapping (see Cascetta & Nguyen 1988). Less attention has been paid to the possibility of using traffic counts to estimate the parameters of demand models. In this case most of the proposed methods are relative to particular demand model structures (e.g. gravity-type) and the statistical analysis of estimator performance is not thoroughly carried out. In this paper a general statistical framework defining Maximum Likelihood, Non Linear Generalized Least Squares (NGLS) and Bayes estimators of aggregated demand model parameters combining counts-based information with other sources (sample or a priori estimates) is proposed first, thus extending and generalizing previous work by the authors (Cascetta & Russo 1992). Subsequently a solution algorithm of the projected-gradient type is proposed for the NGLS estimator given its convenient theoretical and computational properties. The algorithm is based on a combination of analytical/numerical derivates in order to make the estimator applicable to general demand models. Statistical performances of the proposed estimators are evaluated on a small test network through a Monte Carlo method by repeatedly sampling "starting estimates" of the (known) parameters of a generation/distribution/modal split/assignment system of models. Tests were carried out assuming different levels of "quality" of starting estimates and numbers of available counts. Finally NGLS estimator was applied to the calibration of the described model system on the network of a real medium-size Italian town using real counts with very satisfactory results in terms of both parameter values and counted flows reproduction.     

Estimating light-rail transit peak-hour boarding based on accessibility at station and route levels in Wuhan,China

Promoting public transit is a well-recognized policy for sustainable urban transport development. Transit demand analysis proves to be a challenging task in fast growing cities, partially due to the lack of reliable data and applicable techniques for rapidly changing urban contexts. This paper presents an effort to meet the challenge by developing a framework to estimate peak-hour boarding at light-rail transit (LRT) stations. The core part of the framework is an accessibility-weighted ridership model that multiplies potential demand by integral LRT accessibility. Potential demand around LRT stations is generated by using a distance-decay function. The integral LRT accessibility is a route-level factor that indicates the degree of attractiveness to LRT travel for stations in an LRT corridor. A case study in Wuhan, China, shows that the proposed method produces results useful for improving transit demand analysis.