Many-to-many Customizable Route Planning with Time-dependent Driving Restrictions

Abstract

We present a variant of Customizable Route Planning (CRP) that computes all shortest paths between source nodes s ∈ S and target nodes t ∈ T . Customizable Route Planning is a flexible routing algorithm that uses partitions to quickly calculate routes. It supports arbitrary metrics and can introduce a new metric fast. We also explored the feasibility of CRP in a time-dependent setting, where we take into account driving restrictions, i.e. roads are inaccessible during the night. By using a clever representation of time-dependent travel costs, we show that CRP can give exact results, taking into account driving restrictions, using little RAM and computing time.