Closed MoKob closed 7 years ago
Publication: Multi-criteria Shortest Paths in Time-Dependent Train Networks
I expect this algorithm to be too slow for what we want to achieve. It could end up as a tool to speed-up other algorithmic approaches, though.
Available in two versions, time-dependent graph and time expanded graph.
Publication: Engineering Time-Expanded Graphs for Faster Timetable Information?
Publication: Bidirectional A∗ Search on Time-Dependent Road Networks
I expect both settings to have little influence on our approach. The graph modelling strategies could prove useful.
Publication: Geometric Containers for Efficient Shortest-Path Computation
~ 5%
compared to Dijkstra's algorithm.Strong indicator that partitions might possibly help in reducing costs in some form. As of now, I don't think we should use this technique.
Publication: Time-Dependent SHARC-Routing
Probably only a good source of model considerations. The general speed-up seems too low in comparison to the preprocessing overhead. Might revisit later, after I have gained more insight.
Publication: Using Multi-level Graphs for Timetable Information in Railway Systems
It might benefit from better partitioning algorithms available now. I fear the complexity of combining connections might offer problems in a production setting. Requires re-visit when I have gained more insight into the problem.
Actual separators seem to be a useful tool to speed-up the connection scan algorithm. More information to follow on the Connection Scan comment.
Publication: Intriguingly Simple and Fast Transit Routing
Publication: Connection Scan Accelerated
Further speed up over already fast technique. Would potentially allow for all the speed we need.
This technique is a strong contender. While moving away from the graph model (on demand / taxi would possibly be impossible to incorporate), it provides one of the fastest exact algorithms.
Publication: Contraction of Timetable Networks with Realistic Transfers
~ 5
) over Dijkstras algorithm on smaller networks~ 70
) on longer rail networks.Probably not the way to go. Seems to offer not enough benefit in comparison to other techniques.
Publication: Fast Routing in Very Large Public Transportation Networks using Transfer Patterns
Precompute / Space overheads are large. Heuristics to keep it manageable without too large overheads. Might be something to revisit, but I'd expect the cost to bee too high in comparison to other algorithms like Raptor/Connection Scan.
Publication: Finding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm
Probably way to costly for what we require. Some optimisation techniques done might get useful.
Publication: https://www.microsoft.com/en-us/research/wp-content/uploads/2012/01/raptor_alenex.pdf
Could potentially be a component of our search. Depends on our scope (cities first?)
Publication: Public Transit Labelling
Multi criteria search seems way out of reach, although times might not update as often so we could possibly do with longer processing times. Updates to the network would become costly, though. Query times are incredibly fast, though. It might be possible to use parts of the approach for different steps? Keep in mind.
Publication: Trip-Based Public Transit Routing Using Condensed Search Trees
I find the model intriguing and feel that we can possibly use the ideas, whether we opt for the algorithm itself or not. Pre-processing would have to be kept in check, though.
No further actions. Can be accessed over research milestone.
This ticket is tracking an overview of available research in the algorithmic community.
Overview paper: Route Planning in Transportation Networks contains a lot of information on both car navigation and public transit routing.