SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Core Routing on Dynamic Time-Dependent Road Networks
INFORMS Journal on Computing
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
Time-dependent route planning with generalized objective functions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Efficient route compression for hybrid route planning
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Context-aware modelling of continuous location-dependent queries in indoor environments
Journal of Ambient Intelligence and Smart Environments - Context Awareness
Hi-index | 0.00 |
In recent years, many speed-up techniques for Dijkstra’s algorithm have been developed that make the computation of shortest paths in static road networks a matter of microseconds. However, only few of those techniques work in time-dependent networks which, unfortunately, appear quite frequently in reality: Roads are predictably congested by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an efficient time-dependent route planning algorithm. It is based on our recently introduced SHARC algorithm, which we adapt by augmenting its basic ingredients such that correctness can still be guaranteed in a time-dependent scenario. As a result, we are able to efficiently compute exact shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways. It should be noted that time-dependent SHARC was the first efficient algorithm for time-dependent route planning.