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. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1287/trsc.2014.0579 | TRANSPORTATION SCIENCE |
Keywords | Field | DocType |
route planning,road networks,shortest paths,alternative routes,routing in traffic,Bing Maps | Graph,Link-state routing protocol,Route planning,Road networks,Route planning software,Dynamic Source Routing,Static routing,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
51 | 2 | 0041-1655 |
Citations | PageRank | References |
24 | 0.87 | 49 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Daniel Delling | 1 | 2049 | 108.90 |
Andrew V. Goldberg | 2 | 5883 | 676.30 |
Thomas Pajor | 3 | 397 | 22.39 |
Renato F. Werneck | 4 | 1743 | 84.33 |