Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks

DOI10.1145/2670126zbMath1348.90105OpenAlexW2150928468MaRDI QIDQ2828194

Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo

Publication date: 24 October 2016

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2670126

zbMATH Keywords

shortest pathregular languagesconstrained shortest pathsALTmultimodal transportation network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Formal languages and automata (68Q45) Transportation, logistics and supply chain management (90B06) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Routing in multimodal transportation networks with non-scheduled lines ⋮ Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks ⋮ User-Constrained Multimodal Route Planning ⋮ Optimization and sustainable development

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
• Shortest path under rational constraint
• Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks
• UniALT for regular language contrained shortest paths on a multi-modal transportation network
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Efficient models for timetable information in public transportation systems
• Engineering Label-Constrained Shortest-Path Algorithms
• Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
• Engineering Route Planning Algorithms
• Time-Dependent Route Planning
• Formal-Language-Constrained Path Problems
• Finding Regular Simple Paths in Graph Databases
• User-Constrained Multi-Modal Route Planning
• Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
• The approach‐dependent, time‐dependent, label‐constrained shortest path problem

This page was built for publication: Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks