A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

Abstract

In this paper, we consider the universally quickest transshipment problem in a dynamic network where each arc has not only a capacity but also a transit time. The problem asks for minimizing the time when the last supply reaches the sink as well as simultaneously maximizing the amount of supply which has reached the sink at every time step. In this paper, we propose a polynomial-time algorithm for the problem in the class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time. © 2009 Springer-Verlag Berlin Heidelberg.