Generalised time-dependent graphs for fully multimodal journey planning

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Volumn , Issue , 2013, Pages 2138-2145

  Hrncir, Jan ^a   Jakob, Michal ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84894366809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITSC.2013.6728545     Document Type: Conference Paper

References (13)

1. H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast Routing in Road Networks with Transit Nodes. Science, 316(5824):566, 2007.
2. R. Bauer and D. Delling. SHARC: Fast and robust unidirectional routing. ACM Journal of Experimental Algorithmics, 14, 2009.
3. G. S. Brodal and R. Jacob. Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electronic Notes in Theoretical Computer Science, 92(0):3-15, 2004.
4. D. Delling, T. Pajor, and D. Wagner. Accelerating Multi-modal Route Planning by Access-Nodes. In ESA, volume 5757 of Lecture Notes in Computer Science, pages 587-598. Springer, 2009.
5. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987.
6. A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In Proceedings of the 16th annual ACMSIAM symposium on Discrete algorithms, Philadelphia, USA, 2005.
7. M. Horn. Multi-modal and demand-responsive passenger transport systems: A modelling framework with embedded control systems. Transportation Research Part A: Policy and Practice, 36(2):167-188, 2002.
8. T. Pajor. Multi-Modal Route Planning. Master's thesis, 2009.
9. E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis. Efficient models for timetable information in public transportation systems. Journal of Experimental Algorithmics (JEA), 12, 2008.
10. E. Pyrga, F. Schulz, D. Wagner, and C. D. Zaroliagis. Experimental Comparison of Shortest Path Approaches for Timetable Information. In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 88-99, 2004.
11. P. Sanders and D. Schultes. Highway Hierarchies Hasten Exact Shortest Path Queries. In ESA, volume 3669 of Lecture Notes in Computer Science, pages 568-579. Springer, 2005.
12. F. Schulz. Timetable information and shortest paths. PhD thesis, 2005.
13. H. Yu and F. Lu. A Multi-Modal Route Planning Approach With an Improved Genetic Algorithm. In Joint International Conference on Theory, Data Handling and Modelling in GeoSpatial Information Science, pages 343-348, 2010.