Bidirectional A* search on time-dependent road networks

Networks

Volumn 59, Issue 2, 2012, Pages 240-251

  Nannicini, Giacomo ^a,c   Delling, Daniel ^b   Schultes, Dominik ^b   Liberti, Leo ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF KARLSRUHE   (Germany)

^c Mediamobile   (France)

Author keywords

goal directed search; road networks; shortest paths; time dependent networks

Indexed keywords

APPROXIMATION FACTOR; ARC COSTS; ARRIVAL TIME; BI-DIRECTIONAL SEARCH; COMPUTATIONAL RESULTS; DESTINATION NODES; DIJKSTRA'S ALGORITHMS; EFFICIENT ALGORITHM; GOAL DIRECTED; LOWER BOUNDS; ROAD NETWORK; ROUTE PLANNING; SEARCH ALGORITHMS; SHORTEST PATH; SHORTEST PATHS; SUBOPTIMAL SOLUTION; TIME-DEPENDENT; TIME-DEPENDENT NETWORKS;

APPROXIMATION ALGORITHMS; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

EID: 84856853965     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20438     Document Type: Article

References (35)

1. R. Ahuja, T. Magnanti, and, J. Orlin, Network flows: theory, algorithms, and applications, Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993.
2. H. Bast, S. Funke, P. Sanders, and, D. Schultes, Fast routing in road networks with transit nodes, Science 316 (2007), 566. (Pubitemid 46683135)
3. G. V. Batz, D. Delling, P. Sanders, and, C. Vetter, "Time-Dependent Contraction Hierarchies", Proc 11th Workshop Algorithm Eng Exp (ALENEX'09), SIAM, 2009, pp. 97-105.
4. R. Bauer, and, D. Delling, SHARC: Fast and robust unidirectional routing, ACM J Exp Algorithmics 14 (2009), 2.4.
5. L. Buriol, M. Resende, and, M. Thorup, Speeding up dynamic shortest path algorithms, INFORMS J Comput 20 (2008), 191-204.
6. I. Chabini, Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time, Transport Res Rec 1645 (1998), 170-175. (Pubitemid 128550908)
7. * algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks, IEEE Trans Intellnt Transport Syst 3 (2002), 60-74. (Pubitemid 135706833)
8. K. Cooke, and, E. Halsey, The shortest route through a network with time-dependent internodal transit times, J Math Anal Appl 14 (1966), 493-498.
9. C. Daganzo, Reversibility of time-dependent shortest path problem, Technical report (1998), Institute of Transportation Studies, University of California, UCB-ITS-RR-98-14, Berkeley.
10. D. Delling, Time-Dependent SHARC-Routing, Algorithmica 60 (2011), 60-94, Special Issue: European Symposium on Algorithms 2008.
11. D. Delling, and, G. Nannicini, "Bidirectional core-based routing in dynamic time-dependent road networks", Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 08), Lecture Notes in Computer Science, S.-H. Hong, H. Nagamochi, and, T. Fukunaga, (Editors), Vol. 5369, Springer, Berlin, 2008, pp. 813-824.
12. D. Delling, P. Sanders, D. Schultes, and, D. Wagner, "Engineering route planning algorithms", Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science, J. Lerner, D. Wagner, and, K. A. Zweig, (Editors), Vol. 5515, Springer, 2009, pp. 117-139.
13. D. Delling, and, D. Wagner, "Landmark-based routing in dynamic graphs", 6th Workshop on Experimental Algorithms, LNCS, C. Demetrescu, (Editor), Vol. 4525, Springer, New York, 2007, pp. 52-65.
14. D. Delling, and, D. Wagner, "Time-Dependent Route Planning", Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science, R. K. Ahuja, R. H. Möhring, and, C. Zaroliagis, (Editors), Vol. 5868, Springer, 2009, pp. 207-230.
15. E. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959), 269-271.
16. S. Dreyfus, An appraisal of some shortest-path algorithms, Operations Res 17 (1969), 395-412.
17. L. R. Ford, and, D. R. Fulkerson, Modern Heuristic Techniques for Combinatorial Problems, Princeton University Press, Princeton, NJ, 1962.
18. M. Fredman, and, R. Tarjan, Fibonacci heaps and their use in improved network optimization algorithms, J ACM 34 (1987), 596-615.
19. R. Geisberger, P. Sanders, D. Schultes, and, D. Delling, "Contraction Hierarchies: Faster and simpler hierarchical routing in road networks", Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), Lecture Notes in Computer Science, C. C. McGeoch, (Editor), Vol. 5038, Springer, 2008, pp. 319-333.
20. A. Goldberg, and, C. Harrelson, "Computing the shortest path: A* meets graph theory", Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), SIAM, Philadelphia, 2005, pp. 156-165. (Pubitemid 40851368)
21. *: Efficient point-to-point shortest path algorithms, Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 06), Lecture Notes in Computer Science, Springer, 2006, pp. 129-143. (Pubitemid 43774927)
22. A. Goldberg, and, R. Werneck, "Computing point-to-point shortest paths from external memory", Proceedings of the 7th Workshop on Algorithm Engineering and Experimentation (ALENEX 05), C. Demetrescu, R. Sedgewick, R. Tamassia, (Editors), SIAM, Philadelphia, 2005, pp. 26-40. (Pubitemid 43206496)
23. B. L. Golden, and, M. Ball, Shortest paths with Euclidean distances: An explanatory model, Networks 8 (1978), 297-314. (Pubitemid 9412220)
24. E. Hart, N. Nilsson, and, B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans Sys Sci Cybernetics SSC-4 (1968), 100-107.
25. T. Ikeda, M. Tsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, and, K. Mitoh, A fast algorithm for finding better routes by AI search techniques, Proc IEEE Vehicle Navigation and Information Systems Conference, 2004, pp. 291-296.
26. D. E. Kaufman, and, R. L. Smith, Fastest paths in time-dependent networks for intelligent vehicle-highway systems application, J Intell Transport Syst 1 (1993), 1-11.
27. B. S. Kerner, The physics of traffic, Springer, Berlin, 2004.
28. G. Nannicini, P. Baptiste, G. Barbier, D. Krob, and, L. Liberti, Fast paths in large-scale dynamic road networks, Comput Opt Appl 45 (2010), 143-158.
29. * search for time-dependent fast paths", Proceedings of the 8th Workshop on Experimental Algorithms (WEA 2008), Lecture Notes in Computer Science, C. McGeoch, (Editor), Vol. 5038, Springer, New York, 2008, pp. 334-346.
30. G. Nannicini, and, L. Liberti, Shortest paths on dynamic graphs, Int Trans Oper Res 15 (2008), 551-563.
31. A. Orda, and, R. Rom, Shortest-path and minimum delay algorithms in networks with time-dependent edge-length, J ACM 37 (1990), 607-625. (Pubitemid 20723071)
32. P. Sanders, and, D. Schultes, "Highway hierarchies hasten exact shortest path queries", 13th Annual European Symposium on Algorithms (ESA 2005), Lecture Notes in Computer Science, G. Stølting Brodal, S. Leonardi, (Editors), Vol. 3669, Springer, 2005, pp. 568-579. (Pubitemid 41491557)
33. P. Sanders, and, D. Schultes, "Dynamic highway-node routing", 6th Workshop on Experimental Algorithms, LNCS, C. Demetrescu, (Editor), Vol. 4525, Springer, New York, 2007, pp. 66-79. (Pubitemid 350259661)
34. R. Sedgewick, and, J. Vitter, Shortest paths in Euclidean graphs, Algorithmica 1 (1986), 31-48.
35. D. Wagner, T. Willhalm, and, C. Zaroliagis, Geometric containers for efficient shortest-path computation, ACM J Exp Algorithmics 10 (2005), 1-30.