Intriguingly simple and fast transit routing

DOI10.1007/978-3-642-38527-8_6MaRDI QIDQ2870708zbMATH OpenOpenAlexFDO

Authors Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner

Publication date 21 January 2014

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38527-8_6

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Traffic problems in operations research (90B20)

Recommendations

• Trip-based public transit routing
• Connection Scan Algorithm
• Round-Based Public Transit Routing
• Fast routing in very large public transportation networks using transfer patterns
• Connection scan accelerated

Cited in

(16)

• Parallel computation of best connections in public transportation networks
• scientific article; zbMATH DE number 1445281 (Why is no real title available?)
• Reliability in public transit networks considering backup itineraries
• A review of recent advances in time-dependent vehicle routing
• Routing in multimodal transportation networks with non-scheduled lines
• On computing Pareto optimal paths in weighted time-dependent networks
• On short fastest paths in temporal graphs
• Routing in stochastic public transit networks
• Efficient traffic assignment for public transit networks
• scientific article; zbMATH DE number 7121837 (Why is no real title available?)
• Round-Based Public Transit Routing
• Connection Scan Algorithm
• Connection scan accelerated
• Engineering graph-based models for dynamic timetable information systems
• Trip-based public transit routing
• scientific article; zbMATH DE number 7525451 (Why is no real title available?)

This page was built for publication: Intriguingly simple and fast transit routing

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