An approximative algorithm for the fixed‐charges transportation problem

A computationally simple method for approximating the optimal solution to transportation problems is described. Also, a method to deal with fixed charges is proposed. The computational algorithms have been designed primarily to handle very large numbers of transportation problems each involving a small number of origins and destinations as is frequently the situation in the Navy supply system. The results of empirical tests of the effectiveness of the methods are summarized.