PENENTUAN JALUR DISTRIBUSI PADA TRAVELING SALESMAN PROBLEM (TSP) DENGAN ALGORITMA BRANCH AND BOUND DAN NEAREST NEIGHBOUR UNTUK MENGOPTIMALKAN BIAYA TRANSPORTASI DI UMKM BOLEN CRISPY MAK TIN

Ali, Muhammad Fadhel and Suseno, Suseno (2025) PENENTUAN JALUR DISTRIBUSI PADA TRAVELING SALESMAN PROBLEM (TSP) DENGAN ALGORITMA BRANCH AND BOUND DAN NEAREST NEIGHBOUR UNTUK MENGOPTIMALKAN BIAYA TRANSPORTASI DI UMKM BOLEN CRISPY MAK TIN. Tugas Akhir thesis, University of Technology Yogyakarta.

Text 5200611052 MUHAMMAD FADHEL ALI_ABSTRAK.pdf Download (278kB)

Abstract

ABSTRAK Optimalisasi rute distribusi merupakan langkah penting bagi UMKM dalam meningkatkan efisiensi operasional dan kepuasan pelanggan. Penelitian ini dilakukan pada UMKM Bolen Crispy Mak Tin yang menghadapi tantangan distribusi dengan rute yang belum optimal, menyebabkan peningkatan biaya transportasi dan risiko penurunan kualitas produk. Penelitian ini menggunakan algoritma Branch and Bound dan Nearest Neighbour untuk menyelesaikan masalah Traveling Salesman Problem (TSP) dalam menentukan rute distribusi yang efisien. Hasil dari pengolahan data berupa rute optimal yang memiliki jarak paling minimum dengan total jarak 282,5 KM dengan rute P-1-2-7-4-5-6-3-0 untuk algoritma branch and Bound dan 239 km dengan rute P-2-3-4-5-6-7-1-P untuk Nearest Neighbour Hasil tersebut lebih optimal jika dibandingkan dengan rute sebelumnya yaitu P-1-2-3-4-5-6-7-P dengan jarak 291 km analisis menunjukkan bahwa Metode Nearest Neighbour mampu memberikan solusi optimal dengan meminimalkan jarak tempuh dan biaya distribusi, sementara algoritma Branch and Bound juga memberikan solusi optimal tapi kurang efisien. serta efisiensi biaya distribusi semula Rp.570.320,9 menjadi 565.511,36 atau lebih hemat 0,84% untuk Algoritma Branch and Bound dan 540.795,45 atau lebih hemat 5,18% ntuk Nearest Neighbour Kata Kunci : Traveling Salesman Problem (TSP), Distribusi, Algoritma Branch and Bound, Nearest Neighbour,Biaya Transportasi ABSTRACT Optimizing distribution routes is crucial for micro, small, and medium enterprises (MSMEs) in enhancing operational efficiency and customer satisfaction. This study focuses on Bolen Crispy Mak Tin, an MSME that faces distribution challenges due to suboptimal routes, which lead to increased transportation costs and the potential degradation of product quality. The research employs the Branch and Bound and Nearest Neighbor algorithms to address the Traveling Salesman Problem (TSP) in determining efficient distribution routes. The data processing results yield an optimal route with a minimum distance of 282.5 kilometers using the P-1-2-7-4-5-6-3-0 route for the Branch and Bound algorithm and 239 kilometers using the P-2-3-4-5-6-7-1-P route for the Nearest Neighbor algorithm. These results are more efficient than the previous route, P-1-2-3-4-5-6-7-P, which had a distance of 291 kilometers. The analysis demonstrates that the nearest-neighbor method can offer an optimal solution by minimizing travel distance and distribution costs. On the other hand, the Branch and Bound algorithm also yields an optimal solution but is not as efficient. The original distribution cost of Rp.570,320.9 has been reduced to 565,511.36, resulting in an efficiency improvement of 0.84% for the Branch and Bound Algorithm, and 540,795.45, resulting in an efficiency improvement of 5.18% for Nearest Neighbor. Keywords: Traveling Salesman Problem (TSP), Distribution, Branch and Bound Algorithm, Nearest Neighbor, Transportation Cost

Item Type:	Thesis (Skripsi, Tugas Akhir or Kerja Praktek) (Tugas Akhir)
Subjects:	T Technology > TS Manufactures
Divisions:	Fakultas Sains dan Teknologi > S1 Teknik Industri
Depositing User:	Kaprodi S1 Teknik Industri UTY
Date Deposited:	28 Oct 2025 07:18
Last Modified:	28 Oct 2025 07:18
URI:	http://eprints.uty.ac.id/id/eprint/19350

Actions (login required)

View Item