Rasyid, Raden Pandu Anggono (2024) Pencarian Initial Basic Feasible Solution dengan Metode Next Least Cost Method (NLCM) Untuk Mengatasi Transportation Problems. Other thesis, Institut Teknologi Sepuluh Nopember.
![[thumbnail of 5025201024-Undergraduate_Thesis.pdf]](http://repository.its.ac.id/style/images/fileicons/text.png) |
Text
5025201024-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2026. Download (1MB) | Request a copy |
Abstract
Transportation Problem (TP) adalah masalah alokasi sumber daya dari beberapa lokasi asal ke beberapa demand. Supply memiliki persediaan tertentu, sedangkan demand memiliki permintaan tertentu. Tujuan dari TP adalah untuk mencari cost minimal biaya pengiriman (transportation cost) sumber daya dari supply ke demand. Dalam pencarian cost minimal pada TP, Initial Basic Feasible Solution (IBFS) dilakukan sebagai langkah awal. Pemilihan IBFS yang baik sangat memengaruhi pencarian solusi optimal.
Oleh karena itu, usulan IBFS yang lebih baik diajukan dalam tugas akhir ini, yaitu Next Least Cost Method (NLCM). Metode NLCM mempertimbangkan least cost berikutnya untuk pembuatan keputusan alokasi sumber daya dari supply ke demand. Kinerja NLCM diuji menggunakan 45 kasus dimana 35 kasus yang diambil dari berbagai jurnal, 5 kasus sintesis, dan 5 kasus data aktual dari perusahaan XYZ. Lima metode pencarian IBFS yaitu LCM, VAM, JHM, TOCM-MT, BCE, dan SSM, dibandingkan dengan NLCM.
Eksperimen menunjukkan bahwa perbandingkan dengan lima metode lainnya, NLCM memiliki kinerja yang lebih tinggi dan biaya total IBFS yang lebih rendah. Kinerja NLCM yang lebih tinggi dibuktikan dengan dicapainya solusi optimal pada 42 dari 45 kasus. Biaya total IBFS dibuktikan dengan terdapat 8 kasus total biaya IBFS NLCM lebih rendah dari SSM. Hasil uji coba ini membuktikan bahwa NLCM adalah metode yang lebih efisien dan efektif dalam mencari solusi optimal untuk masalah Transportasi.
========================================================================================================================
The Transportation Problem (TP) is the issue of allocating resources from several origin locations to various destination locations. The origins have specific supplies, while the destinations have certain demands and capacities. The goal of TP is to find the optimal solution for transporting resources from origins to destinations to minimize transportation costs. In the search for the minimum cost in TP, the Initial Basic Feasible Solution (IBFS) is conducted as an initial step. A good IBFS selection greatly influences the performance, speed, and efficiency of the Simplex algorithm in finding the optimal solution.
Therefore, this thesis proposes a better IBFS, called the Next Least Cost Method (NLCM). The NLCM method considers the subsequent least cost for resource allocation decisions to the destinations. The performance of NLCM is illustrated through 45 numerical problems, including 35 cases taken from various journals, 5 synthetic cases, and 5 actual data cases from company XYZ. Five other approaches, including LCM, VAM, JHM, TOCM-MT, BCE, and SSM, are compared with the NLCM experiment.
The experiments show that, compared to the five other methods, NLCM has higher performance and a lower total IBFS cost, with the optimal solution achieved in 42 out of 45 cases. These trial results confirm that NLCM is a more efficient and effective method for finding the optimal solution for transportation problems
| Item Type: | Thesis (Other) |
|---|---|
| Uncontrolled Keywords: | Initial Basic Feasible Solution, Optimal solution, Transportation problem, Transportation cost, Biaya transportasi, Hasil optimal, Initial Basic Feasible Solution, Masalah transportasi. |
| Subjects: | T Technology > T Technology (General) T Technology > T Technology (General) > T57.74 Linear programming T Technology > T Technology (General) > T57.84 Heuristic algorithms. |
| Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis |
| Depositing User: | Raden Pandu Anggono Rasyid |
| Date Deposited: | 09 Aug 2024 06:48 |
| Last Modified: | 09 Aug 2024 06:48 |
| URI: | http://repository.its.ac.id/id/eprint/112953 |
Actions (login required)
 |
View Item |