Efficient algorithms to match GPS data on a map
by Renaud Chicoisne; Fernando Ordóñez; Daniel Espinoza
International Journal of Operational Research (IJOR), Vol. 36, No. 4, 2019

Abstract: Estimating the distribution of travel times on a transportation network from vehicle GPS data requires finding the closest path on the network to a trajectory of GPS points. In this work, we develop: 1) an efficient algorithm (MOE) to find such a path and able to detect the presence of cycles; 2) a faster but less accurate heuristic (MMH) unable to detect cycles. We present computational results that compare these algorithms, for different sampling rates and GPS sensitivities, using GPS trajectories of three networks: a grid graph and street networks of Santiago and Seattle. We show that MOE (MMH) returns in seconds (hundredths of second) paths where on average 93% (91%) of the edges are within a corridor of one metre from the real path.

Online publication date: Tue, 10-Dec-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com