Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Generating time dependencies in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Contraction of timetable networks with realistic transfers
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Distributed time-dependent contraction hierarchies
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
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
Hi-index | 0.00 |
Time-dependent Contraction Hierarchies provide fast and exact route planning for time-dependent large scale road networks but need lots of space. We solve this problem by the careful use of approximations of piecewise linear functions. This way we need about an order of magnitude less space while preserving exactness and accepting only a little slow down. Moreover, we use these approximations to compute an exact travel time profile for an entire day very efficiently. In a German road network, e.g., we compute exact time-dependent routes in less than 2 ms. Exact travel time profiles need about 33 ms and about 3 ms suffice for an inexact travel time profile that is just 1 % away from the exact result. In particular, time-dependent routing and travel time profiles are now within easy reach of web servers with massive request traffic.