Transportation Time Minimization: An Algorithmic Approach

Abstract

In this paper, a transportation algorithm is applied to determine the minimum transportation time. The algorithm determines the Initial Basic Feasible Solution (IBFS) of Transportation Problem (TP) to minimize time. Herein, the Distribution Indicators (DI) is calculated by the difference of the greatest time unit and the nearest-to-the-greatest time unit. Then the least entry of the Transportation Table (TT) along the highest DI is taken as the basic cell. The result with an elaborate illustration demonstrates that the method presented here is effective in minimizing the transportation time.