A new dual algorithm for shortest path reoptimization

Nguyen, S. and Pallottino, Stefano and Scutellà, Maria Grazia (1999) A new dual algorithm for shortest path reoptimization. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (111Kb)

Abstract

Shortest path problems are among the most studied network flow problems, with interesting applications in various fields. Mainly in large scale transportation systems, a sequence of shortest path problems needs often to be solved, where the (k+1)-th problem differs only slightly from the k-th one. In that context, a promising line of research is to study efficient reoptimization approaches, able to exploit useful information from one shortest path computation to the next one. In this work, we shall focus on the change of the origin node in the shortest path problem to be solved. After reviewing the classical (dual) algorithms described in the literature sofar, which essentially show a Dijkstra's like behavior, a new dual approach will be proposed, which could be particularly promising in practice.

Repository staff only actions