Fast routing in very large public transportation networks using transfer patterns
From MaRDI portal
Publication:3586470
Recommendations
Cited in
(21)- Computing and listing \(st\)-paths in public transportation networks
- Engineering graph-based models for dynamic timetable information systems
- User-constrained multimodal route planning
- Intriguingly simple and fast transit routing
- Fast Routing in Road Networks with Transit Nodes
- Time-dependent routing problems: a review
- Trip-based public transit routing
- Transfer Graph Approach for Multimodal Transport Problems
- Fast long-range connections in transportation networks
- Efficient traffic assignment for public transit networks
- Connection Scan Algorithm
- scientific article; zbMATH DE number 7525451 (Why is no real title available?)
- Scalable transfer patterns
- Fast and exact public transit routing with restricted Pareto sets
- Round-Based Public Transit Routing
- Transit nodes -- lower bounds and refined construction
- Delay-robustness of transfer patterns in public transportation route planning
- Parallel computation of best connections in public transportation networks
- Computing and listing \(st\)-paths in public transportation networks
- Routing in multimodal transportation networks with non-scheduled lines
- A review of recent advances in time-dependent vehicle routing
This page was built for publication: Fast routing in very large public transportation networks using transfer patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586470)