A Computational Study of Routing Algorithms for Realistic Transportation Networks

ACM Journal of Experimental Algorithmics

Volumn 4, Issue , 1999, Pages 6-

  Jacob, Riko ^a   Marathe, Madhav ^b   Nagel, Kai ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Design and Analysis of Algorithms; Experimental Analysis; Network Design; Shortest Paths Algorithms; Transportation Planning

Indexed keywords

EID: 85007016157     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/347792.347814     Document Type: Article

References (25)

1. R. K. Ahuja, T.L. Magnanti and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. A. V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA, 1974.
3. C. Barrett, R. Jacob, and M. Marathe, “Formal language constrained path problems,” Proc. Scandinavian Workshop on Algorithmic Theory (SWAT 98), Stockholm, 1998.
4. C. Barrett, K. Birkbigler, L. Smith, V. Loose, R. Beckman, J. Davis, D. Roberts, and M. Williams, “An operational description of TRANSIMS,” Tech. Rep. LA-UR-95-2393, Los Alamos National Laboratory, 1995.
5. R. Beckman et al., “TRANSIMS-Release 1.0-The Dallas Fort Worth case study,” Tech. Rep. LA-UR-97-4502, Los Alamos National Laboratory, 1997.
6. B. Cherkassky, A. Goldberg, and T. Radzik, “Shortest-path algorithms: theory and experimental evaluation,” Mathematical Programming 73 (1996), 129-174.
7. F. Glover, R. Glover, and D. Klingman, “Computational study of an improved shortest-path algorithm,” Networks 14 (1985), 65-73.
8. R. Elliott and M. Lesk, “Route finding in street maps by computers and people,” Proc. National Conf. on Artificial Intelligence (AAAI 82), Pittsburgh (1982), 258-261.
9. P. Hart, N. Nilsson, and B. Raphel, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Trans. on System Science and Cybernetics 4, 2 (1968), 100-107.
10. Highway Research Board, Highway Capacity Manual, Special Report 209, National Research Council, Washington, D.C. 1994.
11. R. Jacob, C. Barrett, and M. Marathe, “Models and efficient algorithms for routing problems in time-dependent and labeled networks,” Tech. Rep. LA-UR-98, Los Alamos National Laboratory, 1998.
12. G. Konjevod, “Experimental analysis of routing algorithms in in time-dependent and labeled networks,” preprint (1998).
13. M. Luby and P. Ragde, “A bidirectional shortest-path algorithm with good average-case behavior,” Algorithmica 4 (1989), 551-567.
14. R. Hassin, “Approximation schemes for the restricted shortest-path problem,” Mathematics of Operations Research 17, 1 (1992), 36-42.
15. Y. Ma, “A shortest-path algorithm with expected running time O([formula omitted]),” MS Thesis, University of California, Berkeley.
16. J.F. Mondou, T.G. Crainic, and S. Nguyen, “Shortest-path algorithms: a computational study with C programming language,” Computers and Operations Research 18 (1991), 767-786.
17. B.M.E. Moret and H.D. Shapiro, “An empirical assessment of algorithms for constructing a minimum spanning tree,” DIMACS Monographs 15 (1994), 99-117.
18. K. Nagel and C. Barrett, “Using microsimulation feedback for trip adaptation for realistic traffic in Dallas,” Int’l J. Modern Physics C 8, 3 (1997), 505-525.
19. K. Nagel, “Experiences with iterated traffic microsimulations in Dallas,” in Traffic and Granular Flow II, D.E. Wolf and M. Schreckenberg, eds., Springer Verlag, 1998.
20. U. Pape, “Implementation and efficiency of the Moore algorithm for the shortest-root problem,” Mathematical Programming 7 (1974), 212-222.
21. S. Pallottino, “Shortest-path algorithms: complexity, interrelations and new propositions,” Networks 14 (1984), 257-267.
22. I. Pohl, “Bidirectional searching,” Machine Intelligence 6 (1971), 127-140.
23. R. Sedgewick and J. Vitter, “Shortest paths in Euclidean graphs,” Algorithmica 1, 1 (1986), 31-48.
24. T. Shibuya, T. Ikeda, H. Imai, S. Nishimura, H. Shimoura, and K. Tenmoku, “Finding realistic detour by AI search techniques,” Transportation Research Board Meeting, Washington D.C. 1997.
25. F.B. Zhan and C. Noon, “Shortest-path algorithms: an evaluation using real road networks,” Transportation Science 32, 1 (1998), 65-73.