SOLVING TRANSPORTATION PROBLEM WITH MAXIMUM RANGE METHOD

Arifin, Zainal (2021) SOLVING TRANSPORTATION PROBLEM WITH MAXIMUM RANGE METHOD. Undergraduate thesis, UNDIP.

[img]
Preview
PDF
380Kb
[img]PDF
Restricted to Repository staff only

1950Kb
[img]
Preview
PDF
386Kb

Abstract

The transportation problem is part of Operations Research which discusses minimizing shipping costs from several sources to several destinations with the most effective allocation of goods distribution. Previous studies have discussed new methods, namely MRCM (Maximum Range Column Method) and MRRM (Maximum Range Row Method) to determine the initial feasible solution to the transportation problem in a row by determining the distance or the largest range value in the column and row. In this final project, discuss another alternative method, namely Maximum Range Method (MRM) which is a combination of MRCM and MRRM methods. MRM aims to determine the initial feasible solution by calculating the largest range value in rows and columns. So MRM is an initial feasible solution to the transportation problem. The algorithm is easy to understand and produces an effective solution when the case is that the amount of supply is equal to the number of requests. In the case of CV Mega Jaya Super Print using the MRM method, the transportation cost is Rp. 13,252,400.00 followed by the MODI method resulting in a transportation cost of Rp. 13,2090,000.00. Keywords : Transportation Problem, Initial Feasible Solution, MRM, MRRM, and MRCM.

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:84177
Deposited By:Admin Departemen Matematika
Deposited On:09 Jun 2022 22:23
Last Modified:09 Jun 2022 22:23

Repository Staff Only: item control page