An efficient implementation of an algorithm for finding K shortest simple paths

Networks

Volumn 34, Issue 2, 1999, Pages 88-101

  Hadjiconstantinou, E ^a   Christofides, N ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033196406     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1     Document Type: Article

References (62)

1. [1] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data structures and algorithms, Addison-Wesley, Reading, MA, 1983.
2. [2] R.K. Ahua, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan, Faster algorithms for the shortest path problem, J Assoc Comput Mach 37 (1990), 213-223.
3. [3] J.A. Azevedo, M.E.O. Santos Costa, J.J.E.R. Silvestre Madeira, and E.Q.V. Martins, An algorithm for the ranking of shortest paths, Eur J Oper Res 69 (1993), 97-106.
4. [4] R. Bellman and R. Kalaba, On kth best policies, J SIAM 8 (1960), 582-585.
5. [5] D.P. Bertsekas, A simple and fast label correcting algorithm for shortest paths, Networks 23 (1993), 703-709.
6. [6] P. Carraresi and C. Sodini, A binary enumeration tree to find K shortest paths. 7th Symp Operations Res, Methods of Operations Research, 1983, pp. 177-188.
7. [7] G.-H. Chen and Y.-C. Hung, Algorithms for the constrained quickest path problem and the enumeration of quickest paths, Comput Oper Res 21(2) (1994), 113-118.
8. [8] Y.L. Chen, An algorithm for finding the K quickest paths in a network, Comput Oper Res 20 (1993), 59-65.
9. [9] Y.L. Chen, Finding the K quickest simple paths in a network, Info Process Lett 50(2) (1994), 89-92.
10. [10] S. Clarke, A. Krikorian, and J. Rausen, Computing the N best loopless paths in a network, J SIAM 11 (1963), 1096-1102.
11. [11] N. Deo and C.Y. Pang, Shortest-path algorithms: Taxonomy and annotation, Networks 14 (1984), 275-323.
12. [12] E.W. Dijkstra, A note on two problems in connection with graphs, Num Math 1 (1959), 269-271.
13. [13] S.E. Dreyfus, An appraisal of some shortest path algorithms, Oper Res 17 (1969), 395-412.
14. [14] D. Eppstein, Finding the K shortest paths. Proc 35th IEEE Symp Foundations of Computer Science (FOCS'94), 1994, pp. 154-165.
15. [15] B.L. Fox, Calculating kth shortest paths, INFOR-Can J Oper Res 11 (1973), 66-70.
16. [16] B.L. Fox, Kth shortest paths and applications to the probabilistic networks, ORSA/TIMS Nat Mtg Bull Oper Res Soc Am 23 (1975), B263.
17. [17] B.L. Fox, Data structures and computer science techniques in operations research, Oper Res 26 (1978), 686-717.
18. [18] M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimisation algorithms, J Assoc Comput Mach 34 (1987), 596-615.
19. [19] M.L. Fredman and D.E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Proc. 31st IEEE Symp Foundations of Computer Science (FOCS'90), 1990, pp. 719-725.
20. [20] G. Gallo and S. Pallotino, Shortest path algorithms, FORTRAN codes for network optimisation, Ann Oper Res 13 (1988), 3-79.
21. [21] F. Glover and D. Klingman, New sharpness properties, algorithms and complexity bounds for partitioning shortest path procedures, Oper Res 37 (1989), 542-546.
22. [22] F. Glover, D. Klingman, and N. Philips, A new polynomially bounded shortest path algorithm, Oper Res 33 (1985), 65-73.
23. [23] D. Goldfarb, J. Hao, and S.R. Kai, Efficient shortest path simplex algorithms, Oper Res 38 (1990), 624-628.
24. [24] D. Goldfarb, J. Hao, and S.R. Kai, Shortest path algorithms using dynamic breadth-first search, Networks 21 (1991), 29-50.
25. [25] E. Hadjiconstantinou, N. Christofides, and A. Mingozzi, A new exact algorithm for the vehicle routing problem based on q-paths and K shortest paths relaxations, Ann Oper Res 61 (1995), 21-43.
26. [26] W. Hoffman and R. Pavley, A method for the solution of the Nth best path problem, J Assoc Commun Mach 6 (1959), 506-514.
27. [27] G.J. Horne, Finding the K least cost paths in an acyclic network, J Oper Res Soc 31 (1980), 443-448.
28. [28] M.S. Hung and J.J. Divoky, A computational study of efficient shortest paths algorithms, Comput Oper Res 15 (1988), 567-576.
29. [29] L.M. Jin and S.P. Chan, An electrical method for finding suboptimal routes, Proc IEEE Int Symp Circuits and Systems, Vol. 2, 1989, pp. 935-938.
30. [30] D.B. Johnson, Efficient algorithms for shortest paths in sparse networks, J Assoc Comput Mach 24 (1977), 1-13.
31. 2) algorithm for K shortest simple paths in an undirected graph with non-negative arc length, Trans Inst Elect Commun Eng Jpn E61 (1978), 971-972.
32. [32] N. Katoh, T. Ibaraki, and H. Mine, An efficient algorithm for K shortest simple paths. Networks 12 (1982), 411-427.
33. [33] N. Kumar and R.K. Ghosh, Parallel algorithm for finding first K shortest paths, Comput Sci Info 24 (1994), 21-28.
34. [34] E.L. Lawler. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem, Management Sci 18 (1972), 401-405.
35. [35] E.L. Lawler. Comment on computing the K shortest paths in a graph. Commun Assoc Comput Mach 20 (1977), 603-604.
36. [36] E.Q.V. Martins. An algorithm for ranking paths that may contain cycles, European J Operational Res 18 (1984), 123-130.
37. [37] E.Q.V. Martins and J.L.E. Santos. A new shortest paths ranking algorithm, University of Coimbra, Portugal, (1996).
38. [38] S.P. Miaou and S.M. Chin. Computing K shortest paths for nuclear spent fuel highway transportation, European J Operational Res 53, 1 (1991), 64-80.
39. [39] E. Minieka. On computing sets of shortest paths in a graph, Commun Assoc Comput Mach 17 (1974), 351-353.
40. [40] E. Minieka. The Kth shortest path problem, In ORSA/TIMS National Mtg, Bull Operations Res Soc America 23 (1975), B/116.
41. [41] E. Minieka and D.R. Shier. A note on an algebra for the K best routes in a network, J Inst Math Appl 11 (1973), 145-149.
42. [42] J.-F. Mondou, T.G. Crainic, and S. Nguyen, Shortest path algorithms: A computational study with the C programming language, Comput Oper Res 18 (1991), 767-786.
43. [43] U. Pape, ALGORITHM 562, Shortest-path lengths, Assoc Comput Mach Trans Math Software 6 (1980), 450-455.
44. [44] A. Perko, Implementation of algorithms for K shortest loopless paths, Networks 16 (1986), 149-160.
45. [45] J.B. Rosen, S.Z. Sun, and G.L. Xue, Algorithms for the quickest path problem and the enumeration of quickest paths, Comput Oper Res 18 (1991), 579-584.
46. [46] E. Ruppert, Finding the K shortest paths in parallel, Proc 14th Symp Theoretical Aspects of Computer Science (STACS'97), 1997, pp. 475-485.
47. [47] D.R. Shier, Computational experience with an algorithm for finding the K shortest paths in a network, J Res Natl Bur Stand Sect B 78 (1974), 139-165.
48. [48] D.R. Shier, Iterative methods for determining the K shortest paths in a network. Networks 6 (1976), 205-229.
49. [49] D.R. Shier, Algorithms for finding the K shortest paths in a network, ORSA/TIMS Joint Nat Mtg TIMS/ORSA Bull, (1976), 115.
50. [50] D.R. Shier, On algorithms for finding the K shortest paths in a network, Networks 9 (1979), 195-214.
51. [51] C.C. Skicsim and B.L. Golden, Computing K shortest path lengths in Euclidean networks, Networks 17 (1987), 341-352.
52. [52] C.C. Skicsim and B.L. Golden, Solving K shortest and constrained shortest path problems efficiently, Ann Oper Res 20 (1989), 249-282.
53. [53] K. Sugimoto and M. Katoh, An algorithm for finding K shortest loopless paths in a directed network, Trans Info Process Soc Jpn. 26 (1985), 356-364. (in Japanese).
54. [54] J.W. Suurballe, Disjoint paths in a network, Networks 4 (1974), 125-145.
55. [55] M. Thorup, Undirected single source shortest paths in linear time, Proc 38th IEEE Symp Foundations of Computer Science (FOCS'97), 1997, pp. 12-21.
56. [56] S. Tomizawa, An efficient algorithm for solving the shortest route problems, Trans Inst Elect Commun Eng Jpn J59-A (1976), 523-530.
57. [57] D. Van Vliet, Improved shortest path algorithms for transport networks, Trans Res 12 (1978), 7-20.
58. [58] M.M. Weigand, A new algorithm for the solution of the Kth best route problem, Computing 16 (1976), 139-151.
59. [59] C.P. Weston, Costing telecommunications services, PhD Thesis, Centre for Quantitative Finance, Imperial College, 1995.
60. [60] A. Wongseelashote, An algebra for determining all path-values in a network with applications to K shortest paths problems, Networks 6 (1976), 307-334.
61. [61] J.Y. Yen, Finding the K shortest loopless paths in a network, Mgmt Sci 17 (1971), 712-716.
62. [62] J.Y. Yen, Another algorithm for finding the K shortest loopless network paths, 41st Mtg Oper Res Soc of Am, Bull Oper Res Soc of Am 20 (1972), B/185.