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.
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks. Networks 44 (August 2004)
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)
Hall, R.: The fastest path through a network with random time-dependent travel times. Transportation Science 20, 182–188 (1986)
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)
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)
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)
Miller-Hooks, E., Mahmassani, H.S.: Least possible time paths in stochastic time-varying networks. Computers and Operations Research 25(12), 1107–1125 (1998)
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)
Pallottino, S., Scuttella, M.G.: Shortest path algorithms in tranportation models: Classical and innovative aspects. Equilibrium and Advanced transportation Modelling (Kluwer), 245–281 (1998)
Shekhar, S., Chawla, S.: Spatial Databases: Tour. Prentice-Hall, Englewood Cliffs (2003)
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)
Sawitzki, D.: Implicit Maximization of Flows over Time. Technical report, University of Dortmund (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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: Roddick, J.F., 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)