IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v46y2012i3p388-404.html
   My bibliography  Save this article

Exact Routing in Large Road Networks Using Contraction Hierarchies

Author

Listed:
  • Robert Geisberger

    (Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany)

  • Peter Sanders

    (Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany)

  • Dominik Schultes

    (Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany)

  • Christian Vetter

    (Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany)

Abstract

Contraction hierarchies are a simple approach for fast routing in road networks. Our algorithm calculates exact shortest paths and handles road networks of whole continents. During a preprocessing step, we exploit the inherent hierarchical structure of road networks by adding shortcut edges. A subsequent modified bidirectional Dijkstra algorithm can then find a shortest path in a fraction of a millisecond, visiting only a few hundred nodes. This small search space makes it suitable to implement it on a mobile device. We present a mobile implementation that also handles changes in the road network, like traffic jams, and that allows instantaneous routing without noticeable delay for the user. Also, an algorithm to calculate large distance tables is currently the fastest if based on contraction hierarchies.

Suggested Citation

  • Robert Geisberger & Peter Sanders & Dominik Schultes & Christian Vetter, 2012. "Exact Routing in Large Road Networks Using Contraction Hierarchies," Transportation Science, INFORMS, vol. 46(3), pages 388-404, August.
    • Handle: RePEc:inm:ortrsc:v:46:y:2012:i:3:p:388-404
    DOI: 10.1287/trsc.1110.0401
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1110.0401
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1110.0401?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. Pijls, Wim & Post, Henk, 2009. "A new bidirectional search algorithm with shortened postprocessing," European Journal of Operational Research, Elsevier, vol. 198(2), pages 363-369, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    2. Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
    3. , Marcin Wozniak & Radzimski, Adam & Wajchman-Świtalska, Sandra, 2024. "Is More Always Better? Evaluating Accessibility to Parks and Forests in 33 European Cities Using Sustainable Modes of Transportation," OSF Preprints hcwgp, Center for Open Science.
    4. Yaqiong Liu & Hock Soon Seah & Guochu Shou, 2016. "Cost-Optimal Time-dEpendent Routing with Time and Speed Constraints in Directed Acyclic Road Networks," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 15(06), pages 1413-1450, November.
    5. Moritz Baum & Julian Dibbelt & Andreas Gemsa & Dorothea Wagner & Tobias Zündorf, 2019. "Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles," Transportation Science, INFORMS, vol. 53(6), pages 1627-1655, November.
    6. Zhan, Xingbin & Szeto, W.Y. & Shui, C.S. & Chen, Xiqun (Michael), 2021. "A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    7. Mepparambath, Rakhi Manohar & Soh, Yong Sheng & Jayaraman, Vasundhara & Tan, Hong En & Ramli, Muhamad Azfar, 2023. "A novel modelling approach of integrated taxi and transit mode and route choice using city-scale emerging mobility data," Transportation Research Part A: Policy and Practice, Elsevier, vol. 170(C).
    8. Stefan Kuhlemann & Kevin Tierney, 2020. "A genetic algorithm for finding realistic sea routes considering the weather," Journal of Heuristics, Springer, vol. 26(6), pages 801-825, December.
    9. Johannes Blum & Stefan Funke & Sabine Storandt, 2021. "Sublinear search spaces for shortest path planning in grid and road networks," Journal of Combinatorial Optimization, Springer, vol. 42(2), pages 231-257, August.
    10. Young Woong Park, 2021. "Optimization for L 1 -Norm Error Fitting via Data Aggregation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 120-142, January.

    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. Pijls, Wim & Post, Henk, 2010. "Note on "A new bidirectional algorithm for shortest paths"," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1140-1141, December.
    2. Pijls, W.H.L.M. & Post, H., 2009. "Yet another bidirectional algorithm for shortest paths," Econometric Institute Research Papers EI 2009-10, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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:inm:ortrsc:v:46:y:2012:i:3:p:388-404. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.