Algorithms of multi-modal route planning based on the concept of switch point

Photogrammetrie, Fernerkundung, Geoinformation

Volumn 2009, Issue 5, 2009, Pages 431-444

  Liu, Lu ^a   Meng, Liqiu ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Multi modal navigation; Network analysis; Shortest path algorithm

Indexed keywords

EID: 79958826433     PISSN: 14328364     EISSN: None     Source Type: Journal    
DOI: 10.1127/1432-8364/2009/0031     Document Type: Article

References (30)

1. BAJAJ, C.P., 1971: Some Constrained Shortest-Route Problems. - Mathematical Methods of Operations Research 15 (1): 287-301.
2. BARRETT, C., BISSET, K., HOLZER, M., KONJEVOD, G., MARATHE, M. & WAGNER, D., 2008: Engineering Label-Constrained Shortest-Path Algorithms. - Algorithmic Aspects in Information and Management: 27-37.
3. BARRETT, C., JACOB, R. & MARATHE, M., 1998: Formal Language Constrained Path Problems. - Algorithm Theory - Swat'98: 234-245. (Pubitemid 128099584)
4. BELLMAN, R., 1958: On a Routing Problem. - Quarterly of Applied Mathematics 16 (1): 87-90.
5. BIELLI, M., BOULMAKOUL, A. & MOUNCIF, H., 2006: Object Modeling and Path Computation for Multimodal Travel Systems. - European Journal of Operational Research 175 (3): 1705-1730. (Pubitemid 44436750)
6. BOARDMAN, B.S., MALSTROM, E.M., BUTLER, D.P. & COLE, M.H., 1997: Computer Assisted Routing of Intermodal Shipments. - 21st International Conference on Computers and Industrial Engineering: 311-314. (Pubitemid 127404376)
7. BOUSSEDJRA, M., BLOCH, C. & EL MOUDNI, A., 2004: An Exact Method to Find the Intermodal Shortest Path (Isp). - IEEE International Conference on Networking, Sensing and Control: 1075-1080.
8. CHERKASSKY, B., GOLDBERG, A. & RADZIK, T., 1996: Shortest Paths Algorithms: Theory and Experimental Evaluation. - Mathematical Programming 73 (2): 129-174. (Pubitemid 126375469)
9. COAST, S., 2004: Openstreetmap Project. - www.openstreetmap.org
10. CORMEN, T.H., LEISERSON, C.E., RIVEST, R.L. & STEIN, C., 2001: Introduction to Algorithms. - The MIT Press and McGraw-Hill.
11. COUCKUYT, J.D., MCGRATH, T.S. & SUTANTO, H., 2006: Multi-Modal Navigation System and Method. - United States Patent, Application 11/058, 057.
12. DELLING, D., SANDERS, P., SCHULTES, D. & WAGNER, D., 2009: Engineering Route Planning Algorithms. - Algorithmics of Large and Complex Networks. Springer.
13. DEO, N. & PANG, C.-Y., 1984: Shortest-Path Algorithms: Taxonomy and Annotation. - Networks 14 (2): 275-323.
14. DIJKSTRA, E.W., 1959: A Note on Two Problems in Connexion with Graphs. - Numerische Mathematik 1 (1): 269-271.
15. FRANK, A.U., 2008: Shortest Path in a Multi-Modal Transportation Network: Agent Simulation in a Product of Two State-Transition Networks. - KI - Künstliche Intelligenz 3: 14-18.
16. GALLO, G. & PALLOTTINO, S., 1988: Shortest Path Algorithms. - Annals of Operations Research 13 (1): 1-79.
17. HOCHMAIR, H.H., 2008: Grouping of Optimized Pedestrian Routes for Multi-Modal Route Planning: A Comparison of Two Cities. - The European Information Society, Springer, Berlin: 339-358.
18. HOEL, E.G., HENG, W.-L. & HONEYCUTT, D., 2005: High Performance Multimodal Networks. - Advances in Spatial and Temporal Databases, Springer, Berlin: 308-327. (Pubitemid 41433172)
19. LIU, L. & MENG, L., 2008: Algorithmic Concerns of Multi-Modal Route Planning. - 5th International Symposium on LBS & TeleCartography, 26-28 November, Salzburg, Austria.
20. LOZANO, A. & STORCHI, G., 2001: Shortest Viable Path Algorithm in Multimodal Networks. - Transportation Research Part A: Policy and Practice 35 (3): 225-241.
21. LOZANO, A. & STORCHI, G., 2002: Shortest Viable Hyperpath in Multimodal Networks. - Transportation Research Part B: Methodological 36 (10): 853-874. (Pubitemid 35400135)
22. MODESTI, P. & SCIOMACHEN, A., 1998: A Utility Measure for Finding Multiobjective Shortest Paths in Urban Multimodal Transportation Networks. - European Journal of Operational Research 111 (3): 495-508. (Pubitemid 128410908)
23. PAJOR, T., 2009: Multi-Modal Route Planning. Diplomarbeit, Karlsruhe, Universität Karlsruhe.
24. PALLOTTINO, S., 1984: Shortest-Path Methods: Complexity, Interrelations and New Propositions. - Networks 14 (2): 257-267. (Pubitemid 14589468)
25. REHRL, K., BRUNTSCH, S. & MENTZ, H.-J., 2007: Assisting Multimodal Travelers: Design and Prototypical Implementation of a Personal Travel Companion. - IEEE Transactions on Intelligent Transportation Systems 8 (1): 31-42. (Pubitemid 46376151)
26. SOUTHWORTH, F. & PETERSON, B.E., 2000: Intermodal and International Freight Network Modeling. - Transportation Research Part C: Emerging Technologies 8 (1-6): 147-166.
27. ZHAN, F.B. & NOON, C.E., 1998: Shortest Path Algorithms: An Evaluation Using Real Road Networks. - Transportation Science 32 (1): 65-73. (Pubitemid 128610041)
28. ZHAN, F.B. & NOON, C.E., 2000: A Comparison between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths. - Journal of Geographic Information and Decision Analysis 4 (2): 1-11.
29. ZILIASKOPOULOS, A. & WARDELL, W., 2000: An Intermodal Optimum Path Algorithm for Multiodal Networks with Dynamic Arc Travel Times and Switching Delays. - European Journal of Operational Research 125 (3): 486-502.
30. ZOGRAFOS, K.G. & ANDROUTSOPOULOS, K.N., 2008: Algorithms for Itinerary Planning in Multimodal Transportation Networks. - IEEE Transactions on Intelligent Transportation Systems 9 (1): 175-184. (Pubitemid 351337440)