اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMicromobility Trip Origin and Destination Inference Using General Bikeshare Feed Specification (GBFS) Data
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Emerging micromobility services (e.g., e-scooters) have a great potential to enhance urban mobility but more knowledge on their usage patterns is needed. The General Bikeshare Feed Specification (GBFS) data are a possible source for examining micromobility trip patterns, but efforts are needed to infer trips from the GBFS data. Existing trip inference methods are usually based upon the assumption that the vehicle ID of a micromobility option (e-scooter or e-bike) does not change, and so they cannot deal with data with vehicle IDs that change over time. In this study, we propose a comprehensive package of algorithms to infer trip origins and destinations from GBFS data with different types of vehicle ID. We implement the algorithms in Washington DC by analyzing one-week (last week of February 2020) of GBFS data published by six vendors, and we evaluate the inference accuracy of the proposed algorithms by R-squared, mean absolute error, and sum absolute error. We find that the R-squared measure is larger than 0.9 and the MAE measure is smaller than 2 when the algorithms are evaluated with a 400m*400m grid, and the absolute errors are relatively larger in the downtown area. The accuracy of the trip-inference algorithms is sufficiently high for most practical applications.
قيم البحث
اقرأ أيضاً
Transit ridership flow and origin-destination (O-D) information is essential for enhancing transit network design, optimizing transit route and improving service. The effectiveness and preciseness of the traditional survey-based and smart card data-d
riven method for O-D information inference have multiple disadvantages due to the insufficient sample, the high time and energy cost, and the lack of inferring results validation. By considering the ubiquity of smart mobile devices in the world, several methods were developed for estimating the transit ridership flow from Wi-Fi and Bluetooth sensing data by filtering out the non-passenger MAC addresses based on the predefined thresholds. However, the accuracy of the filtering methods is still questionable for the indeterminate threshold values and the lack of quantitative results validation. By combining the consideration of the assumed overlapped feature space of passenger and non-passenger with the above concerns, a three steps data-driven method for estimating transit ridership flow and O-D information from Wi-Fi and Bluetooth sensing data is proposed in this paper. The observed ridership flow is used as ground truth for calculating the performance measurements. According to the results, the proposed approach outperformed all selected baseline models and existing filtering methods. The findings of this study can help to provide real-time and precise transit ridership flow and O-D information for supporting transit vehicle management and the quality of service enhancement.
We propose a Bayesian inference approach for static Origin-Destination (OD)-estimation in large-scale networked transit systems. The approach finds posterior distribution estimates of the OD-coefficients, which describe the relative proportions of pa
ssengers travelling between origin and destination locations, via a Hamiltonian Monte Carlo sampling procedure. We suggest two different inference model formulations: the instantaneous-balance and average-delay model. We discuss both models sensitivity to various count observation properties, and establish that the average-delay model is generally more robust in determining the coefficient posteriors. The instantaneous-balance model, however, requires lower resolution count observations and produces comparably accurate estimates as the average-delay model, pending that count observations are only moderately interfered by trend fluctuations or the truncation of the observation window, and sufficient number of dispersed data records are available. We demonstrate that the Bayesian posterior distribution estimates provide quantifiable measures of the estimation uncertainty and prediction quality of the model, whereas the point estimates obtained from an alternative constrained quadratic programming optimisation approach only provide the residual errors between the predictions and observations. Moreover, the Bayesian approach proves more robust in scaling to high-dimensional underdetermined problems. The Bayesian instantaneous-balance OD-coefficient posteriors are determined for the New York City (NYC) subway network, based on several years of entry and exit count observations recorded at station turnstiles across the network. The average-delay model proves intractable on the real-world test scenario, given its computational time complexity and the incompleteness as well as coarseness of the turnstile records.
With the increasing adoption of Automatic Vehicle Location (AVL) and Automatic Passenger Count (APC) technologies by transit agencies, a massive amount of time-stamped and location-based passenger boarding and alighting count data can be collected on
a continuous basis. The availability of such large-scale transit data offers new opportunities to produce estimates for Origin-Destination (O-D) flows, helping inform transportation planning and transit management. However, the state-of-the-art methodologies for AVL/APC data analysis mostly tackle the O-D flow estimation problem within routes and barely infer the transfer activities across the entire transit network. This paper proposes three optimization models to identify transfers and approximate network-level O-D flows by minimizing the deviations between estimated and observed proportions or counts of transferring passengers: A Quadratic Integer Program (QIP), a feasible rounding procedure for the Quadratic Convex Programming (QCP) relaxation of the QIP, and an Integer Program (IP). The inputs of the models are readily available by applying the various route-level flow estimation algorithms to the automatically collected AVL/APC data and the output of the models is a network O-D estimation at varying geographical resolutions. The optimization models were evaluated on a case study for Ann Arbor-Ypsilanti area in Michigan. The IP model outperforms the QCP approach in terms of accuracy and remains tractable from an efficiency standpoint, contrary to the QIP. Its estimated O-D matrix achieves an R-Squared metric of 95.57% at the Traffic Analysis Zone level and 92.39% at the stop level, compared to the ground-truth estimates inferred from the state-of-practice trip-chaining methods.
Social media provide access to behavioural data at an unprecedented scale and granularity. However, using these data to understand phenomena in a broader population is difficult due to their non-representativeness and the bias of statistical inferenc
e tools towards dominant languages and groups. While demographic attribute inference could be used to mitigate such bias, current techniques are almost entirely monolingual and fail to work in a global environment. We address these challenges by combining multilingual demographic inference with post-stratification to create a more representative population sample. To learn demographic attributes, we create a new multimodal deep neural architecture for joint classification of age, gender, and organization-status of social media users that operates in 32 languages. This method substantially outperforms current state of the art while also reducing algorithmic bias. To correct for sampling biases, we propose fully interpretable multilevel regression methods that estimate inclusion probabilities from inferred joint population counts and ground-truth population counts. In a large experiment over multilingual heterogeneous European regions, we show that our demographic inference and bias correction together allow for more accurate estimates of populations and make a significant step towards representative social sensing in downstream applications with multilingual social media.
The movement of humans and goods in cities can be represented by constrained flow, which is defined as the movement of objects between origin and destination in road networks. Flow aggregation, namely origins and destinations aggregated simultaneousl
y, is one of the most common patterns, say the aggregated origin-to-destination flows between two transport hubs may indicate the great traffic demand between two sites. Developing a clustering method for constrained flows is crucial for determining urban flow aggregation. Among existing methods about identifying flow aggregation, L-function of flows is the major one. Nevertheless, this method depends on the aggregation scale, the key parameter detected by Euclidean L-function, it does not adapt to road network. The extracted aggregation may be overestimated and dispersed. Therefore, we propose a clustering method based on L-function of Manhattan space, which consists of three major steps. The first is to detect aggregation scales by Manhattan L-function. The second is to determine core flows possessing highest local L-function values at different scales. The final step is to take the intersection of core flows neighbourhoods, the extent of which depends on corresponding scale. By setting the number of core flows, we could concentrate the aggregation and thus highlight Aggregation Artery Architecture (AAA), which depicts road sections that contain the projection of key flow cluster on the road networks. Experiment using taxi flows showed that AAA could clarify resident movement type of identified aggregated flows. Our method also helps selecting locations for distribution sites, thereby supporting accurate analysis of urban interactions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
