IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0192274.html
   My bibliography  Save this article

Accurate and fast path computation on large urban road networks: A general approach

Author

Listed:
  • Qing Song
  • Meng Li
  • Xiaolei Li

Abstract

Accurate and fast path computation is essential for applications such as onboard navigation systems and traffic network routing. While a number of heuristic algorithms have been developed in the past few years for faster path queries, the accuracy of them are always far below satisfying. In this paper, we first develop an agglomerative graph partitioning method for generating high balanced traverse distance partitions, and we constitute a three-level graph model based on the graph partition scheme for structuring the urban road network. Then, we propose a new hierarchical path computation algorithm, which benefits from the hierarchical graph model and utilizes a region pruning strategy to significantly reduce the search space without compromising the accuracy. Finally, we present a detailed experimental evaluation on the real urban road network of New York City, and the experimental results demonstrate the effectiveness of the proposed approach to generate optimal fast paths and to facilitate real-time routing applications.

Suggested Citation

  • Qing Song & Meng Li & Xiaolei Li, 2018. "Accurate and fast path computation on large urban road networks: A general approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-13, February.
    • Handle: RePEc:plo:pone00:0192274
    DOI: 10.1371/journal.pone.0192274
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0192274
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0192274&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0192274?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Joaquín Goñi & Andrea Avena-Koenigsberger & Nieves Velez de Mendizabal & Martijn P van den Heuvel & Richard F Betzel & Olaf Sporns, 2013. "Exploring the Morphospace of Communication Efficiency in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(3), pages 1-10, March.
    2. Lysgaard, Jens, 1995. "A two-phase shortest path algorithm for networks with node coordinates," European Journal of Operational Research, Elsevier, vol. 87(2), pages 368-374, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ika Febrian Kristiana & Nugraha Arif Karyanta & Ermida Simanjuntak & Unika Prihatsanti & Tri Muji Ingarianti & Muhammad Shohib, 2022. "Social Support and Acculturative Stress of International Students," IJERPH, MDPI, vol. 19(11), pages 1-15, May.
    2. Ruggero Gramatica & T Di Matteo & Stefano Giorgetti & Massimo Barbiani & Dorian Bevec & Tomaso Aste, 2014. "Graph Theory Enables Drug Repurposing – How a Mathematical Model Can Drive the Discovery of Hidden Mechanisms of Action," PLOS ONE, Public Library of Science, vol. 9(1), pages 1-10, January.
    3. Estrada, Ernesto, 2021. "Informational cost and networks navigability," Applied Mathematics and Computation, Elsevier, vol. 397(C).

    More about this item

    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:plo:pone00:0192274. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.