for this problem is 592,029. The best solution obtained by the genetic algorithm of Conway and Venkataramanan [13] was 593,856. The proposed SA algorithm found the optimal solution for this problem. The convergence graphic and results of this test are shown in Figs. 5 and 6. In the second test shifting costs are included. The optimal solution for this problem is not known. The best solution found by the genetic algorithm of Conway and Venkataramanan [13] was 608,904. The solution obtained from the proposed SA algorithm is 607,421. This is slightly better than the known solution. The convergence graphic and results of this test are shown in Figs. 7 and 8.