Meminimumkan Biaya Transportasi dengan Metode Allocation Table Method (ATM) dan Modified Distribution (MODI)

Abstract

Transportation problems are a special case of linear programming. The special case is a strategy to minimize the transportation cost of distributing products or goods from various sources (supply) to various destinations (demand) so as to obtain maximum profit. Allocation Table Method (ATM) is one of the methods in optimization that aims to find the initial feasible solution of a transportation problem and sometimes provides the same solution as the optimal solution. In this study, several experiments have been carried out to modify the initial feasible solution of the Allocation Table Method (ATM) in the solution step to get the minimum result. The results showed that the Allocation Table Method (ATM) and modification experiments using minimum even costs gave the same results as the Modified Distribution (MODI) optimal solution compared to the maximum odd and maximum even modification experiments. The purpose of this study is to examine the initial feasible solution method of Allocation Table Method (ATM) in minimizing the transportation cost of distributing Minyak Goreng Kita or MINYAKITA at Perum BULOG Medan Branch Office with the optimal solution of Modified Distribution (MODI). Experiments conducted in this case show that the method can minimize the transportation cost of distributing MINYAKITA at Perum BULOG Medan Branch Office.