前K条最短路径算法

[注：为了简便我这里只列出算法的步骤和伪代码，详细的数学证明请参见相关论文。C++代码的算法实现可以在我的sourceforge目录https://sourceforge.net/projects/ksp 下载使用。特别要指出的是葡萄牙教授Martins对此算法有深入研究，发表了为数众多的相关论文，我这里采用的也是基于他早期提出的deletion algorithm。Martins的Fortran代码可以在这个网站http://www.mat.uc.pt/~eqvm/ 下载，同时这个网站还提供大量相关论文和文献。在此我谨向Martins教授致以敬意。]

前 k 条最短路径算法

戴维编译

一、算法说明

 Deletion Algorithm 删除算法的核心是通过在有向图中已有的最短路径上删除某条弧，并寻找替换的弧来寻找下一条可选的最短路径。删除算法实际上是通过在有向图中增加附加节点和相应的弧来实现的。算法描述如下：

 

1． 利用 Dijkstra 算法求得有向图 (N,A) 中以开始节点 s 为根的最短路径树（注意，这里的最短路径树并不是最小生成树，因为 Dijkstra 算法并不保证能生成最小生成树），标记从开始节点 s 到结束节点 t 之间的最短路径为 p_k ， k=1 。

2． 如果 k小于要求的最短路径的最大数目K，并且仍然有候选路径存在， 令当前路径 p=p_k ， 转3。否则，程序结束。

3． 找出当前路径 p 中从第一个节点开始的入度大于 1 的第一个节点，记为 n_h 。如果 n_h 的扩展节点 n^’ _h 不在节点集 N 中，则转 4 ，否则找出路径 p 中 n_h 后面所有节点中，其对应的扩展节点不在 N 中的第一个节点，记为 n_i ，转 5 。

4．为节点 n_h 构建一个扩展节点 n^’ _h ，并把其添加到集合 N 中，同时从图 (N,A) 中所有 n_h 的前驱节点 连接一条到 n^’ _h 的弧，弧对应的权重不变，添加这些弧到弧集 A 中，但 n_h 在 p 中的前一个节点 n_h-1 除外。计算从开始节点 s 到 n^’ _h 的最短路径，并记 n_i ＝ n_h+1 。

5． 对于 p 中从 n_i 开始的所有后续节点，不妨记为 n_j ，依次执行如下操作：

5.1 添加 n_j 的扩展节点 n^’ _j 到节点集合 N 中。

5.2 除了路径 p 中 n_j 的前一个节点 n_j-1 外，分别连接一条从 n_j 前驱节点到其扩展节点 n^’ _j 的弧，弧上的权值保持不变，并把这些弧添加到弧集 A 中。另外，如果 p 中 n_j 的前一个节点 n_j-1 具有扩展节点 n^’ _j-1 的话，也需要连接一条从 n^’ _j-1 到 n^’ _j 的弧，权值和弧 (n_j-1 , n_j ) 的权值相等。

5.3 计算从开始节点 s 到 n^’ _j 的最短路径。

6． 更新当前最短路径树，求得从开始节点 s 到结束节点的当前扩展节点 t^(k)’ 之间的最短路径为第 k 条最短路径，令 k=k+1 ，转 2 继续。

 

在上述步骤 4 、 5 、 6 中均需要计算从开始节点到当前扩展节点的最短路径，因为程序开始时便生成了以开始节点为根的最短路径树，那么只要在扩充节点时，记录下每个新节点相对于开始节点的最短路径中其前一个节点编号以及从开始节点到当前节点的最短路径长度，就可以很容易求得任意时刻有向图中从开始节点到结束节点（或其扩充节点）之间的最短路径。  

        扩展节点 ：上一条最短路径上的节点可能会在求取下一条最短路径的过程中进行扩展 ，也就是在上次节点集合的基础上增加相应的新节点，这些新的节点均称为扩展节点，其会继承被扩展结点的邻接边关系（具体请参见上述步骤4，5）。一个扩展节点仍然可能会在求取下一条最短路径的时候进行扩展，表现在示例图中就是在一个节点标记后面加一撇表示是在原始节点上扩展，加两撇表示是在上次扩展节点上再扩展，依次类推。
        前驱节点 ：就是最短路径中某个节点的前一个节点。

 

二、算法示例
  下面以图 1 所示网络图为例，根据上述算法，分别求得其第 k 条最短路径，求解过程中有向图的变化情况如图 1 － 5 所示，粗体路径表示当前状态下的最短路径，不同类型的圈表示不同阶段生成的节点 。

 

 

 

 

图1  k=1时的最短路径

 

 

图2  k=2时的最短路径

 

图3  k=3时的最短路径

 

图4  k=4时的最短路径

 

图5  k=5时的最短路径

 

 

 

 

 

   参考文献：[这个算法在70年代就提出来了，其间历经完善，发表的论文也是五花八门，为了能让初次接触此算法的人有个系统的认识，我这里列举了这个算法在近10多年发展过程中几篇有代表性的论文。]

1. J.A. Azevedo, J.J.E.R.S. Madeira, E.Q.V. Martins and F.M.A. Pires, A shortest paths ranking algorithm, (1990), Proceedings of the Annual Conference AIRO'90, Models and Methods for Decision Support, Operational Research Society of Italy, 1001-1011.

90这篇论文阐述了基于删除算法(deletion algorithm)的原理及方法，并指出了解决此类问题的三类算法，对其中删除算法以及基于最优化原理(Principle of Optimality)的算法进行了实验比较。

2. E.Q.V. Martins and J.L.E. Santos. A new shortest paths ranking algorithm. Investigacao Operacional, 20:(1):47-62,2000.

Martins在他99年这篇文章中对删除算法进行了改进，提出了MS Algorithm，实际上除了数据结构上的变化外，算法没有做实质性的改动。不过对于要从实现上来优化算法的人来说，当然是值得一看的。

3. E.Q.V. Martins. A new improvement for a k shortest paths algorithm. 2000。（忘了出处了，不好意思）

Martins随后又在他的这篇论文中改进了MS Algorithm，并依次详细列举了对早期的删除算法的逐步改进过程，所以这篇文章也是值得一读的。同样，这次改进也是从数据结构角度来改进算法效率的。

4.  Victor M. Jimenez and Andres Marzal. Computing the k shortest paths: A new algorithm and a experimental comparison. 1999. （忘了出处了，不好意思）

终于在这篇文章中有人提出了新的算法--递归枚举算法(REA, Recursive Enumeration Algorithm)。论文中分别对新的算法和Martins的算法MSA以及另外一个叫做Eppstein的人的算法(EA)进行了详细的实验比较。我之所以选择Martins的算法也是因为这篇文章对这些算法的对比实验表明，MSA算法在节点小于2000的情况下表现不错，加之MSA简明易懂并且处在不停的完善中:)。

 下面是其他相关的论文，好多哦，不过还是建议你访问Martins教授的网站。

Copyright@戴维 2006.5  于北京

相关论文：
[1] A. Aggarwal, B. Schieber, and T. Tokuyama. Finding a minimum weight K-link path in graphs
with Monge property and applications. Proc. 9th Symp. Computational Geometry, pp. 189–197.
Assoc. for Computing Machinery, 1993.
[2] R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan. Faster algorithms for the shortest path
problem. J. Assoc. Comput. Mach. 37:213–223. Assoc. for Computing Machinery, 1990.
[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. Operational Research 69:97–106, 1993.
[4] A. Bako. All paths in an activity network. Mathematische Operationsforschung und Statistik
7:851–858, 1976.
[5] A. Bako and P. Kas. Determining the k-th shortest path by matrix method. Szigma 10:61–66,
1977. In Hungarian.
[6] R. E. Bellman. On a routing problem. Quart. Appl. Math. 16:87–90, 1958.
[7] A.W. Brander and M. C. Sinclair. A comparative study of k-shortest path algorithms. Proc. 11th
UK Performance Engineering Worksh. for Computer and Telecommunications Systems, September
1995.
[8] T. H. Byers and M. S.Waterman. Determining all optimal and near-optimal solutions when solving
shortest path problems by dynamic programming. Operations Research 32:1381–1384, 1984.
[9] P. Carraresi and C. Sodini. A binary enumeration tree to find K shortest paths. Proc. 7th
Symp. Operations Research, pp. 177–188. Athen¨aum/Hain/Hanstein, Methods of Operations Research
45, 1983.
[10] G.-H. Chen and Y.-C. Hung. Algorithms for the constrained quickest path problem and the enumeration
of quickest paths. Computers and Operations Research 21:113–118, 1994.
[11] Y. L. Chen. An algorithm for finding the k quickest paths in a network. Computers and Operations
Research 20:59–65, 1993.
[12] Y. L. Chen. Finding the k quickest simple paths in a network. Information Processing Letters
50:89–92, 1994.
[13] E. I. Chong, S. R. Maddila, and S. T. Morley. On finding single-source single-destination k shortest
paths. Proc. 7th Int. Conf. Computing and Information, July 1995. http://phoenix.trentu.ca/
jci/papers/icci95/A206/P001.html.
[14] A. Consiglio and A. Pecorella. Using simulated annealing to solve the K-shortest path problem.
Proc. Conf. Italian Assoc. Operations Research, September 1995.
[15] Y. Dai, H. Imai, K. Iwano, and N. Katoh. How to treat delete requests in semi-online problems.
Proc. 4th Int. Symp. Algorithms and Computation, pp. 48–57. Springer Verlag, Lecture Notes in
Computer Science 762, 1993.
[16] M. T. Dickerson and D. Eppstein. Algorithms for proximity problems in higher dimensions. Computational
Geometry Theory and Applications 5:277–291, 1996.
[17] S. E. Dreyfus. An appraisal of some shortest path algorithms. Operations Research 17:395–412,
1969.
[18] El-Amin and Al-Ghamdi. An expert system for transmission line route selection. Int. Power
Engineering Conf, vol. 2, pp. 697–702. Nanyang Technol. Univ, Singapore, 1993.
[19] D. Eppstein. Finding common ancestors and disjoint paths in DAGs. Tech. Rep. 95-52, Univ. of
California, Irvine, Dept. Information and Computer Science, 1995.
[20] D. Eppstein. Ten algorithms for Egyptian fractions. Mathematica in Education and Research
4(2):5–15, 1995. http://www.ics.uci.edu/»eppstein/numth/egypt/ .
[21] D. Eppstein, Z. Galil, and G. F. Italiano. Improved sparsification. Tech. Rep. 93-20, Univ. of
California, Irvine, Dept. Information and Computer Science, 1993. http://www.ics.uci.edu:80/
TR/UCI:ICS-TR-93-20.
[22] D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification – A technique for speeding
up dynamic graph algorithms. Proc. 33rd Symp. Foundations of Computer Science, pp. 60–
69. IEEE, 1992.
[23] L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ,
1962.
23
[24] B. L. Fox. k-th shortest paths and applications to the probabilistic networks. ORSA/TIMS Joint
National Mtg., vol. 23, p. B263, 1975.
[25] G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest
spanning trees. Proc. 32nd Symp. Foundations of Computer Science, pp. 632–641. IEEE, 1991.
[26] G. N. Frederickson. An optimal algorithm for selection in a min-heap. Information and Computation
104:197–214, 1993.
[27] M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization
algorithms. J. Assoc. Comput. Mach. 34:596–615. Assoc. for Computing Machinery, 1987.
[28] M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees
and shortest paths. Proc. 31st Symp. Foundations of Computer Science, pp. 719–725. IEEE, 1990.
[29] A. V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM J. Computing
24(3):494–504. Soc. Industrial and Applied Math., June 1995.
[30] V. Hatzivassiloglou and K. Knight. Unification-based glossing. Proc. 14th Int. Joint Conf.
Artificial Intelligence, pp. 1382–1389. Morgan-Kaufmann, August 1995. http://www.isi.edu/
natural-language/mt/ijcai95-glosser.ps.
[31] G. J. Horne. Finding the K least cost paths in an acyclic activity network. J. Operational Research
Soc. 31:443–448, 1980.
[32] L.-M. Jin and S.-P. Chan. An electrical method for finding suboptimal routes. Int. Symp. Circuits
and Systems, vol. 2, pp. 935–938. IEEE, 1989.
[33] D. B. Johnson. A priority queue in which initialization and queue operations take O.log log D/
time. Mathematical Systems Theory 15:295–309, 1982.
[34] N. Katoh, T. Ibaraki, and H. Mine. An O.Kn2/ algorithm for K shortest simple paths in an undirected
graph with nonnegative arc length. Trans. Inst. Electronics and Communication Engineers
of Japan E61:971–972, 1978.
[35] N. Katoh, T. Ibaraki, and H. Mine. An efficient algorithm for K shortest simple paths. Networks
12(4):411–427, 1982.
[36] P. N. Klein, S. Rao, M. H. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar
graphs. Proc. 26th Symp. Theory of Computing, pp. 27–37. Assoc. for Computing Machinery,
1994.
[37] N. Kumar and R. K. Ghosh. Parallel algorithm for finding first K shortest paths. Computer
Science and Informatics 24(3):21–28, September 1994.
[38] A. G. Law and A. Rezazadeh. Computing the K-shortest paths, under nonnegative weighting.
Proc. 22nd Manitoba Conf. Numerical Mathematics and Computing, pp. 277–280, Congr. Numer.
92, 1993.
[39] E. L. Lawler. A procedure for computing the K best solutions to discrete optimization problems
and its application to the shortest path problem. Management Science 18:401–405, 1972.
24
[40] E. L. Lawler. Comment on computing the k shortest paths in a graph. Commun. Assoc. Comput.
Mach. 20:603–604. Assoc. for Computing Machinery, 1977.
[41] E. Q. V. Martins. An algorithm for ranking paths that may contain cycles. Eur. J. Operational
Research 18(1):123–130, 1984.
[42] S.-P. Miaou and S.-M. Chin. Computing k-shortest path for nuclear spent fuel highway transportation.
Eur. J. Operational Research 53:64–80, 1991.
[43] E. Minieka. On computing sets of shortest paths in a graph. Commun. Assoc. Comput. Mach.
17:351–353. Assoc. for Computing Machinery, 1974.
[44] E. Minieka. The K-th shortest path problem. ORSA/TIMS Joint National Mtg., vol. 23, p. B/116,
1975.
[45] E. Minieka and D. R. Shier. A note on an algebra for the k best routes in a network. J. Inst.
Mathematics and Its Applications 11:145–149, 1973.
[46] D. Naor and D. Brutlag. On near-optimal alignments of biological sequences. J. Computational
Biology 1(4):349–366, 1994. http://cmgm.stanford.edu/»brutlag/Publications/naor94.html .
[47] A. Perko. Implementation of algorithms for K shortest loopless paths. Networks 16:149–160,
1986.
[48] Y. Perl and Y. Shiloach. Finding two disjoint paths between two pairs of vertices in a graph. J.
Assoc. Comput. Mach. 25:1–9. Assoc. for Computing Machinery, 1978.
[49] J. B. Rosen, S.-Z. Sun, and G.-L. Xue. Algorithms for the quickest path problem and the enumeration
of quickest paths. Computers and Operations Research 18:579–584, 1991.
[50] E. Ruppert. Finding the k shortest paths in parallel. Proc. 14th Symp. Theoretical Aspects of
Computer Science, February 1997.
[51] T. Shibuya. Finding the k shortest paths by AI search techniques. Cooperative Research Reports
in Modeling and Algorithms 7(77):212–222. Inst. of Statical Mathematics, March 1995.
[52] T. Shibuya, T. Ikeda, H. Imai, S. Nishimura, H. Shimoura, and K. Tenmoku. Finding a realistic
detour by AI search techniques. Proc. 2nd Intelligent Transportation Systems, vol. 4, pp. 2037–
2044, November 1995. http://naomi.is.s.u-tokyo.ac.jp/papers/navigation/suboptimal-routes/
ITS%95/its.ps.gz.
[53] T. Shibuya and H. Imai. Enumerating suboptimal alignments of multiple biological sequences
efficiently. Proc. 2nd Pacific Symp. Biocomputing, pp. 409–420, January 1997. http://www-smi .
stanford.edu/people/altman/psb97/shibuya.pdf.
[54] T. Shibuya and H. Imai. New flexible approaches for multiple sequence alignment. Proc. 1st
Int. Conf. Computational Molecular Biology, pp. 267–276. Assoc. for Computing Machinery,
January 1997. http://naomi.is.s.u-tokyo.ac.jp/papers/genome/recomb97.ps.gz .
[55] T. Shibuya, H. Imai, S. Nishimura, H. Shimoura, and K. Tenmoku. Detour queries in geographical
databases for navigation and related algorithm animations. Proc. Int. Symp. Cooperative
Database Systems for Advanced Applications, vol. 2, pp. 333–340, December 1996. http:
//naomi.is.s.u-tokyo.ac.jp/papers/databases/codas96.ps.gz.
25
[56] D. R. Shier. Algorithms for finding the k shortest paths in a network. ORSA/TIMS Joint National
Mtg., p. 115, 1976.
[57] D. R. Shier. Iterative methods for determining the k shortest paths in a network. Networks
6(3):205–229, 1976.
[58] D. R. Shier. On algorithms for finding the k shortest paths in a network. Networks 9(3):195–214,
1979.
[59] C. C. Skicism and B. L. Golden. Solving k-shortest and constrained shortest path problems ef-
ficiently. Network Optimization and Applications, pp. 249–282. Baltzer Science Publishers, Annals
of Operations Research 20, 1989.
[60] K. Sugimoto and N. Katoh. An algorithm for finding k shortest loopless paths in a directed network.
Trans. Information Processing Soc. Japan 26:356–364, 1985. In Japanese.
[61] J. W. Suurballe. Disjoint paths in a network. Networks 4:125–145, 1974.
[62] R. E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series
in Applied Mathematics 44. Soc. Industrial and Applied Math., 1983.
[63] R. Thumer. A method for selecting the shortest path of a network. Zeitschrift f¨ur Operations
Research, Serie B (Praxis) 19:B149–153, 1975. In German.
[64] M. S. Waterman. Sequence alignments in the neighborhood of the optimum. Proc. Natl. Acad.
Sci. USA 80:3123–3124, 1983.
[65] M. M. Weigand. A new algorithm for the solution of the k-th best route problem. Computing
16:139–151, 1976.
[66] A. Wongseelashote. An algebra for determining all path-values in a network with application to
k-shortest-paths problems. Networks 6:307–334, 1976.
[67] A. Wongseelashote. Semirings and path spaces. Discrete Mathematics 26:55–78, 1979.
[68] J. Y. Yen. Finding the K shortest loopless paths in a network. Management Science 17:712–716,
1971.
[69] J. Y. Yen. Another algorithm for finding the K shortest-loopless network paths. Proc. 41st Mtg.
Operations Research Society of America, vol. 20, p. B/185, 1972.
[70] D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652–673, April 1999.