Engineering Route Planning Algorithms

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-dependent routing, and flexible objective functions.

Partially supported by DFG grants SA 933/1-3, SA 933/5-1, WA 654/16-1 and the Future and Emerging Technologies Unit of EC (IST priority – 6th FP), under contract no. FP6-021235-2 (project ARRIVAL). A preliminary version of this paper has been published in [60]