메뉴 건너뛰기




Volumn , Issue , 2012, Pages 118-129

User-constrained multi-modal route planning

Author keywords

[No Author keywords available]

Indexed keywords

ROADS AND STREETS; TAXICABS; URBAN TRANSPORTATION;

EID: 84882292913     PISSN: 21640300     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972924.12     Document Type: Conference Paper
Times cited : (23)

References (42)
  • 9
    • 78650673054 scopus 로고    scopus 로고
    • Time-dependent contraction hierarchies and approximation
    • G. V. Batz, R. Geisberger, S. Neubauer, and P. Sanders. Time-Dependent Contraction Hierarchies and Approximation. In Festa [21], pages 166-177.
    • Festa [21] , pp. 166-177
    • Batz, G.V.1    Geisberger, R.2    Neubauer, S.3    Sanders, P.4
  • 10
    • 77955861994 scopus 로고    scopus 로고
    • Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
    • January Special Section devoted to WEA'08
    • R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner. Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics, 15(2.3):1-31, January 2010. Special Section devoted to WEA'08.
    • (2010) ACM Journal of Experimental Algorithmics , vol.15 , Issue.2-3 , pp. 1-31
    • Bauer, R.1    Delling, D.2    Sanders, P.3    Schieferdecker, D.4    Schultes, D.5    Wagner, D.6
  • 11
    • 84882428450 scopus 로고    scopus 로고
    • Accelerating time-dependent multi-criteria timetable information is harder than expected
    • A. Berger, D. Delling, A. Gebhardt, and M. Müller-Hannemann. Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. In ATMOS'09 [3].
    • ATMOS'09 [3]
    • Berger, A.1    Delling, D.2    Gebhardt, A.3    Müller-Hannemann, M.4
  • 22
    • 78249255035 scopus 로고    scopus 로고
    • Contraction of timetable networks with realistic transfers
    • R. Geisberger. Contraction of Timetable Networks with Realistic Transfers. In Festa [21], pages 71-82.
    • Festa [21] , pp. 71-82
    • Geisberger, R.1
  • 25
    • 84882328679 scopus 로고    scopus 로고
    • General Transit Feed. http://code.google.com/p/googletransitdatafeed/, 2010.
    • (2010) General Transit Feed
  • 26
    • 49749144986 scopus 로고    scopus 로고
    • A practical shortest path algorithm with linear expected time
    • A. V. Goldberg. A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing, 37:1637-1655, 2008.
    • (2008) SIAM Journal on Computing , vol.37 , pp. 1637-1655
    • Goldberg, A.V.1
  • 29
    • 84882369957 scopus 로고    scopus 로고
    • HaCon - Ingenieurgesellschaft mbH. http://www.hacon.de, 2008.
    • (2008)
  • 31
    • 53849100358 scopus 로고    scopus 로고
    • Engineering multi-level overlay graphs for shortest-path queries
    • December
    • M. Holzer, F. Schulz, and D. Wagner. Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ACM Journal of Experimental Algorithmics, 13(2.5):1-26, December 2008.
    • (2008) ACM Journal of Experimental Algorithmics , vol.13 , Issue.2-5 , pp. 1-26
    • Holzer, M.1    Schulz, F.2    Wagner, D.3
  • 33
    • 24944471617 scopus 로고    scopus 로고
    • An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background
    • IfGI prints
    • U. Lauther. An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In Geoinformation und Mo- bilität - von der Forschung zur praktischen Anwendung, Volume 22, pages 219-230. IfGI prints, 2004.
    • (2004) Geoinformation und Mo- Bilität - Von der Forschung Zur Praktischen Anwendung , vol.22 , pp. 219-230
    • Lauther, U.1
  • 34
    • 84867524779 scopus 로고
    • Finding regular simple paths in graph databases
    • A. O. Mendelzon and P. T. Wood. Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing, 24(6):1235-1258, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , Issue.6 , pp. 1235-1258
    • Mendelzon, A.O.1    Wood, P.T.2
  • 35
    • 84882360676 scopus 로고
    • Metropolitan Transportation Authority. http://www.mta.info/default.html, 1965.
    • (1965)
  • 36
    • 70350350140 scopus 로고    scopus 로고
    • Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik
    • T. Pajor. Multi-Modal Route Planning. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik, 2009. Online available at http://i11www.ira.uka.de/extra/publications/p-mmrp-09.pdf.
    • (2009) Multi-Modal Route Planning
    • Pajor, T.1
  • 41
    • 85000327782 scopus 로고    scopus 로고
    • Dijkstra's algorithm on-line: An empirical case study from public railroad transport
    • F. Schulz, D. Wagner, and K. Weihe. Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics, 5(12):1-23, 2000.
    • (2000) ACM Journal of Experimental Algorithmics , vol.5 , Issue.12 , pp. 1-23
    • Schulz, F.1    Wagner, D.2    Weihe, K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.