IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v36y2019i4p518-537.html
   My bibliography  Save this article

Efficient algorithms to match GPS data on a map

Author

Listed:
  • Renaud Chicoisne
  • Fernando Ordóñez
  • Daniel Espinoza

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.

Suggested Citation

  • Renaud Chicoisne & Fernando Ordóñez & Daniel Espinoza, 2019. "Efficient algorithms to match GPS data on a map," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 36(4), pages 518-537.
    • Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:518-537
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=104055
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Keywords

    map matching; travel time estimation.;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:518-537. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.