Trip-Based Public Transit Routing

DOI10.1007/978-3-662-48350-3_85zbMath1466.90025arXiv1504.07149OpenAlexW3101068778MaRDI QIDQ3452863

Sascha Witt

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Related Items (3)

Engineering graph-based models for dynamic timetable information systems ⋮ Connection Scan Algorithm ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Engineering graph-based models for dynamic timetable information systems
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Intriguingly Simple and Fast Transit Routing
• Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected
• Efficient models for timetable information in public transportation systems
• Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
• Parallel computation of best connections in public transportation networks

This page was built for publication: Trip-Based Public Transit Routing