A fast algorithm for finding K shortest paths using generalized spur path reuse technique

[1]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[2]  Konstantinos G. Zografos,et al.  Solving the k-shortest path problem with time windows in a time varying network , 2008, Oper. Res. Lett..

[3]  Richard Pavley,et al.  A Method for the Solution of the Nth Best Path Problem , 1959, JACM.

[4]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

[5]  Qingquan Li,et al.  Finding Reliable Shortest Paths in Road Networks Under Uncertainty , 2013 .

[6]  Bi Yu Chen,et al.  Finding the k reliable shortest paths under travel time uncertainty , 2016 .

[7]  Bi Yu Chen,et al.  Efficient algorithm for finding k shortest paths based on re-optimization technique , 2020 .

[8]  Laurence R. Rilett,et al.  Heuristic shortest path algorithms for transportation applications: State of the art , 2006, Comput. Oper. Res..

[9]  S. Clarke,et al.  Computing the N Best Loopless Paths in a Network , 1963 .

[10]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[11]  Monika Sester.  Analysis of mobility data – A focus on Mobile Mapping Systems , 2020, Geo spatial Inf. Sci..

[12]  Qingquan Li,et al.  Map-matching algorithm for large-scale low-frequency floating car data , 2014, Int. J. Geogr. Inf. Sci..

[13]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[14]  Lixing Yang,et al.  Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations , 2017 .

[15]  Ruihong Huang.  A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search , 2007, GeoInformatica.

[16]  David Pisinger,et al.  Multi-objective and multi-constrained non-additive shortest path problems , 2011, Comput. Oper. Res..

[17]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[18]  Subhash Suri,et al.  Finding the k shortest simple paths , 2007, ALENEX.

[19]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[20]  Mark Hickman,et al.  Trip-Based Path Algorithms Using the Transit Network Hierarchy , 2015 .

[21]  Richard L. Church,et al.  Finding shortest paths on real road networks: the case for A* , 2009, Int. J. Geogr. Inf. Sci..

[22]  Veerle Fack,et al.  An effective heuristic for computing many shortest path alternatives in road networks , 2012, Int. J. Geogr. Inf. Sci..

[23]  G. Andrienko,et al.  Citywide Traffic Analysis Based on the Combination of Visual and Analytic Approaches , 2020, Journal of Geovisualization and Spatial Analysis.

[24]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[25]  Matthias Ehrgott,et al.  A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..

[26]  Uri Zwick,et al.  Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs , 2005, ICALP.

[27]  Edward Minieka,et al.  On computing sets of shortest paths in a graph , 1974, Commun. ACM.

[28]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.