In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. In this paper, a new algorithm is proposed to find an initial basic feasible solution for the transportation problems.
The method is also illustrated with numerical examples.  - , Pandian & Natarajan  , Reinfeld & Vogel  , Sayedul Anam et al. A comparative study is also carried out by solving a good number of transportation problems which shows that the proposed method gives better result in comparison to the other existing heuristics available in the literature. Network Representation and Mathematical Model of Transportation Problem Generally the transportation model is represented by the network in Figure 1.
In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics.
The associated cost matrices of these transportation problems are of special structure.
this minimum cost cell is to be found out from the TT which is constructed in Step-1).
Again if the cost cells and the allocations are equal, in such case choose the nearer cell to the minimum of demand/supply which is to be allocated.
Received 24 November 2015; accepted 1 March 2016; published 4 March 2016 1. There are m sources and n destinations, each represented by a node. The objective function minimizes the total cost of transportation (Z) between various sources and destinations. (2014) Advanced Vogel’s Approximation Method (AVAM): A New Approach to Determine Penalty Cost for Better Feasible Solution of Transportation Problem.
Introduction Transportation problem is famous in operation research for its wide application in real life. The arcs represent the routes linking the sources and destinations. The constraint i in the first set of constraints ensures that the total units transported from the source i is less than or equal to its supply. International Journal of Engineering Research & Technology (IJERT), 3, 182-187.