Generating Time Dependencies in Road Networks

  • Sascha Meinert
  • Dorothea Wagner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6630)


In the last decade major progress has been made in accelerating shortest path queries in large-scale, time-dependent road networks. Most techniques are heuristically motivated and their performance is experimentally evaluated on real-world data. However, to our knowledge no free time-dependent dataset is available to researchers.

This is the first work proposing algorithmic approaches for generating time-dependent road networks that are built on top of static road networks in the scenario of systematic delays. Based on an analysis of a commercial, confidential time-dependent dataset we have access to, we develop algorithms that utilize either road categories or coordinates to enrich a given static road network with artificial time-dependent data. Thus, the static road-networks we operate on may originate from manifold sources like commercial, open source or artificial data. In our experimental study we assess the usefulness of our algorithms by comparing global as well as local statistical properties and the shortest-path structure of generated datasets and a commercially used time-dependent dataset. Until now, evaluations of time-dependent routing algorithms were based on artificial data created by ad-hoc random procedure. Our work enables researchers to conduct more reasonable validations of their algorithms than it was possible up to now.


Road Network Urban Region Boundary Node Urban Catchment Road Category 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Flötteröd, G.: Traffic State Estimation with Multi-Agent Simulations. PhD thesis, Technische Universität Berlin (2008)Google Scholar
  2. 2.
    Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (July 2009); Special Issue: European Symposium on Algorithms 2008Google Scholar
  3. 3.
    Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search for Time-Dependent Fast Paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 334–346. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-Dependent Contraction Hierarchies and Approximation. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 166–177. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117–139. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Delling, D., Wagner, D.: Time-Dependent Route Planning. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207–230. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Kerner, B.S.: The Physics of Traffic. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Bar-Gera, H.: Traffic assignment by paired alternative segments. Transportation Research Part B: Methodological 44(8-9), 1022–1046 (2010)CrossRefGoogle Scholar
  9. 9.
    Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol. 74. AMS, Providence (2009)zbMATHGoogle Scholar
  10. 10.
    Lloyd, S.: Least squares quantization in pcm. IEEE Transactions on Information Theory 28(2), 129–137 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Bauer, R., Krug, M., Meinert, S., Wagner, D.: Synthetic Road Networks. In: Chen, B. (ed.) AAIM 2010. LNCS, vol. 6124, pp. 46–57. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sascha Meinert
    • 1
  • Dorothea Wagner
    • 1
  1. 1.Karlsruhe Institute of Technology (KIT)KarlsruheGermany

Personalised recommendations