Transportation problems is a form of linear programming problem in which commodities are carried from a set of sources to a set of destinations based on the supply and demand of the source and destination, respectively, with the goal of minimizing overall transportation cost. Finding an initial basic feasible solution (IBFS) is required in the solution phase of a transportation problem in order to reach the optimal answer. Optimality provides us with the best route that prompts or has the lowest aggregate cost, whatever is desired. The Least-Cost Method and North-West Corner Method are two well-known current approaches that are compared to the proposed method and it is discovered that the latter produces superior outcomes. The researcher found the most feasible solution using the proposed method is the same as the optimal solution in some numerical examples.