Route planning with flexible objective functions

2010 Proceedings of the 12th Workshop on Algorithm Engineering and Experiments, ALENEX 2010

Volumn , Issue , 2010, Pages 124-137

  Geisberger, Robert ^a   Kobitzsch, Moritz ^a   Sanders, Peter ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

DISCRETE INTERVALS; FLEXIBLE QUERIES; IMPROVE PERFORMANCE; LINEAR COMBINATIONS; OBJECTIVE FUNCTIONS; PARAMETER CHOICE; PARAMETER INTERVALS; PRE-COMPUTATION;

TRAVEL TIME;

EID: 78650630433     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972900.12     Document Type: Conference Paper

References (25)

1. Reinhard Bauer and Daniel Delling. SHARC: Fast and Robust Unidirectional Routing. In Ian Munro and Dorothea Wagner, editors, Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08), pages 13-26. SIAM, April 2008.
2. Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, and Dorothea Wagner. Combining Hierarchical and Goal-Directed Speed- Up Techniques for Dijkstra's Algorithm. In Catherine C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of Lecture Notes in Computer Science, pages 303- 318. Springer, June 2008.
3. Daniel Delling. Engineering and Augmenting Route Planning Algorithms. PhD thesis, Universitat Karlsruhe (TH), Fakultat fur Informatik, 2009. http://i11www.ira.uka.de/extra/publications/d-earpa-09.pdf.
4. Daniel Delling and Dorothea Wagner. Pareto Paths with SHARC. In Jan Vahrenhold, editor, Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), volume 5526 of Lecture Notes in Computer Science, pages 125-136. Springer, June 2009.
5. Daniel Delling and Dorothea Wagner. Time- Dependent Route Planning. In Ravindra K. Ahuja, Rolf H. M̈ohring, and Christos Zaroliagis, editors, Robust and Online Large-Scale Optimization, volume 5868 of Lecture Notes in Computer Science, pages 207-230. Springer, 2009.
6. Edsger W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1:269-271, 1959.
7. Robert Geisberger. Contraction Hierarchies. Master's thesis, Universitat Karlsruhe (TH), Fakultat fur Informatik, 2008. http://algo2.iti.uni-karlsruhe. de/documents/routeplanning/geisberger-dipl.pdf.
8. Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In Catherine C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of Lecture Notes in Computer Science, pages 319-333. Springer, June 2008.
9. Andrew V. Goldberg and Chris Harrelson. Computing the Shortest Path: A* Search Meets Graph Theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), pages 156-165, 2005.
10. Andrew V. Goldberg, Haim Kaplan, and Renato F. Werneck. Better Landmarks Within Reach. In Camil Demetrescu, editor, Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), volume 4525 of Lecture Notes in Computer Science, pages 38-51. Springer, June 2007.
11. Andrew V. Goldberg and Renato F. Werneck. Computing Point-to-Point Shortest Paths from External Memory. In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05), pages 26-40. SIAM, 2005.
12. P. Hansen. Bricriteria Path Problems. In Gunter Fandel and T. Gal, editors, Multiple Criteria Decision Making - Theory and Application -, pages 109-127. Springer, 1979.
13. Peter E. Hart, Nils Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4:100-107, 1968.
14. Moritz Hilger. Accelerating Point-to-Point Shortest Path Computations in Large Scale Networks. Master's thesis, Technische Universitat Berlin, 2007.
15. T. Ikeda, Min-Yao Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, and K. Mitoh. A fast algorithm for finding better routes by AI search techniques. In Proceedings of the Vehicle Navigation and Information Systems Conference (VNSI'94), pages 291-296. ACM Press, 1994.
16. Richard M. Karp and James B. Orlin. Parameter Shortest Path Algorithms with an Application to Cyclic Staffing. Discrete Applied Mathematics, 2:37- 45, 1980.
17. Ulrich Lauther. An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In Geoinformation und Mobilitat - von der Forschung zur praktischen Anwendung, volume 22, pages 219-230. IfGI prints, 2004.
18. Ernesto Queiros Martins. On a Multicriteria Shortest Path Problem. European Journal of Operational Research, 26(3):236-245, 1984.
19. Rolf H. Mohring, Heiko Schilling, Birk Schutz, Dorothea Wagner, and Thomas Willhalm. Partitioning Graphs to Speedup Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics, 11:28, 2006.
20. James B. Orlin, Neal E. Young, and Robert Tarjan. Faster Parametric Shortest Path and Minimum Balance Algorithms. Networks, 21(2):205-221, 1991.
21. Ira Pohl. Bi-directional Search. In Bernard Meltzer and Donald Michie, editors, Proceedings of the Sixth Annual Machine Intelligence Workshop, volume 6, pages 124-140. Edinburgh University Press, 1971.
22. Peter Sanders and Dominik Schultes. Engineering Fast Route Planning Algorithms. In Camil Demetrescu, editor, Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), volume 4525 of Lecture Notes in Computer Science, pages 23-36. Springer, June 2007.
23. Dominik Schultes. Route Planning in Road Networks. PhD thesis, Universitat Karlsruhe (TH), Fakultat fur Informatik, February 2008. http://algo2.iti.uka.de/schultes/hwy/schultes-diss.pdf.
24. Dominik Schultes and Peter Sanders. Dynamic Highway-Node Routing. In Camil Demetrescu, editor, Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), volume 4525 of Lecture Notes in Computer Science, pages 66-79. Springer, June 2007.
25. Christian Vetter. Parallel Time-Dependent Contraction Hierarchies, 2009. Student Research Project. http://algo2.iti.uni-karlsruhe.de/documents/ routeplanning/vetter-sa.pdf.