An extension to the single bottleneck transportation problem

Abstract

Abstract In the existing models of bottleneck transportation problem (BTP), the transport time along a given path is taken as a fixed charge. In most practical situations, however, the transport time usually varies with the amount of transport. In order to make up this defect, an extended BTP model is built in which transport time tij is determined by a function of the amount to be transported rather than a constant. A heuristic recursive algorithm is proposed for the solution of the model. Furthermore, a special case of the model (that the supplies at sources are sufficient) is studied and a set of formulae of optimal solution are derived.