A Heuristic for Obtaining and Initial Solution for the Transportation Problem
提出一种新的启发式方法求解运输问题的初始解，通过480个算例与Vogel近似法比较，新方法在总成本、迭代次数和CPU时间上表现更优。
A heuristic for obtaining an initial solution for the transportation problem is presented. Comparison of findings obtained by the new heuristic and Vogel's approximation method (VAM) are tabulated for 480 examples. Superior performance of the new heuristic over VAM is discussed in terms of total costs obtained, number of iterations required to reach the final solution, and CPU time required to solve the problems. Experimental design aspects are also presented.