Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
Ben Strasser, Dorothea Wagner, Tim Zeitz

TL;DR
This paper introduces CATCHUp, a novel routing algorithm for time-dependent road networks that offers fast preprocessing, small index size, and exact shortest path computation by storing paths instead of travel times.
Contribution
CATCHUp is the first algorithm to combine small index size, fast preprocessing, and exact routing in time-dependent networks by storing paths and deriving travel times lazily.
Findings
Up to 38 times smaller indexes than competitors
Faster preprocessing times
Competitive query response times
Abstract
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, for example, to avoid commuter traffic congestions. Existing techniques follow a two-phase approach: In a preprocessing step, an index is built. The index depends on the road network and the traffic patterns but not on the path start and end. The latter are the input of the query phase, in which shortest paths are computed. All existing techniques have large index size, slow query running times or may compute suboptimal paths. In this work, we introduce CATCHUp (Customizable Approximated Time-dependent Contraction Hierarchies through Unpacking), the first algorithm that simultaneously achieves all three objectives.The core idea of CATCHUp is to store paths instead of travel times at shortcuts. Shortcut travel…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
