Time-dependent route planning with generalized objective functions

Authors:
Gernot Veit Batz;Peter Sanders
Affiliations:
Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany;Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 12
Cited 1

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Time-Dependent Route Planning

Robust and Online Large-Scale Optimization
Multiobjective A* search with consistent heuristics

Journal of the ACM (JACM)
Contraction hierarchies: faster and simpler hierarchical routing in road networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Time-Dependent SHARC-Routing

Algorithmica - Special Issue: European Symposium on Algorithms
A hub-based labeling algorithm for shortest paths in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Space-efficient SHARC-routing

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
Time-dependent contraction hierarchies and approximation

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On the complexity of time-dependent shortest paths

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact Routing in Large Road Networks Using Contraction Hierarchies

Transportation Science

Efficient route compression for hybrid route planning

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding routes in road networks that optimize a combination of travel time and additional time-invariant costs. These could be an approximation of energy consumption, distance, tolls, or other penalties. The resulting problem is NP-hard, but if the additional cost is proportional to driving distance we can solve it optimally on the German road network within 2.3 s using a multi-label A* search. A generalization of time-dependent contraction hierarchies to the problem yields approximations with negligible errors using running times below 5 ms which makes the model feasible for high-throughput web services. By introducing tolls we get considerably harder instances, but still we have running times below 41 ms and very small errors.