Efficient routing in road networks with turn costs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6630 LNCS, Issue , 2011, Pages 100-111

  Geisberger, Robert ^a   Vetter, Christian ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

algorithm engineering; banned turn; route planning; turn cost

Indexed keywords

ALGORITHM ENGINEERING; BANNED TURN; EDGE-BASED; EFFICIENT ALGORITHM; EFFICIENT ROUTING; PREPROCESSING TIME; QUERY TIME; ROAD NETWORK; ROAD SEGMENTS; ROUTE PLANNING; SHORTEST PATH; SHORTEST PATH COMPUTATIONS; SPACE EFFICIENCIES; TURN COST; WEIGHTED GRAPH; SHORTEST PATH QUERIES;

ALGORITHMS; COSTS; GRAPH THEORY; MOTOR TRANSPORTATION; ROADS AND STREETS; COMPUTATIONAL EFFICIENCY; COST ENGINEERING; TRANSPORTATION;

COMPUTATIONAL EFFICIENCY; GRAPH THEORY;

EID: 79955841499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20662-7_9     Document Type: Conference Paper

References (12)

1. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009)
2. Caldwell, T.: On Finding Minimum Routes in a Network With Turn Penalties. Communications of the ACM 4(2) (1961)
3. Winter, S.: Modeling Costs of Turns in Route Planning. GeoInformatica 6(4), 345-361 (2002)
4. Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568-579. Springer, Heidelberg (2005)
5. Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66-79. Springer, Heidelberg (2007)
6. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319-333. Springer, Heidelberg (2008)
7. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics 15(2.3), 1-31 (2010); Special Section devoted to WEA 2008
8. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 231-242. Springer, Heidelberg (2011)
9. Volker, L.: Route Planning in Road Networks with Turn Costs, Student Research Project (2008), http://algo2.iti.uni-karlsruhe.de/documents/ routeplanning/volker-sa.pdf
10. Vetter, C.: Parallel Time-Dependent Contraction Hierarchies, Student Research Project (2009), http://algo2.iti.kit.edu/download/vetter-sa.pdf.
11. Vetter, C.: MoNav (2011), http://code.google.com/p/monav/
12. Vetter, C.: Fast and Exact Mobile Navigation with OpenStreetMap Data. Master's thesis, Karlsruhe Institute of Technology (2010)