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

  • Gholamhassan Shirdel Department of Mathematics, University of Qom, Qom, Iran
  • Hassan Rezapour Ph.D. Student Department of Mathematics, University of Qom, Qom, Iran

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 nd the shortest path connecting source node s and sink node i in a time-varying network ow 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.

Published
2017-12-06
Section
CRORR Journal Regular Issue