An Extension of the Shortest-Time Transportation Problem

In the shortest-time transportation problem currently studied,the transport time from a source to a sink is a constant,independent of the amount of the flow.This restricts its applicability in practice.In this paper we consider the case that the transport time is an increasing function of the flow.A polynomial-time algorithm,which effectively produces the optimal transport scheme,is presented for this generalized model.