Reoptimizing shortest paths: From state of the art to new recent perspectives

Reoptimizing shortest paths consists in solving a sequence of shortest path problems, where each problem differs only slightly from the previous one, because the origin node has been changed, some arcs have been removed from the graph, or the cost of a subset of arcs has been modified. Each problem could be simply solved from scratch, independently from the previous one, by using either a label-correcting or a label-setting shortest path algorithm. Nevertheless, a clever way to approach it is to design ad hoc algorithms that efficiently use information resulting from previous computations. This paper formally defines the different shortest path reoptimization problems arising in several different scenarios and/or conditions and surveys the most efficient state of the art algorithms to approach them. It also describes some new solution techniques inspired by the dual mathematical formulation of the problems.

[1]  D. Krob,et al.  Fast paths on dynamic road networks , 2007 .

[2]  M. S. Bazaraa,et al.  A Dual Shortest Path Algorithm , 1974 .

[3]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[4]  Giancarlo Raiconi,et al.  Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept , 2003, Comput. Optim. Appl..

[5]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[6]  Celso C. Ribeiro,et al.  A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing , 2005, Networks.

[7]  Giorgio Gallo,et al.  A new algorithm to find the shortest paths between all pairs of nodes , 1982, Discret. Appl. Math..

[8]  Mattia D'Emidio,et al.  Dynamically Maintaining Shortest Path Trees under Batches of Updates , 2013, SIROCCO.

[9]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .

[10]  Mikkel Thorup,et al.  Speeding Up Dynamic Shortest-Path Algorithms , 2008, INFORMS J. Comput..

[11]  Dimitri P. Bertsekas,et al.  An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[12]  Leo Liberti,et al.  Bidirectional A* search on time‐dependent road networks , 2012, Networks.

[13]  Philippe Baptiste,et al.  Fast paths in large-scale dynamic road networks , 2007, Comput. Optim. Appl..

[14]  Maria Grazia Scutellà,et al.  A new dual algorithm for shortest path reoptimization , 1999 .

[15]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[16]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[17]  Giorgio Gallo,et al.  Reoptimization procedures in shortest path problem , 1980 .

[18]  M. Tavana,et al.  A decremental approach with the A ⁄ algorithm for speeding-up the optimization process in dynamic shortest path problems , 2015 .

[19]  Sang Nguyen,et al.  A dual simplex algorithm for finding all shortest paths , 1981, Networks.

[20]  Edward P. F. Chan,et al.  Shortest Path Tree Computation in Dynamic Graphs , 2009, IEEE Transactions on Computers.

[21]  Alistair A. Young,et al.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , 2017, MICCAI 2017.

[22]  Leo Liberti,et al.  Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.