Skip to main content

Time-Aggregated Graphs for Modeling Spatio-temporal Networks

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNCS,volume 4231)

Abstract

Given applications such as location based services and the spatio-temporal queries they may pose on a spatial network (eg. road networks), the goal is to develop a simple and expressive model that honors the time dependence of the road network. The model must support the design of efficient algorithms for computing the frequent queries on the network. This problem is challenging due to potentially conflicting requirements of model simplicity and support for efficient algorithms. Time expanded networks which have been used to model dynamic networks employ replication of the network across time instants, resulting in high storage overhead and algorithms that are computationally expensive. In contrast, the proposed time-aggregated graphs do not replicate nodes and edges across time; rather they allow the properties of edges and nodes to be modeled as a time series. Since the model does not replicate the entire graph for every instant of time, it uses less memory and the algorithms for common operations (e.g. connectivity, shortest path) are computationally more efficient than the time expanded networks.

Keywords

  • Time-aggregated graphs
  • shortest paths
  • spatio-temporal data-bases
  • location based services

This work was supported by the NSF/SEI grant 0431141, Oak Ridge National Laboratory grant and US Army Corps of Engineers (Topographic Engineering Center) grant. The content does not necessarily reflect the position or policy of the government and no official endorsement should be inferred.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11908883_12
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47704-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks. Networks 44 (August 2004)

    Google Scholar 

  2. Ding, Z., Guting, R.H.: Modeling temporally variable transportation networks. In: Proc. 16th Intl. Conf. on Database Systems for Advanced Applications, pp. 154–168 (2004)

    Google Scholar 

  3. Hall, R.: The fastest path through a network with random time-dependent travel times. Transportation Science 20, 182–188 (1986)

    CrossRef  Google Scholar 

  4. Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent vehicle highway systems applications. IVHS Journal 1(1), 1–11 (1993)

    Google Scholar 

  5. Kohler, E., Langtau, K., Skutella, M.: Time-expanded graphs for flow-dependent transit times. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 599–611. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  6. Lu, Q., George, B., Shekhar, S.: Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 291–307. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  7. Miller-Hooks, E., Mahmassani, H.S.: Least possible time paths in stochastic time-varying networks. Computers and Operations Research 25(12), 1107–1125 (1998)

    MATH  CrossRef  Google Scholar 

  8. Miller-Hooks, E., Mahmassani, H.S.: Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. European Journal of Operational Research 146, 67–82 (2003)

    MATH  CrossRef  MathSciNet  Google Scholar 

  9. Pallottino, S., Scuttella, M.G.: Shortest path algorithms in tranportation models: Classical and innovative aspects. Equilibrium and Advanced transportation Modelling (Kluwer), 245–281 (1998)

    Google Scholar 

  10. Shekhar, S., Chawla, S.: Spatial Databases: Tour. Prentice-Hall, Englewood Cliffs (2003)

    Google Scholar 

  11. Shekhar, S., Chawla, S., Vatsavai, R., Ma, X., Yoo, J.S.: Location Based Services. In: Schiller, J., Voisard, A. (eds.) Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  12. Sawitzki, D.: Implicit Maximization of Flows over Time. Technical report, University of Dortmund (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

George, B., Shekhar, S. (2006). Time-Aggregated Graphs for Modeling Spatio-temporal Networks. In: , et al. Advances in Conceptual Modeling - Theory and Practice. ER 2006. Lecture Notes in Computer Science, vol 4231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908883_12

Download citation

  • DOI: https://doi.org/10.1007/11908883_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47703-7

  • Online ISBN: 978-3-540-47704-4

  • eBook Packages: Computer ScienceComputer Science (R0)