Route planning for bicycles - Exact constrained shortest paths made practical via contraction hierarchy

ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling

Volumn , Issue , 2012, Pages 234-242

  Storandt, Sabine ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED SHORTEST PATH; EXACT COMPUTATIONS; LARGE NETWORKS; NP-HARDNESS; RESOURCE CONSTRAINT; ROUTE PLANNING; SHORTEST PATH; SHORTEST PATH PROBLEM;

ENERGY UTILIZATION; GRAPH THEORY;

PROBLEM SOLVING;

EID: 84866454656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Aggarwal, V.; Aneja, Y.; and Nair, K. 1982. Minimal spanning tree subject to a side constraint. In 32nd ACM Symposium on Theory of Computing (STOC), 286-295.
2. Aneja, Y. P.; Aggarwal, V.; and Nair, K. P. K. 1983. Shortest chain subject to side constraints. Networks 13(2):295-302.
3. Batz, G. V.; Delling, D.; Sanders, P.; and Vetter, C. 2009. Time-dependent contraction hierarchies. In ALENEX, 97-105.
4. Bauer, R., and Delling, D. 2009. Sharc: Fast and robust unidirectional routing. ACM Journal of Experimental Algorithmics 14.
5. Delling, D., and Wagner, D. 2009. Pareto paths with sharc. In SEA, 125-136.
6. Delling, D. 2008. Time-dependent share-routing. In ESA, 332-343.
7. Geisberger, R.; Sanders, P.; Schultes, D.; and Delling, D. 2008. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In WEA, 319-333.
8. Geisberger, R.; Kobitzsch, M.; and Sanders, P. 2010. Route planning with flexible objective functions. In ALENEX'10, 124-137.
9. Hassin, R. 1992. Approximation schemes for the restricted shortest path problem. Mathematical Operational Research 17(1):36-42.
10. Joksch, H. 1966. The shortest route problem with constraints. Journal of Mathematical Analysis and Application 14:191-197.
11. Köhler, E.; Möhring, R.; and Schilling, H. 2005. Acceleration of shortest path and constrained shortest path computation. In Experimental and Efficient Algorithms, volume 3503 of Lecture Notes in Computer Science. Springer. 126-138.
12. Lauther, U. 1997. Slow preprocessing of graphs for extremely fast shortest path calculations. Lecture at the Workshop on Computational Integer Programming at ZIB.
13. Mehlhorn, K., and Ziegelmann, M. 2000. Resource constrained shortest paths. In Paterson, M., ed., Algorithms -ESA 2000, volume 1879 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg. 326-337.
14. Muhandiramge, R., and Boland, N. 2009. Simultaneous solution of lagrangean dual problems interleaved with pre-processing for the weight constrained shortest path problem. Netw. 53:358-381.