Salvador, M. M., Budka, M. and Quay, T., 2018. Automatic Transport Network Matching Using Deep Learning. Transportation Research Procedia, 31, 67-73.
Full text available as:
|
PDF (OPEN ACCESS ARTICLE)
1-s2.0-S2352146518301273-main.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. 667kB | |
PDF
for_brian.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Attribution Non-commercial No Derivatives. 413kB | ||
Copyright to original material in this document is with the original owner(s). Access to this content through BURO is granted on condition that you use it only for research, scholarly or other non-commercial purposes. If you wish to use it for any other purposes, you must contact BU via BURO@bournemouth.ac.uk. Any third party copyright material in this document remains the property of its respective owner(s). BU grants no licence for further use of that third party material. |
DOI: 10.1016/j.trpro.2018.09.053
Abstract
Public transport users are increasingly expecting better service and up to date information, in pursuit of a seamless journey experience. In order to meet these expectations, many transport operators are already offering free mobile apps to help customers better plan their journeys and access real-time travel information. Leveraging the spatio-temporal data that such apps can produce at scale (i.e. timestamped GPS traces), opens an opportunity to bridge the gap between passenger expectations and capabilities of the operators by providing a real-time 360-degree view of the transport network based on the ‘Apps as infrastructure’ paradigm. The first step towards fulfilling this vision is to understand which routes and services the passengers are travelling on at any given time. Mapping a GPS trace onto a particular transport network is known as ‘network matching’. In this paper, the problem is formulated as a supervised sequence classification task, where sequences are made of geographic coordinates, time, and line and direction of travel as the label. We present and compare two data-driven approaches to this problem: (i) a heuristic algorithm, which looks for nearby stops and makes an estimation based on their timetables — used as a baseline — and (ii) a deep learning approach using a recurrent neural network (RNN). Since RNNs require considerable amounts of data to train a good model, and collecting and labelling this data from real users is a challenging task (e.g. asking too often can be overwhelming; privacy concerns on providing GPS location; unreliable labels due to mistakes or misuse), one of our contributions is a synthetic journey data generator. The datasets that we generated have been made as realistic as possible by querying real timetables and adding position and temporal noise to simulate variable GPS accuracy and vehicle delays, sampled from empirical distributions estimated using thousands of real location reports. To validate our approach we have used a separate dataset made of hundreds of real user journeys provided by a UK-based bus operator. Our experimental results are very promising and our next step is to deploy the solution in a production environment. From the operator’s point of view, this will enable multiple smart applications like account-based ticketing, identification of disruptions, real-time passenger counting, and network analysis
Item Type: | Article |
---|---|
ISSN: | 2352-1465 |
Uncontrolled Keywords: | network matching; deep learning; machine learning |
Group: | Faculty of Science & Technology |
ID Code: | 31228 |
Deposited By: | Symplectic RT2 |
Deposited On: | 13 Sep 2018 10:41 |
Last Modified: | 14 Mar 2022 14:12 |
Downloads
Downloads per month over past year
Repository Staff Only - |