OPTIMASI RUTE TERPENDEK JALUR DISTRIBUSI OBAT-OBATAN DENGAN METODE TRAVELING SALESMAN PROBLEM ALGORITMA TABU SEARCH

Article Sidebar

DOWNLOAD
Published: 2026-01-14
DOI: https://doi.org/10.24912/k4xchb37
Keywords:
Tabu search algorithm, Distribution, Traveling salesman problem
Dimensions
Altmetrics
Statistics
Read Counter : 3
Download : 10
Crossmark/ Data Version

Main Article Content

Vera Devani
Program Studi Teknik Industri, Universitas Islam Negeri Sultan Syarif Kasim Riau
Atika Muthia Sari
Program Studi Teknik Industri, Universitas Islam Negeri Sultan Syarif Kasim Riau

Abstract

The company processes the distribution of medicines using the FIFO (First In First Out) system. This can enable the distribution route for medicines to be longer because delivery is based on an order list. Traveling Salesman Problem Method The Tabu Search algorithm is a method that can be used to solve distribution problems, by evaluating each iteration until the optimal route is found. To find out the distribution route for medicines with the shortest distance and time. The results of this research show that the optimal distribution route for this company is 23.3 km and the travel time is 55 minutes on the route from Distributor - PT. Awal Bros Putra Medika – Tabrani Hospital – PT. Ekamas International Hospital – Awal Bros A. Yani Hospital - ASEAN Pharmacy. Meanwhile, based on real conditions, the salesman's distribution route covers a distance of 23.9 km and a travel time of 63 minutes on the route from Distributor - PT. Awal Bros Putra Medika – Tabrani Hospital – PT. Ekamas International Hospital – Awal Bros A. Yani Hospital - ASEAN Pharmacy. From the two distribution routes, it was found that the difference in travel distance was 0.6 km and travel time was 8 minutes.

Article Details

Issue

Vol. 13 No. 2 (2025): Jurnal Ilmiah Teknik Industri : Jurnal Keilmuan Teknik dan Manajemen Industri

Section

Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

All publications by Jurnal Ilmiah Teknik Indsutri (Jurnal Keilmuan Teknik dan Manajemen Industri ) [p-ISSN: 2337-5841, e-ISSN: 2355-6528] is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

References

[1] N. Tegar, Panduan Lengkap Manajemen Distribusi, Yogyakarta: Anak Hebat Indonesia, 2019.

[2] D. Rahmalia and T. Herlambang, Riset Operasi dan Komputasi, Surabaya: Kresna Bina Insan Prima, 2020.

[3] W. Setiawan and I.B.G. Manuaba, “Implementasi Algoritma Tabu Search Pada Masalah Penjual Keliling (Studi Kasus: Tur Perjalanan di Bali),” Prosiding Konferensi Internasional Sains, Teknologi dan Humaniora, pp. 1-3, 2019.

[4] R.P. Ritonga, M. Zakaria and Syukriah. “Penugasan Rute Distribusi Menggunakan Algoritma Tabu Search Pada PT. Yakult Indonesia Persada Cabang Lhokseumawe,” Industrial Engineering Journal, vol. 10, no. 1, 2021.

[5] A.W. Aranski, “Optimization of The Smallest Road Using The Traveling Salesman Problem (TSP) Method,” International Journal of Information System & Technology, vol. 6, no. 1, pp. 159-166, 2022.

[6] A.W. Purnama and A.R. Mamesah, “Penentuan Rute Pengiriman Day Old Chicken di CV. Missouri dengan Pendekatan Metode Algoritma Tabu Search,” Jurnal Manajemen Logistik dan Transportasi, vol. 8, no. 2, pp. 86-105, 2022.

[7] U.I. Abdul, M.R. Katili and D. Wungguli, “Optimasi Rute Pendistribusian BBM Menggunakan Algoritma Tabu Search dan Cheapest Insertion Heuristic,” Jurnal Pendidikan Matematika dan Matematika, vol. 7, no. 1, pp. 1-14, 2023.

[8] A.H. Musthofa, P.S. Puspitorini and I.B. Efendi, “Penentuan Rute Terpendek Guna Menentukan Penjadwalan Distribusi Kertas Kemasan Menggunakan Metode Cheapest Insertion Heuristic (CIH) Algoritm dan Distribution Requirement Planning (DRP),” Jurnal Ilmiah Teknik Industri, pp. 36-47, 2020.

[9] Wamiliana, Minimum Spanning Tree & Desain Jaringan, Bandarlampung: Pustaka Media, 2022.

[10] F. Daniel., and P.N.L. Taneo, Teori Graf, Yogyakarta: Deepublish, 2019.

[11] R. Ekawati and Y. Arkeman, “Travelling Salesman Problem in The Case of Refined Sugar Shipment From Distribution Centers for The Beverage Industries,” Journal Industrial Servicess, vol. 6, no. 1, pp. 9-12, 2020.

[12] S.E. Ramadhania and S. Rani, “Implementasi Kombinasi Algoritma Genetika dan Tabu Search untuk Penyelesaian Travelling Salesman Problem,” Jurnal Penelitian, vol. 2, no. 1, pp. 1-8, 2021.

[13] S. Wulandari, Helmi and Yudhi, “Penyelesaian Multiple Travelling Salesman Problem (MULTI-TSP) dengan Metode Order Crossover dalam Algoritma Genetika,” Jurnal Ilmiah Matematika Statistik dan Terapannya, vol. 8, no. 2, pp. 157-166, 2019.

[14] D.K. Pitaloka and R. Koesdijarto, “Implementasi Travelling Salesman Problem (TSP) dengan Algoritma Genetika Menggunakan Peta Leaflet (Studi Kasus PT. AMZ Geoinfo Solution Surabaya),” Pros. Senakama, vol. 1, pp. 767-776 , 2022.

[15] S.N. Afif, M.I. Ats-Tasuri and S. Hadiwijaya, “Optimasi Rute Pengiriman Produk Komponen Otomotif (Travelling Salesman Problem) Melalui Pendekatan Heuristik,” Jurnal Teknik Industri, vol. 3, no. 1, pp. 38-46, 2022.

[16] J.E. Simarmata, Buku Ajar Riset Operasi dengan Excel dan POM-QM, Sumatera Barat: Mitra Cendikia Media, 2022.

[17] Eryn, A. Handjojo and T. Octavia, “Perbandingan Metode Tabu Search dengan Metode Hungarian Algorithm untuk Penentuan Driver Assignment pada Simulasi Taksi Online,” Jurnal INFRA, vol. 8, no. 1, pp. 1-6, 2020.

[18] I. Gunawan, Sumarno, H.S. Tambunan and D. Hartama, Mogograf Algoritma Tabu Search, Jawa Barat: Penerbit Adab, 2022.