Fast Routing in Road Networks with Transit Nodes-Reference-Cited by-同舟云学术

Fast Routing in Road Networks with Transit Nodes

Published:2007-04-27 Issue:5824 Volume:316 Page:566-566
ISSN:0036-8075
Container-title:Science
language:en
Short-container-title:Science

Author:

Bast Holger¹²,Funke Stefan¹²,Sanders Peter¹²,Schultes Dominik¹²

Affiliation:

1. Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany.

2. Universität Karlsruhe (TH), 76128 Karlsruhe, Germany.

Abstract

When you drive to somewhere far away, you will leave your current location via one of only a few important traffic junctions. Starting from this informal observation, we developed an algorithmic approach, transit node routing, that allows us to reduce quickest path queries in road networks to a small number of table lookups. For road maps of Western Europe and the United States, our best query times improved over the best previously published figures by two orders of magnitude. This is also more than one million times faster than the best known algorithm for general networks.

Publisher

American Association for the Advancement of Science (AAAS)

Subject

Multidisciplinary

Reference4 articles.

1. A note on two problems in connexion with graphs

2. P. Sanders, D. Schultes, in Algorithms: ESA 2006, 14th European Symposium on Algorithms (ESA), Zurich, Switzerland, 11 to 13 September 2006 (vol. 4168 of Lecture Notes in Computer Science, Springer, Berlin, 2006), pp. 804–816.

3. More details can be found at http://algo2.iti.uka.de/schultes/hwy/.

4. This work was partially supported by Deutsche Forschungsgemeinschaft grant SA 933/1-3.

Cited by 134 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Boosting existing shortest path algorithms through highly efficient building of node cut set-based overlay;Expert Systems with Applications;2024-08

2. A rapid globe-wide shortest route planning algorithm based on two-layer oceanic shortcut network considering great circle distance;Ocean Engineering;2023-11

3. SparkACO: A Spark-Based Ant Colony Optimization for Path Planning of Large-Scale Complex Road Networks;2023 IEEE Ninth International Conference on Big Data Computing Service and Applications (BigDataService);2023-07

4. Solving the Traveling Saleman Problem Using Reinforcement Learning;2023 IEEE 2nd International Conference on Electrical Engineering, Big Data and Algorithms (EEBDA);2023-02-24

5. Aggregating Pairwise Information Over Optimal Routes;Proceedings of the 9th International Conference on Vehicle Technology and Intelligent Transport Systems;2023