Abstract
The Random Shortest Path Problem with the second moment criterion is discussed in this paper. After the formulation of the problem, exact algorithms, based on general concepts for solving the Multi-objective Shortest Path Problem, are described. Next, several approximate algorithms are proposed. It is shown that the complexity of the exact algorithms is exponential, while the complexity of the approximate algorithms is only polynomial. Computational results for the exact and approximate algorithms, which were performed on large graphs, are shown.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Englewood Cliffs (1993)
Alexopoulos, Ch.: State space partitioning methods for stochastic shortest path problems. Networks 30, 9–21 (1997)
Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16, 87–90 (1958)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge/ McGraw-Hill Book Company, Boston (1990)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)
Floyd, R.W.: Algorithm 97: Shortest path. Comm. ACM 5, 345 (1962)
Frederikson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16, 1004–1022 (1987)
Hansen, P.: Bicriterion path problems. In: Proc. 3rd Conf. Multiple Criteria Decision Making – Theory and Applications. Lecture Notes in Economics and Mathematical Systems, vol. 117, pp. 109–127. Springer, Heidelberg (1979)
Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24, 1–13 (1977)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their use in improved network optimization problems. Journal of the ACM 34, 596–615 (1987)
Moffat, A., Takaoka, T.: An all pairs shortest path algorithm with expected time O(n 2logn). SIAM J. Comput. 16, 1023–1031 (1987)
Murthy, I., Sakar, S.: A relaxation-based pruning technique for a class of stochastic shortest path problems. Transportation Science 30, 220–236 (1996)
Murthy, I., Sarkar, S.: Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function. European Journal of Operational Research 103, 209–229 (1997)
Skriver, A.J.V., Anderson, K.A.: A label correcting approach for solving bicriterion shortest-path problems. Computers & Operations Research 27, 507–524 (2000)
Tsaggouris, G., Zaroliagis, Ch.D.: Improved FPTAS for Multiobjective Shortest Paths with Applications. Technical report no. TR 20050703 (July 2005)
Tsaggouris, G., Zaroliagis, Ch.D.: Multiobjective Optization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications. Technical report no. TR 2006/03/01 (March 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Czekaj, J., Socha, L. (2009). Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem. In: Korytowski, A., Malanowski, K., Mitkowski, W., Szymkat, M. (eds) System Modeling and Optimization. CSMO 2007. IFIP Advances in Information and Communication Technology, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04802-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-04802-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04801-2
Online ISBN: 978-3-642-04802-9
eBook Packages: Computer ScienceComputer Science (R0)