[3] BRANDER A W, SIMCLAIR M C. Comparative study of K-shortest path algorithms[C]//John Moores University. Proc.11th UK Performance Engineering Workshop. Livepool: Springer London, 1995: 370-379.
[5] WALTER H, RICHARD P. A method for the solution of the Nth best path problem[J]. Journal of the ACM, 1959, 6(4): 506-514.
[6] NAOKI K, TOSHIHIDE I, HISASHI M. Anecient algorithm for K shortest simple paths[J]. Networks, 1982. 12(4): 411-427.
[7] JIN Y Y. Finding the K shortest loopless paths in a network[J]. Manage-ment Science, 1971, 17(11): 712-716.
[8] LAWLER E L. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem[J]. Management Science, 1972, 18(7): 401-405.
[9] MARTINS E Q V, SANTOS J L E. A new shortest paths ranking algorithm[J]. Inverstigacao Operacional, 2000, 20(1): 47-62.
[10] HERSHBERGER J, MAXEL M, SUR S. Finding the K shortest simple paths: A new algorithm and its implementation[J]．ACM Transactions on Algorithms, 2007, 3(4): 45-48.
[14] VEDAT A, ERHAN E, RAJAN B. On finding dissimilar paths[J]. European Journal of Operational Research, 2000, 121: 232-246.
