ANALISIS OPTIMASI JALUR DISTRIBUSI MENGGUNAKAN PENDEKATAN TSP (TRAVELING SALESMAN PROBLEM) UNTUK MENINGKATKAN EFISIENSI BIAYA DISTRIBUSI PADA TOKO UTHE GROSIR
Keywords:
Uthe Wholesale Store, Traveling Salesman Problem, Branch and Bound AlgorithmAbstract
Uthe Grosir Store, a local company offering a variety of fresh fruits and other household needs, has seen an increase in consumer demand and branch expansion. However, this growth also impacts the increase in distribution costs. The main goal is to find a route with the shortest total distance. For this data analysis, the Traveling Salesman Problem (TSP) method is used, which is a method that aims to reduce distribution costs by finding the closest distance or route with the fastest time, and minimum distribution costsIn finding the shortest route, an algorithm is needed, and the algorithm used in this method is Branch and Bound. The researcher also uses QM For Windows software and conducts experiments to compare the results of manual calculations with the results of calculations using QM For Windows software. Based on the results and discussion, it is concluded that manual calculations provide optimal results, that is, route 1 (A → B → C → D → A) is the shortest route that can be taken with a distance of 56 kilometers.
References
Arya, R. S., Destri Bintang, F. S., & Nur Hidayat, I. (2024). Analisis Perhitungan Harga Pokok Produksi Produk Sepatu Menggunakan Metode Full Costing Di Ukm Sejahtera. Januari, 2(1), 21–29.
Auliasari, K., Kertaningtyas, M., & Basuki, D. W. L. (2018). Optimalisasi Rute Distribusi Produk Menggunakan Metode Traveling Salesman Problem. Jurnal Sains, Teknologi dan Industri, 16(1), 15. https://doi.org/10.24014/sitekin.v16i1.6109
Dewantara, A. (2020). ETIKA DISTRIBUSI EKONOMI ISLAM (Perbandingan Sistem Distribusi Kapitalis dengan Sistem Distribusi Islam). Ad-Deenar: Jurnal Ekonomi dan Bisnis Islam, 4(01), 20. https://doi.org/10.30868/ad.v4i01.652
Karundeng, Thessa Natasya Mandey, S. L., & Sumarauw, J. S. B. (2018). Analisis Saluran Distribusi Kayu (Studi Kasus Di Cv. Karya Abadi, Manado). Jurnal EMBA: Jurnal Riset Ekonomi, Manajemen, Bisnis dan Akuntansi, 6(3), 1748–1757.
Kusrini Kusrini, & Jazi Eko Istiyanto. (2007). Penyelesaian Travelling Salesman Problem Dengan Algoritma Cheapest Insertion Heuristics Dan Basis Data. Jurnal Informatika, 8(2), 109–114.
Lestari, P., Hasibuan, A., & Harahap, B. (2022). Analisis Penentuan Rute Distribusi menggunakan Metode Nearest Neighbor di PT Medan Juta Rasa Tanjung Morawa. Factory Jurnal Industri, Manajemen dan Rekayasa Sistem Industri, 1(1), 26–32. https://doi.org/10.56211/factory.v1i1.110
Paduloh, P., & Djatna, T. (2023a). A Robust Optimizing Reverse Logistics Model for Beef Products Using Multi Depot Vehicle Routing Problem. ComTech: Computer, Mathematics and Engineering Applications, 14(1), 45–54. https://doi.org/10.21512/comtech.v14i1.8397
Paduloh, P., & Djatna, T. (2023b). Optimization of beef quality in reverse logistic. AIP Conference Proceedings, 2827(1). https://doi.org/10.1063/5.0164741
Paillin, D. B., & Sosebeko, F. (2017). PENENTUAN RUTE OPTIMAL DISTRIBUSI PRODUK NESTLE DENGAN METODE TRAVELING SALESMAN PROBLEM (TSP) (Studi Kasus: PT. Paris Jaya Mandiri). Arika, 11(1), 35–44. https://doi.org/10.30598/arika.2017.11.1.35
Pitaloka, D. K., & Koesdijarto, R. (2022). IMPLEMENTASI TRAVELLING SALESMAN PROBLEM ( TSP ) DENGAN ALGORITMA GENETIKA MENGGUNAKAN PETA LEAFLET ( Studi Kasus PT. AMZ Geoinfo Solution Surabaya ) Pendahuluan Traveling salesman problem ( TSP ) adalah salah satu masalah optimasi kombinatorial. Jika d. 1(September), 767–776.
Restu Hadi Saputra, Jumadil Nangi, LM. B. A. (2017). Penerapan Algoritma Branch and Bound Dalam Menentukan Jalur Terpendek Untuk Melakukan Pencarian Penginapan Dan Hotel Di Kota Kendari. semanTIK, 3(1), 127–134.
Ristriana Pattisinai, A., & Khoirun Nisa, M. (2019). Proses Distribusi dan Strategi Optimasi Pengiriman Paket dan Dokumen Dalam Negeri pada Kantor Pos Besar Surabaya Utara 60000. Jurnal Manajemen Aset Infrastruktur & Fasilitas, 3(1), 37–49. https://doi.org/10.12962/j26151847.v3i1.5161
Rohman, S., Zakaria, L., Asmiati, A., & Nuryaman, A. (2020). Optimisasi Travelling Salesman Problem dengan Algoritma Genetika pada Kasus Pendistribusian Barang PT. Pos Indonesia di Kota Bandar Lampung. Jurnal Matematika Integratif, 16(1), 61. https://doi.org/10.24198/jmi.v16.n1.27804.61-73
Siraj, Muh. M., & Astuti, Y. P. (2020). Penentuan Biaya Transportasi Minimum Pada Pemilihan Rute Pengiriman Menggunakan Metode Clark and Wright Saving Heuristic. MATHunesa: Jurnal Ilmiah Matematika, 8(1), 7–16. https://doi.org/10.26740/mathunesa.v8n1.p7-16
Sudjono, H., & Noor, S. (2011). Penerapan Supply Chain Management Pada Proses Manajemen Distribusi Dan Transportasi Untuk Meminimasi Waktu Dan Biaya Pengiriman. Jurnal Poros Teknik, 3(1), 26–33.
Yumalia, A. (2017). Minimasi Biaya Distribusi Dengan Menggunakan Metode Traveling Salesman Problem ( TSP ). Jurnal UMJ, November 2017, 1–8.
