Multi-hop ride sharing

Proceedings of the 6th Annual Symposium on Combinatorial Search, SoCS 2013

Volumn , Issue , 2013, Pages 71-79

  Drews, Florian ^a   Luxen, Dennis ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NUMBER; DIJKSTRA'S ALGORITHMS; EXPERIMENTAL ANALYSIS; MULTIHOP; RIDE-SHARING; ROAD NETWORK;

ALGORITHMS;

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

References (18)

1. Abraham, I.; Delling, D.; Fiat, A.; Goldberg, A. V.; and Werneck, R. F. 2012. HLDB: Location-Based Services in Databases. In ACM SIGSPATIAL Intern. Symp. on Adv. in Geographic Information Systems (GIS'12), 339-348. ACM.
2. Arz, J.; Luxen, D.; and Sanders, P. 2013. Transit Node Routing Reconsidered. In International Symposium on Experimental Algorithms (SEA'13), volume 7933 of LNCS, 55-66.
3. Springer. Bast, H.; Funke, S.; and Matijevic, D. 2009. TRANSIT-Ultrafast Shortest-Path Queries with Linear-Time Preprocessing. In The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book. American Mathematical Society.
4. Batz, G. V.; Geisberger, R.; Sanders, P.; and Vetter, C. 2013. Minimum Time-Dependent Travel Times with Contraction Hierarchies. ACM Journal of Experimental Algorithmics.
5. To appear. Bauer, R.; Delling, D.; and Wagner, D. 2010. Experimental Study on Speed-Up Techniques for Timetable Information Systems. Networks 57:38-52.
6. Botea, A. 2011. Ultra-Fast Optimal Pathfinding without Runtime Search. In Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'11), 122-127.
7. AAAI. Bundesministerium fur Verkehr, B. u. S. 2008. Mobilitat in Deutschland 2008. Technical report. http://www.mobilitaetin-deutschland.de/pdf/ MiD2008 Abschlussbericht I.pdf.
8. Delling, D.; Dibbelt, J.; Pajor, T.; Wagner, D.; and Werneck, R. F. 2013. Computing Multimodal Journeys in Practice. In International Symposium on Experimental Algorithms (SEA'13), LNCS. to appear.
9. Delling, D. 2009. Engineering and Augmenting Route Planning Algorithms. Ph.D. Dissertation, Universitat Karlsruhe, Fakultat fur Informatik.
10. Dijkstra, E. W. 1959. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1:269-271.
11. Geisberger, R.; Luxen, D.; Sanders, P.; Neubauer, S.; and Volker, L. 2010. Fast Detour Computation for Ride Sharing. In Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10), volume 14 of OASIcs, 88-99.
12. Geisberger, R.; Sanders, P.; Schultes, D.; and Vetter, C. 2012. Exact Routing in Large Road Networks Using Contraction Hierarchies. Transp. Sci. 46(3):388-404.
13. Goldberg, A. V., and Harrelson, C. 2005. Computing the Shortest Path: A Search Meets Graph Theory. In ACM-SIAM Symp. on Discr. Algo. (SODA'05), 156-165. SIAM.
14. Hart, P. E.; Nilsson, N.; and Raphael, B. 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. on Sys. Sci. and Cyb. 4:100-107.
15. Knopp, S.; Sanders, P.; Schultes, D.; Schulz, F.; andWagner, D. 2007. Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In Workshop on Algorithm Engineering and Experiments (ALENEX'07), 36-45. SIAM.
16. Luxen, D., and Schieferdecker, D. 2012. Candidate Sets for Alternative Routes in Road Networks. In International Symposium on Experimental Algorithms (SEA'12), volume 7276 of LNCS, 260-270. Springer.
17. Pyrga, E.; Schulz, F.; Wagner, D.; and Zaroliagis, C. 2004. Experimental Comparison of Shortest Path Approaches for Timetable Information. In Workshop on Algorithm Engineering and Experiments (ALENEX'04), 88-99. SIAM.
18. Vetter, C. 2009. Parallel Time-Dependent Contraction Hierarchies. Technical report, Karlsruhe Institute of Technology, Fakultat fur Informatik. http://algo2.iti.kit.edu/download/ vetter sa.pdf.