Robust time-varying shortest path with arbitrary waiting time at vertices

Abstract

Abstract. In this paper, we propose an algorithm for solving the robust time-varying shortest path problem in which the waiting time at any vertex is not restricted. The problem is to find the shortest path connecting source node s and sink node i in a timevarying network flow such that the time of the path is at most T , where T is a given integer, the transit costs are uncertain and waiting time is arbitrarily allowed at any of the vertices.