Abstract: The current new algorithmic approach to solve the Transportation Problem (TP) is based upon the Total Opportunity Cost (TOC) of a Transportation Table (TT). Opportunity cost in each cell along each row of a TT is the difference of the corresponding cell value from the lowest cell value of the corresponding row. Similarly, opportunity cost in each cell along each column of a TT is the difference of the corresponding cell value from the lowest cell value of the corresponding column. Total Opportunity Cost Table (TOCT) is formed by adding the opportunity cost in each cell along each row and the opportunity cost in each cell along each column and putting the summation value in the corresponding cell. The current algorithm considers the average of total opportunity costs of cells along each row identified as Row Average Total Opportunity Cost (RATOC) and the average of total opportunity costs of cells along each column identified as Column Average Total Opportunity Cost (CATOC). Allocations of costs are started in the cell along the row or column which has the highest RATOCs or CATOCs. The Initial Basic Feasible Solution (IBFS) obtained by the current method is better than some other familiar methods which is discussed in this article.