Minimizing Overshipments In Bottleneck Transportation Problems

Abstract

AbstractBottleneck transportation problems usually arise in connection with perishable comnjodities that have to be distributed as quickly as possible. A new approach is given that often permits the acceleration of the distribution. This reduction of the classical bottleneck time is obtained by allowing certain overshipments in the network. A primal algorithm will be given that determines completely the bottleneck time overshipment function. The technique will include capacity restrictions, and will also yield an efficient solution procedure for the classical bottleneck problem and for overshipment problems.