PENENTUAN JALUR DISTRIBUSI PADA TRAVELING SALESMAN PROBLEM (TSP) DENGAN ALGORITMA BRANCH AND BOUND UNTUK MENGOPTIMALKAN BIAYA TRANSPORTASI

Rismawati, Yuliana Nur and Suseno, Suseno (2024) PENENTUAN JALUR DISTRIBUSI PADA TRAVELING SALESMAN PROBLEM (TSP) DENGAN ALGORITMA BRANCH AND BOUND UNTUK MENGOPTIMALKAN BIAYA TRANSPORTASI. Tugas Akhir thesis, University of Technology Yogyakarta.

[img] Text
5200611107 Yuliana Nur Rismawati Abstrak.pdf
Download (131kB)

Abstract

ABSTRAK CV. Sulthan Cipta Jaya yang berlokasi di Kabupaten Sragen, Jawa Tengah merupakan perusahaan produksen es batu kristal. Masalah dalam penelitian ini ialah Traveling Salesman Problem (TSP), perusahaan sering kali mengalami keterlambatan dalam mendistribusikan produk karena meningkatnya permintaan. Tercatat hingga 15 Maret 2024 perusahaan perlu mengirimkan ke-40 titik distributor dalam sehari. Penelitian ini berfokus pada armada yang memiliki rute distribusi paling rumit yaitu 12 titik distributor. Dalam penelitian ini dilakukan studi pustaka, pengumpulan data, kemudian pengolahan data dengan pendekatan Algoritma Branch and Bound. Hasil dari pengolahan data berupa rute optimal yang memiliki jarak paling minimum dengan total bobot 53,3 km dengan rute P,2,9,12,4,6,1,5,3,10,7,8,11,P. Hasil tersebut lebih optimal jika dibandingkan dengan rute sebelumnya yaitu P,2,9,12,4,6,1,5,3,7,8,10,11,P dengan jarak 64,7 km. Sehingga untuk mengoptimalkan jarak dan biaya disribusi perusahaan perlu menerapkan rute baru yang telah diselesai, dengan begitu perusahaan dapat menghemat jarak 11,4 km dan biaya distribusi sebesar Rp 28.500/hari, sehingga dalam sebulan menghemat sebesar Rp 855.000. Kata Kunci : Traveling Salesman Problem (TSP), Distribusi, Algoritma Branch and Bound, Biaya Transportasi. ABSTRACT CV. Sulthan Cipta Jaya, situated in Sragen Regency in Central Java, is a company that produces crystal ice cubes. The issue being addressed in this study is the Traveling Salesman Problem (TSP), which has led to frequent delays in company product distribution due to rising demand. The company is required to send to 40 distributor points daily until March 15, 2024, as stated in the records. This study centers on the fleet with the most complex distribution route, precisely 12 distributor points. This study involved conducting a literature review and collecting and processing data using the Branch and Bound Algorithm approach. The data processing has yielded an optimal route with a 53.3 km minimum distance, passing through points P, 2, 9, 12, 4, 6, 1, 5, 3, 10, 7, 8, 11, and back to P. This route is more efficient than the previous one, which covers a 64.7 km distance. By implementing this new route, the company can save 11.4 km in distance and reduce distribution costs by Rp 28,500 per day, resulting in monthly savings of Rp 855,000. Keywords: Traveling Salesman Problem (TSP), Distribution, Branch and Bound Algorithm, 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: 06 Dec 2024 03:17
Last Modified: 06 Dec 2024 03:17
URI: http://eprints.uty.ac.id/id/eprint/17134

Actions (login required)

View Item View Item
UTY Open Access is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.