Pencarian Initial Basic Feasible Solution Pada Transportation Problem Dengan Menggunakan Algoritma Juman And Hoque Method Modification

Dwiatmaja, Puguh Santosa (2021) Pencarian Initial Basic Feasible Solution Pada Transportation Problem Dengan Menggunakan Algoritma Juman And Hoque Method Modification. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

Text 05111640000049-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only Download (2MB) | Request a copy

Abstract

Sebuah perusahaan dalam mendistribusikan produk membutuhkan biaya yang tidak sedikit jumlahnya. Dalam segi ekonomi, demi mencapai keuntungan yang maksimal, perusahaan justru harus menggunakan biaya seminimal mungkin dengan menekan total biaya yang digunakan. Permasalahan ini mendorong para peneliti melakukan riset untuk mencari biaya terkecil dalam pendistribusian produk. Para peneliti kemudian menamakan permasalahan matematika linier ini sebagai Transportation Problem (TP). Dalam Transportation Problem, terdapat dua tahap untuk mencari solusi optimal, yaitu Initial Basic Feasible Solution (IBFS) dan stepping stone. IBFS merupakan solusi awal yang dikerjakan memakai algoritma tertentu, sehingga biaya yang dihasilkan pada TP mendekati angka seminimal mungkin
JHM merupakan algoritma IBFS yang menggunakan teknik pengalokasian tiap demand pada kolom ke cost terkecil, lalu melimpahkan kelebihan alokasinya kepada cost kedua terkecil yang dipilih dengan mencari selisih terkecil antara cost terkecil dan cost kedua terkecil pada tiap kolom. Pada penelitian ini, algoritma JHM akan dimodifikasi pada bagian pemilihan saat memindahkan alokasi pada baris yang berlebih ke baris yang lain dengan menambah beberapa aturan. Algoritma JHM yang baru dinamakan algoritma Juman and Hoque Method – Modification yang diimplementasikan dalam bentuk program berbahasa C dengan format input sejumlah supply, sejumlah demand, dan cost tiap rute. Output yang diharapkan dari program ini adalah nilai alokasi tiap rute dan total biaya pengalokasian tersebut.
Algoritma JHM-M diujicobakan terhadap 50 data. Pada hasil uji penelitian ini, persentase akurasi algoritma JHM sebesar 68%, sedangkan persentase akurasi algoritma JHM-M sebesar 72%. JHM-M dinilai lebih baik daripada JHM, hal ini dibuktikan dengan kenaikan akurasi sebesar 5,88% terhadap JHM. Sehingga pada penelitian ini dapat disimpulkan bahwa algoritma JHM-M lebih mendekati hasil optimal daripada algoritma JHM.
========================================================================================================
A company in distributing products requires a lot of cost. From the economic point of view, in order to achieve maximum profit, companies must use the minimum possible costs by reducing the total costs used. This problem encourages researchers to carry out research to find the smallest cost in product distribution. The researchers then named this linear mathematical problem as the Transportation Problem (TP). In the Transportation Problem, there are two stages in finding the optimal solution, the Initial Basic Feasible Solution (IBFS) and the optimal solution with the stepping stone. IBFS is an initial solution that is done using a certain algorithm, so that the costs generated on the TP are as close to the minimum as possible.
JHM is an IBFS algorithm that uses the technique of allocating each demand in the column to the smallest cost, then delegates the excess allocation amount to the second smallest cost chosen by finding the smallest difference between the smallest cost and the second smallest cost in all columns. In this study, the JHM algorithm will be modified in the selection section when moving allocations on the excess row to another line by adding some rules. The new JHM algorithm is called the Juman and Hoque Method - Modification algorithm. The algorithm is implemented in the form of a C language program with an input format of a number of supplies, a number of demands, and the cost of each route. The output expected from this program is the value of the allocation of each route and the total cost of the allocation.
The JHM-M algorithms were tested on 50 data. In the test results of this study, the accuracy percentage of the JHM algorithm is 68%, while the accuracy percentage of the JHM-M algorithm is 72%. JHM-M is better than JHM, this is evidenced by the increase in accuracy of 5,88% against JHM. So that in this study it can be concluded that the JHM-M algorithm is closer to optimal results than the JHM algorithm.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Juman and Hoque Method, Transportation Problem, Initial Basic Feasible Solution, Solusi Optimal, Minimal total cost
Subjects:	Q Science > QA Mathematics > QA76.6 Computer programming. Q Science > QA Mathematics > QA9.58 Algorithms
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User:	Puguh Santosa Dwiatmaja
Date Deposited:	08 Mar 2021 03:30
Last Modified:	08 Mar 2021 03:31
URI:	http://repository.its.ac.id/id/eprint/83721

Actions (login required)

View Item