, Volume 21, Issue 1, pp 1–32 | Cite as

Discovering historic traffic-tolerant paths in road networks



Historic traffic information is valuable in transportation analysis and planning, e.g., evaluating the reliability of routes for representative source-destination pairs. Also, it can be utilized to provide efficient and effective route-search services. In view of these applications, we propose the k traffic-tolerant paths (TTP) problem on road networks, which takes a source-destination pair and historic traffic information as input, and returns k paths that minimize the aggregate (historic) travel time. Unlike the shortest path problem, the TTP problem has a combinatorial search space that renders the optimal solution expensive to find. First, we propose an exact algorithm with effective pruning rules to reduce the search time. Second, we develop an anytime heuristic algorithm that makes ‘best-effort’ to find a low-cost solution within a given time limit. Extensive experiments on real and synthetic traffic data demonstrate the effectiveness of TTP and the efficiency of our proposed algorithms.


Road networks Road traffic 



Man Lung Yiu was supported by ICRG grant G-YN38 from the Hong Kong Polytechnic University. Kyriakos Mouratidis was supported by research grant 14-C220-SMU-004 from the Singapore Management University Office of Research under the Singapore Ministry of Education Academic Research Funding Tier 1 Grant.


  1. 1.
    9th DIMACS implementation challenge - shortest paths.
  2. 2.
    Caltrans Pems.
  3. 3.
  4. 4.
  5. 5.
    Highways agency network journey time and traffic flow data.
  6. 6.
    TomTom - at the heart of the journey.
  7. 7.
    Travel time reliability: making it there on time, all the time. (2006)
  8. 8.
    Abraham I, Delling D, Goldberg AV, Werneck RFF (2012) Hierarchical hub labelings for shortest paths. In: ESA, pp 24–35Google Scholar
  9. 9.
    Bast H, Funke S, Matijevic D, Sanders P, Schultes D (2007) In transit to constant time shortest-path queries in road networks. In: ALENEXGoogle Scholar
  10. 10.
    Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT PressGoogle Scholar
  11. 11.
    Demiryurek U, Kashani FB, Shahabi C, Ranganathan A (2011) Online computation of fastest path in time-dependent spatial networks. In: SSTD, pp 92–111Google Scholar
  12. 12.
    Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: Proceedings of the 7th International conference on experimental algorithms, WEA’08, pp 319–333Google Scholar
  13. 13.
    Gonzalez H, Han J, Li X, Myslinska M, Sondag JP (2007) Adaptive fastest path computation on a road network: a traffic mining approach. In: VLDB, pp 794–805Google Scholar
  14. 14.
    González MC, Hidalgo CA, Barabási AL (2008) Understanding individual human mobility patterns. Nature 453(7196):779–782CrossRefGoogle Scholar
  15. 15.
    Gutman R (2004) Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: ALENEX, pp 100–111Google Scholar
  16. 16.
    Hua M, Pei J (2010) Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT, pp 347–358Google Scholar
  17. 17.
    Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: ICDE, pp 10–10Google Scholar
  18. 18.
    Kriegel HP, Renz M, Schubert M (2010) Route skyline queries: a multi-preference path planning approach. In: ICDE, pp 261–272Google Scholar
  19. 19.
    Li PH, Yiu ML, Mouratidis K (2014) Historical traffic-tolerant paths in road networks. In: ACM GIS, to appearGoogle Scholar
  20. 20.
    Lomax T, Schrank D, Turner S, Margiotta R (2003) Selecting travel reliability measures. Texas Transp Inst MonographGoogle Scholar
  21. 21.
    Malviya N, Madden S, Bhattacharya A (2011) A continuous query system for dynamic route planning. In: ICDE, pp 792–803Google Scholar
  22. 22.
    Sanders P, Schultes D (2005) Highway hierarchies hasten exact shortest path queries. In: ESA, pp 568–579Google Scholar
  23. 23.
    Sankaranarayanan J, Samet H (2010) Query processing using distance oracles for spatial networks. IEEE Trans Knowl Data Eng 22(8):1158–1175CrossRefGoogle Scholar
  24. 24.
    Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. PVLDB 2(1):1210–1221Google Scholar
  25. 25.
    Song C, Qu Z, Blumm N, Barabási AL (2010) Limits of predictability in human mobility. Science 327(5968):1018–1021CrossRefGoogle Scholar
  26. 26.
    Yen JY (1971) Finding the K shortest loopless paths in a network. Manag Sci 17(11):712–716CrossRefGoogle Scholar
  27. 27.
    Zhu AD, Ma H, Xiao X, Luo S, Tang Y, Zhou S (2013) Shortest path and distance queries on road networks: towards bridging theory and practice. In: SIGMOD, pp 857–868Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Pui Hang Li
    • 1
  • Man Lung Yiu
    • 1
  • Kyriakos Mouratidis
    • 2
  1. 1.Department of ComputingThe Hong Kong Polytechnic UniversityHong KongHong Kong
  2. 2.School of Information SystemsSingapore Management UniversitySingaporeSingapore

Personalised recommendations