Proposing a New Method for Finding an Initial Solution to Solve Transportation Problem

This paper aims to introducing a novel method، to find an initial solution for transportation problem which is one of the well-known and useful models in linear optimization. Finding a good initial solution for has a special importance which results in an impressive decrease in the number of iterations to reach the optimal solution in the main algorithm. The proposed method، according to the remaining capacity of each node and calculating an estimation number of next transitions of the node، will reach better answer through making a better choice in each iteration. This method has an acceptable running time، and implementations show the more prospering performance of this method comparing to the well-known algorithm of this subject (Vogel’s method). It should be noted that by increasing the size of the problem (number of the nodes)، performance of the presented method will increase comparing to the Vogel’s1.