Scalable transfer patterns

DOI10.1137/1.9781611974317.2MaRDI QIDQ5232542zbMATH OpenOpenAlexFDO

Authors Matthias Hertel, Sabine Storandt, Holger Bast

Publication date 12 September 2019

Published in 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974317.2

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Traffic problems in operations research (90B20)

Recommendations

• Fast routing in very large public transportation networks using transfer patterns
• Trip-based public transit routing
• Round-Based Public Transit Routing
• Delay-robustness of transfer patterns in public transportation route planning
• Fast and exact public transit routing with restricted Pareto sets

Cited in

(7)

• Trip-based public transit routing
• Fast routing in very large public transportation networks using transfer patterns
• Connection Scan Algorithm
• scientific article; zbMATH DE number 7525451 (Why is no real title available?)
• Transit nodes -- lower bounds and refined construction
• Delay-robustness of transfer patterns in public transportation route planning
• Routing in multimodal transportation networks with non-scheduled lines

This page was built for publication: Scalable transfer patterns

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