Pencarian Initial Based Feasible Solution Pada Transportation Problem Menggunakan Algoritma Incessant Allocation Method Modification

Karomi, Mohammad Rasyid (2018) Pencarian Initial Based Feasible Solution Pada Transportation Problem Menggunakan Algoritma Incessant Allocation Method Modification. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[img]
Preview
Text
05111440000101-Undergraduate_Theses.pdf - Accepted Version

Download (2MB) | Preview

Abstract

Pada masa kini, dunia perindustrian membutuhkan sistem pendistribusian produk yang tidak memakan biaya besar. Hal ini memicu para peneliti untuk melakukan riset dalam menciptakan algoritma yang efektif untuk mencari biaya terkecil dalam sistem pendistribusian produk. Para peneliti kemudian menamakan permasalahan matematika linier ini sebagai Transportation Problem. Dalam Transportation Problem, tujuan utamanya adalah menciptakan algoritma yang dapat menghasilkan biaya terkecil dalam mengirimkan sejumlah kuantitas barang yang mulanya tersimpan di beberapa tempat pemasok ke tempat-tempat tujuan. Terdapat beberapa faktor yang mempengaruhi besar-kecilnya biaya yaitu banyaknya pemasok, banyaknya kebutuhan pada tempat tujuan pengiriman, dan estimasi biaya tiap rute. Salah satu penelitian Transportation Problem adalah algoritma Incessant Allocation Method (IAM). IAM merupakan algoritma yang mengutamakan rute denganbiaya terkecil secara berurutan hingga semua pasokan terkirim atau semua kebutuhan terpenuhi. Pada penelitian ini, algoritma IAM akan dimodifikasi pada bagian inisiasi perulangan dan bagian pemilihan prioritasnya. Algoritma IAM yang baru dinamakan algoritma Incessant Allocation Method - Initiation Looping (IAM-IL) dan Incessant Allocation Method Priority Value (IAM-PV). Algoritma-algoritma tersebut 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 IAM dan IAM-PV diujicobakan terhadap 40 studi kasus dari beberapa paper lain. Pada hasil uji penelitian ini, persentase akurasi algoritma IAM sebesar 27,5%, sedangkan persentase akurasi algoritma IAM-PV naik 32,5% menjadi sebesar 60%. Selain itu, didapatkan juga persentase deviasi algoritma IAM sebesar 72,5%, sedangkan nilai persentase deviasi algoritma IAM-PV turun 11,889% menjadi sebesar 2,699%. Sehingga pada penelitian ini dapat disimpulkan bahwa algoritma IAM-PV lebih mendekati hasil optimal daripada algoritma IAM ========================================================= In the present, the world of industry requires a system of distribution of products that do not cost big. This prompted researchers to research in creating an effective algorithm to find the smallest cost in the product distribution system. The researchers then named this linear mathematical problem as a Transportation Problem. In Transportation Problem, the main objective is to create algorithms that can generate the smallest cost in delivering quantities of goods originally stored in multiple supplier places to the destination places. There are several factors that affect the size of the cost of the number of suppliers, the number of needs at the destination of delivery, and the estimated cost of each route. One of the research of Transportation Problem is the Incessant Allocation Method (IAM) algorithm. IAM is an algorithm that prioritizes the least costly route in sequence until all supplies are delivered or all needs are met. In this study, the IAM algorithm will be modified on the part of the loop initiation and the priority selection section. The new IAM algorithm is called the Incessant Allocation Method-Initiation Looping (IAM-IL) algorithm and the Incessant Allocation Method Priority Value (IAM-PV). The algorithms are implemented in the form of C-language programs with input format of supply, demand, and cost of each route. The expected output of this program is the allocation value of each route and the total cost of the allocation. IAM and IAM-PV algorithms were tested against 40 case studies from several other papers. In the results of this study, the percentage accuracy of IAM algorithm is 27.5%, while the percentage accuracy of IAM-PV algorithm up 32.5% to 60%. In addition, IAM algorithm percentage deviation percentage is 72.5%, while the percentage deviation of IAM-PV algorithm is decreased 11,889% to 2,699%. So in this study it can be concluded that IAM-PV algorithm is closer to optimal results than IAM algorithm

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: transportation problem, incessant allocation method,priority value
Subjects: Q Science > Q Science (General) > Q325 GMDH algorithms.
Q Science > QA Mathematics
Divisions: Faculty of Information and Communication Technology > Informatics > 55201-(S1) Undergraduate Thesis
Depositing User: Karomi Mohammad Rasyid
Date Deposited: 21 Jun 2021 01:43
Last Modified: 21 Jun 2021 01:43
URI: https://repository.its.ac.id/id/eprint/54388

Actions (login required)

View Item View Item