Upload

Loading...

Fast Route Planning

20,344

Loading...

Loading...

Transcript

The interactive transcript could not be loaded.

Loading...

Loading...

Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Uploaded on Mar 27, 2009

Google Tech Talk
March 23, 2009

ABSTRACT

Presenters: Peter Sanders

I give an overview of our current and future work on route planning. Based on contraction hierarchies, a simple technique that allows fast routing by exploiting the hierarchy available in the network, I explain how this can be used for static routing in continent sized road networks in about 0.1 ms, as a basis for transit-node routing that is another two orders of magnitude faster, and for computing distance tables, yet another order of magnitude faster. The latter method has applications, e.g., in logistics optimizations. Perhaps more importantly, we now generalize our techniques to more general settings including turn penalties, traffic jams, mobile hardware, time-dependent edge weights, public transportation, and multicriteria optimization.

Loading...

When autoplay is enabled, a suggested video will automatically play next.

Up Next


to add this to Watch Later

Add to

Loading playlists...