Abstract
We describe and analyze empirically an implementation of some generalizations of Dijkstra’s algorithm for shortest paths in graphs. The implementation formed a part of the TRANSIMS project at the Los Alamos National Laboratory. Besides offering the first implementation of the shortest path algorithm with regular language constraints, our code also solves problems with time-dependent edge delays in a quite general first-in-first-out model.
We describe some details of our implementation and then analyze the behavior of the algorithm on real but extremely large transportation networks. Even though the questions we consider in our experiments are fundamental and natural, it appears that they have not been carefully examined before. A methodological contribution of the present work is theus e of formal statistical methods to analyzetheb ehaviour of our algorithms. Although the statistical methods employed are simple, they provide a possibly novel approach to the experimental analysis of algorithms.
Our results provide evidence for our claims of effciency of the algorithms described in a very practical setting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Barrett, K. Bisset, R. Jacob, G. Konjevod and M. Marathe Algorithms and models for routing and transportation problems in in time-dependent and labeled networks, in preparation, 2002.
C. Barrett, K. Birkbigler, L. Smith, V. Loose, R. Beckman, J. Davis, D. Roberts and M. Williams, An Operational Description of TRANSIMS, Technical Report, LA-UR-95-2393, Los Alamos National Laboratory, 1995.
C. Barrett, D. Cook, V. Faber, G. Hicks, A. Marathe, M. Marathe, A. Srinivasan, Y. J. Sussmann and H. Thornquist, Experimental analysis of algorithms for bilateral-contract clearing mechanisms arising in deregulated power industry, Proc. WAE 2001, pp. 172–184.
C. Barrett, R. Jacob, M. Marathe, Formal Language Constrained Path Problems in SIAM J. Computing, 30(3), pp. 809–837, June2001.
I. Chabini, Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time, Presented at 1997 Transportation Research Board Meeting.
B. Cherkassky, A. Goldberg and T. Radzik, Shortest Path algorithms: Theory and Experimental Evaluation, Mathematical Programming, Vol. 73, 1996, pp. 129–174.
R. Jacob, M. Marathe and K. Nagel, A Computational Study of Routing Algorithms for Realistic Transportation Networks, invited paper appears in ACM J. Experimental Algorithmics, 4, Article 6, 1999. http://www.jea.acm.org/1999/JacobRouting/ Preliminary version appeared in Proc. 2nd Workshop on Algorithmic Engineering, Saarbrucken,Germany, August 1998.
C. L. Barrett, M. Drozda, A. Marathe, and M. Marathe, Characterizing the interaction between routing and MAC protocols in ad-hoc networks, to appear in Proc. ACM MobiHoc 2002.
A. Mendelzon and P. Wood, Finding Regular Simple Paths in Graph Databases, SIAM J. Computing, vol. 24, No. 6, 1995, pp. 1235–1258.
A. Orda and R. Rom, Shortest Path and Minimum Delay Algorithms in Networks with Time Dependent Edge Lengths, J. ACM, Vol. 37, No. 3, 1990, pp. 607–625.
J. F. Romeuf, Shortest Path under Rational Constraint Information Processing Letters 28 (1988), pp. 245–248.
R. Sedgewick and J. Vitter Shortest Paths in Euclidean Graphs, Algorithmica, 1986, Vol. 1, No. 1, pp. 31–48.
K. Sung and M.G.H. Bell and M. Seong and S. Park, Shortest paths in a network with time-dependent flow speeds, European Journal of Operational Research 121 (1) (2000), pp. 32–39.
M. Yannakakis “Graph Theoretic Methods in Data Base Theory,” invited talk, Proc. 9th ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems (ACM-PODS), NashvilleTN, 1990, pp. 230–242.
A. Ziliaskopoulos and H. Mahmassani, Minimum Path Algorithms for Networks with General Time Dependent Arc Costs, Technical Report, December 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrett, C., Bisset, K., Jacob, R., Konjevod, G., Marathe, M. (2002). Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive