Online Computation of Fastest Path in Time-Dependent Spatial Networks

  • Ugur Demiryurek
  • Farnoush Banaei-Kashani
  • Cyrus Shahabi
  • Anand Ranganathan
Conference paper

DOI: 10.1007/978-3-642-22922-0_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6849)
Cite this paper as:
Demiryurek U., Banaei-Kashani F., Shahabi C., Ranganathan A. (2011) Online Computation of Fastest Path in Time-Dependent Spatial Networks. In: Pfoser D. et al. (eds) Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg

Abstract

The problem of point-to-point fastest path computation in static spatial networks is extensively studied with many precomputation techniques proposed to speed-up the computation. Most of the existing approaches make the simplifying assumption that travel-times of the network edges are constant. However, with real-world spatial networks the edge travel-times are time-dependent, where the arrival-time to an edge determines the actual travel-time on the edge. In this paper, we study the online computation of fastest path in time-dependent spatial networks and present a technique which speeds-up the path computation. We show that our fastest path computation based on a bidirectional time-dependent A* search significantly improves the computation time and storage complexity. With extensive experiments using real data-sets (including a variety of large spatial networks with real traffic data) we demonstrate the efficacy of our proposed techniques for online fastest path computation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ugur Demiryurek
    • 1
  • Farnoush Banaei-Kashani
    • 1
  • Cyrus Shahabi
    • 1
  • Anand Ranganathan
    • 2
  1. 1.Department of Computer ScienceUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.IBM T.J. Watson Research CenterHawthorneUSA

Personalised recommendations