User-Constrained Multimodal Route Planning
From MaRDI portal
Publication:2828200
DOI10.1145/2699886zbMath1348.90082MaRDI QIDQ2828200
Julian Dibbelt, Dorothea Wagner, Thomas Pajor
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/2699886
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles, Search-space size in contraction hierarchies, Heuristics for the time dependent team orienteering problem: application to tourist route planning, Itinerary planning with time budget for risk-averse travelers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks
- Hierarchical Hub Labelings for Shortest Paths
- UniALT for regular language contrained shortest paths on a multi-modal transportation network
- Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected
- Fast Routing in Road Networks with Transit Nodes
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Efficient models for timetable information in public transportation systems
- A Practical Shortest Path Algorithm with Linear Expected Time
- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
- Engineering Route Planning Algorithms
- Car or Public Transport—Two Worlds
- Formal-Language-Constrained Path Problems
- Finding Regular Simple Paths in Graph Databases
- Route Planning with Flexible Objective Functions
- User-Constrained Multi-Modal Route Planning
- Engineering multilevel overlay graphs for shortest-path queries
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
- Parallel computation of best connections in public transportation networks
- Dijkstra's algorithm on-line
- Algorithms – ESA 2005
- Geometric containers for efficient shortest-path computation
