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

Customizable Route Planning in Road Networks

Author

Listed:
  • Daniel Delling

    (Microsoft Research, Mountain View, California 94043)

  • Andrew V. Goldberg

    (Microsoft Research, Mountain View, California 94043)

  • Thomas Pajor

    (Microsoft Research, Mountain View, California 94043)

  • Renato F. Werneck

    (Microsoft Research, Mountain View, California 94043)

Abstract

We propose the first routing engine for computing driving directions in large-scale road networks that satisfies all requirements of a real-world production system. It supports arbitrary metrics (cost functions) and turn costs, enables real-time queries, and can incorporate a new metric in less than a second, which is fast enough to support real-time traffic updates and personalized cost functions. The amount of metric-specific data is a small fraction of the graph itself, which allows us to maintain several metrics in memory simultaneously. The algorithm is the core of the routing engine currently in use by Bing Maps.

Suggested Citation

  • Daniel Delling & Andrew V. Goldberg & Thomas Pajor & Renato F. Werneck, 2017. "Customizable Route Planning in Road Networks," Transportation Science, INFORMS, vol. 51(2), pages 566-561, May.
    • Handle: RePEc:inm:ortrsc:v:51:y:2017:i:2:p:566-561
    DOI: 10.1287/trsc.2014.0579
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2014.0579
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2014.0579?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. Eric V. Denardo & Bennett L. Fox, 1979. "Shortest-Route Methods: 1. Reaching, Pruning, and Buckets," Operations Research, INFORMS, vol. 27(1), pages 161-186, February.
    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. Andrea Detti & Giuseppe Tropea & Nicola Blefari Melazzi & Dag Kjenstad & Lukas Bach & Ivar Christiansen & Federico Lisi, 2019. "Federation and Orchestration: A Scalable Solution for EU Multimodal Travel Information Services," Sustainability, MDPI, vol. 11(7), pages 1-16, March.
    3. 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.
    4. Ivana Semanjski & Sidharta Gautama, 2024. "Sustainable Time-Dependent Cheapest Path Problem with Integrated Collaborative Stakeholders’ Perspectives," Sustainability, MDPI, vol. 16(9), pages 1-19, April.
    5. Cristiana L. Lara & John Wassick, 2023. "Future of Supply Chain: Challenges, Trends, and Prospects," Papers 2301.13174, arXiv.org.

    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. Ann Campbell & Michel Gendreau & Barrett Thomas, 2011. "The orienteering problem with stochastic travel and service times," Annals of Operations Research, Springer, vol. 186(1), pages 61-81, June.
    2. Le-Anh, T. & de Koster, M.B.M., 2004. "Real-Time Scheduling Approaches for Vehicle-Based Internal Transport Systems," ERIM Report Series Research in Management ERS-2004-056-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    3. Ziliaskopoulos, Athanasios K. & Mandanas, Fotios D. & Mahmassani, Hani S., 2009. "An extension of labeling techniques for finding shortest path trees," European Journal of Operational Research, Elsevier, vol. 198(1), pages 63-72, October.

    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:51:y:2017:i:2:p:566-561. 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.