Efficient algorithms to match GPS data on a map

Renaud Chicoisne, Fernando Ordóñez and Daniel Espinoza

International Journal of Operational Research, 2019, vol. 36, issue 4, 518-537

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.

Keywords: map matching; travel time estimation. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=104055 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:36:y:2019:i:4:p:518-537

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().