Pendekatan TOCM - SC yang Dimodifikasi untuk Mencari Initial Basic Feasible Solution pada Transportation Problem

Abinugraha, Ryan (2025) Pendekatan TOCM - SC yang Dimodifikasi untuk Mencari Initial Basic Feasible Solution pada Transportation Problem. Other thesis, Institut Teknologi Sepuluh Nopember.

[thumbnail of 5025211178-Undergraduate_Thesis.pdf] Text
5025211178-Undergraduate_Thesis.pdf - Accepted Version
Restricted to Repository staff only

Download (6MB) | Request a copy

Abstract

Transportation Problem (TP) berkaitan dengan pendistribusian barang dari sumber (supply) ke tujuan (demand) secara linear, dengan tujuan utama meminimalkan total cost. Tahapan awal dalam penyelesaian TP adalah menentukan Initial Basic Feasible Solution (IBFS), yang berperan penting dalam mendekati solusi optimal. Penelitian ini mengusulkan modifikasi terhadap pendekatan Total Opportunity Cost Matrix – Supreme Cell (TOCM–SC) guna memperoleh solusi awal yang lebih baik. Modifikasi dilakukan dengan menghitung nilai Row Supreme (RS) dan Column Supreme (CS) hanya satu kali di awal, tidak diulang setiap iterasi seperti pada metode asli. Selain itu, digunakan tabel hasil penjumlahan RS dan CS sebagai dasar pengambilan keputusan dalam proses alokasi. Tahap pengerjaan dimulai dengan mengubah data menjadi input Matriks TP, setelah itu TP diuji melalui 5 metode, VAM, TOM, TOCM-MT, TOCM-SC, dan Modif TOCM-SC. Setelah melalui pengujian melalui metode terpilih, terdapat nilai total cost sebagai output yang dapat dihitung dengan mengalikan (cost x alokasi barang). Hasil pengujian terhadap 40 data uji menunjukkan bahwa Modif TOCM-SC mencapai solusi optimal pada 34 kasus (85%), sedangkan TOCM – SC hanya pada 25 kasus (62,5%). Selain itu, metode ini juga mengurangi total iterasi dari 655 menjadi 636, dan menghasilkan nilai deviasi rata-rata lebih rendah sebesar 0,48% dibandingkan TOCM – SC sebesar 1,50%. Maka dari itu, penelitian ini menunjukkan bahwa modifikasi yang diusulkan mampu meningkatkan akurasi dan efisiensi dalam menyelesaikan TP.=====================================================================================================================
The Transportation Problem (TP) relates to the linear distribution of goods from the source (supply) to the destination (demand), with the main objective of minimizing total cost. The initial stage in solving the TP is to determine the Initial Basic Feasible Solution (IBFS), which plays an important role in approaching the optimal solution. This study proposes a modification to the Total Opportunity Cost Matrix – Supreme Cell (TOCM–SC) approach to obtain a better initial solution. The modification involves calculating the Row Supreme (RS) and Column Supreme (CS) values only once at the beginning, rather than repeating the calculation in each iteration as in the original method. Additionally, a table of the sum of RS and CS values is used as the basis for decision-making in the allocation process. The process begins by converting the data into TP Matrix input, followed by testing the TP through five methods: VAM, TOM, TOCM-MT, TOCM-SC, and Modified TOCM-SC. After testing through the selected methods, the total cost value is obtained as output, calculated by multiplying (cost × item allocation). Testing on 40 test data sets shows that Modified TOCM-SC achieves an optimal solution in 34 cases (85%), while TOCM-SC only in 25 cases (62.5%). Also, this method reduces the total iterations from 655 to 636 and produces a lower average deviation value of 0.48% compared to TOCM-SC's 1.50%. Therefore, this study demonstrates that the proposed modification enhances accuracy and efficiency in solving the TP.

Item Type: Thesis (Other)
Uncontrolled Keywords: Transportation Problem , Initial Basic Feasible Solution, TOCM - SC
Subjects: Q Science > QA Mathematics > QA402.6 Transportation problems (Programming)
Divisions: Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User: Ryan Abinugraha
Date Deposited: 31 Jul 2025 08:47
Last Modified: 31 Jul 2025 08:47
URI: http://repository.its.ac.id/id/eprint/124083

Actions (login required)

View Item View Item