Temporally Adaptive A* Algorithm on Time-Dependent Transportation Network

Conference paper
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)

Abstract

Traditional solutions to shortest path problems on time-varying transportation networks use traffic information only at precise moments regardless of considering the fact that the travel time through any link is dependent on the time entering that link. In this study, travel speed rather than travel time on each link is used as the time period dependent parameter to model time-dependent transportation networks, and a First-In-First-Out (FIFO) condition satisfied computational function of link travel time is then deduced based on kinematics. Finally, a temporally adaptive A* shortest path algorithm on this FIFO network is presented, where the time factor is introduced into the evaluation function, and the Euclidean distance divided by the maximum possible travel speed is used as a heuristic evaluator. An experiment on a real road network shows that the proposed algorithm is capable of foreseeing and bypassing forthcoming traffic congestion, at a cost only about 10% more in computational time than the traditional algorithm. In addition, frequent path reoptimization required with use of the traditional algorithm is effectively avoided.

Keywords

Travel Time Destination Node Travel Speed Short Path Problem Traffic Information 
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.

Notes

Acknowledgements

The work described in this paper was supported by the National Natural Science Foundation of China (40871184; 41001232), the China Postdoctoral Science Foundation (20090450563) and the National High Technology Research and Develop Program of China (2007AA12Z241).

References

  1. Chabini I, Lan S (2002) Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Trans Intell Transport Syst 3(1):60–74CrossRefGoogle Scholar
  2. Cho HJ, Lan CL (2009) Hybrid shortest path algorithm for vehicle navigation. J Supercomput 49(2):234–247CrossRefGoogle Scholar
  3. Fawcett J, Robinson P (2000) Adaptive routing for road traffic. IEEE Comput Graph Appl 20(3):46–53CrossRefGoogle Scholar
  4. Fu L, Sun D, Rilett LR (2006) Heuristic shortest path algorithms for transportation applications: state of the art. Comput Operat Res 33(11):3324–3343CrossRefGoogle Scholar
  5. Gao S, Lu F (2008) An arc-labeling shortest time path algorithm. Geo-Info Sci 10(5):604–610 (In Chinese)Google Scholar
  6. Hart EP, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern SSC-4(2):100–107CrossRefGoogle Scholar
  7. Horn M (2000) Efficient modelling of travel in networks with time-varying link speeds. Networks 36(2):80–90CrossRefGoogle Scholar
  8. Huang B, Wu Q, Zhan FB (2007) A shortest path algorithm with novel heuristics for dynamic transportation networks. Int J Geogr Info Sci 21(6):625–644CrossRefGoogle Scholar
  9. Ishikawa H (2005) Development of a local storage type traffic prediction for car navigation system. In: The 12th World Congress on intelligent transportation system, San FranciscoGoogle Scholar
  10. Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd international conference on data engineering (ICDE), AtlantaGoogle Scholar
  11. Kaufman DE, Smith RL (1993) Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS J 1:1–11Google Scholar
  12. Kim J, Jung S (2002) A dynamic window-based approximate shortest path re-computation method for digital road map databases in mobile environments. In: Shafazand MH, Tjoa AM (eds) EurAsia-ICT 2002, vol 2510, Lecture notes in computer science. Springer, Berlin/Heidelberg, pp 711–720Google Scholar
  13. Klunder GA, Post HN (2006) The shortest path problem on large-scale real-road networks. Networks 48(4):182–194CrossRefGoogle Scholar
  14. Lu F, Guan Y (2004) An optimum vehicular path solution with multi-heuristics. In: Bubak M et al (eds) ICCS 2004, vol 3039, Lecture notes in computer science. Springer, Berlin/Heidelberg, pp 964–971CrossRefGoogle Scholar
  15. Lu F, Lu D, Cui W (1999) Improved Dijkstra algorithm based on quad-heap priority queue and inverse adjacent list. J Image Graph 4A(12):1044–1050 (In Chinese)Google Scholar
  16. Sung K, Bell MGH, Seong M, Park S (2000) Shortest paths in a network with time-dependent flow speeds. Eur J Operat Res 121(1):32–39CrossRefGoogle Scholar
  17. Yamane K, Endo Y, Fujiwara J, Machii K (2004) Statistical traffic information for navigation system. In: The 11th World Congress on intelligent transportation system, Nagoya, AichiGoogle Scholar
  18. Zeng W, Church RL (2009) Finding shortest paths on real road networks: the case for A*. Int J Geogr Info Sci 23(4):531–543CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of Geographic Sciences and Natural Resources ResearchChinese Academy of SciencesBeijingChina
  2. 2.Beijing Institute of Satellite Information EngineeringBeijingChina

Personalised recommendations