A New Approach for Minimization of Transportation Time: An Algorithmic Approach

Abstract

A transportation problem basically deals with the problem, which aims to find the best way to fulfill  the demand of n demand points using the capacities of m supply points. Here a new model for solving transportation problem to determine the minimum transportation time has been studied. The proposed method is very simple, easy to understand and apply. The algorithm studied a new model for solving transportation problems to determine the minimum transpm determines the Initial Basic Feasible Solution (IBFS) of Transportation Problem (TP) to minimize time. Herein  it is  constructed Time Minimizing Small Table( TMST ) then the Decision Making Indicators (DMI)) are calculated by the difference of the greatest time unit and the nearest-to-greatest time unit. Then the least entry of the Transportation Table (TT) along the highest DMI or along the second highest DMI is taken as the basic cell. It can be seen that the proposed algorithm gives a better optimal solution to minimize the transportation time.  The minimum transportation time with an example also has been calculated.