Open AccessSolving transportation problem using modified ASM method
Author(s) -
Nopiyana,
Pardi Affandi,
A S Lestia
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2106/1/012029
Subject(s) - mathematical optimization , transportation theory , computer science , constraint (computer aided design) , variable (mathematics) , mathematics , mathematical analysis , geometry
Transportation problems are related to activities aimed at minimizing the cost of distributing goods from a source to a destination. One of the methods used to solve transportation problems is the ASM Method as a method capable of producing optimal direct solutions without having to determine the initial basic feasible solution first. Determination of the allocation of goods in the ASM Method uses a reduced cost of 0 by calculating the maximum amount in the allocation of goods. Then the ASM method is modified so that the iteration used is simpler in obtaining the optimal direct solution without calculating the maximum number of row and column elements. The method is called Modified ASM Method. This method also provides more optimal results than the ASM method. This research aimed to solve transportation problems using the Modified ASM method to produce optimal solutions directly. The research procedure identifies and forms a model of transportation problems (variable decisions, objective functions and constraint functions), identifies types of transportation problems (balanced or unbalanced), and obtains direct solutions by solving transportation problems using the Modified ASM method. This research shows that the Modified ASM method successfully solves the problem of balanced and unbalanced transportation by producing optimal solutions in a simpler way than the ASM method.