scientific article; zbMATH DE number 7525451

DOI10.4230/LIPICS.ESA.2019.14MaRDI QIDQ5075748zbMATH OpenFDO

Authors Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf

Publication date 11 May 2022

Full work available at URL https://arxiv.org/abs/1906.04832

zbMATH Keywords

algorithmsoptimizationpublic transportationroute planning

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
• Connection scan accelerated
• Connection Scan Algorithm
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Efficient models for timetable information in public transportation systems
• Fast routing in very large public transportation networks using transfer patterns
• Intriguingly simple and fast transit routing
• Round-Based Public Transit Routing
• Scalable transfer patterns
• Trip-based public transit routing
• User-constrained multimodal route planning

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075748)