Product Distribution Route Optimization Using The Traveling Salesman Problem (Tsp) Method At Pt. Inbisco Niagatama Semesta (Mayora Group) In Makassar
DOI:
https://doi.org/10.56882/jisem.v3i1.27Keywords:
Product Distribution, Travelling Salesman Problem, Route Optimization, operational efficiency , transportation costsAbstract
In industry, the effective use of distribution channels is a key factor in reducing transportation costs. This research aims to optimize the product distribution routes of PT. Inbisco Niagatama Semesta (Mayora Group) using the Traveling Salesman Problem (TSP) Method. Product distribution is an important element in the supply chain, and this research can help improve operational efficiency and reduce company costs. Companies face various challenges such as variations in distribution quantities, capacity constraints, tight delivery times, and demand fluctuations. By analyzing distribution data, this research aims to find optimal distribution routes that minimize travel distance and distribution costs. The results of this research show that the shortest route obtained from calculations using the traveling salesman problem branch and bound method of WinQsb software obtained distribution delivery route results that had been calculated with a total distance of 88.40 km with a predetermined delivery route and obtained a total travel time of 132. 6 minutes and fuel consumption at a cost of Rp. 60.112
References
C. B. K. Wulandari, “Penentuan Rute Distribusi Menggunakan Metode Nearest Neighbors dan Metode Branch and Bound Untuk Meminimumkan Biaya Distribusi di PT. X,” J. Optimasi Tek. Ind., vol. 2, no. 1, p. 7, 2020, doi: 10.30998/joti.v2i1.3848.
S. Syam, “Pengaruh Efektifitas Dan Efisiensi Kerja Terhadap,” J. Ilmu Manaj., vol. 4, no. 2, pp. 128–152, 2020, [Online]. Available: https://core.ac.uk/download/pdf/327110949.pdf.
S. Syaifuddin, “Analisis Faktor-Faktor Yang Mempengaruhi Efisiensi Kerja Karyawan Pada Pt. Petro Fajar Berlian, Medan,” SULTANIST J. Manaj. dan Keuang., vol. 4, no. 2, pp. 50–58, 2018, doi: 10.37403/sultanist.v4i2.73.
F. M. Othman, N. A. Mohd-Zamil, S. Z. A. Rasid, A. Vakilbashi, and M. Mokhber, “Data envelopment analysis: A tool of measuring efficiency in banking sector,” Int. J. Econ. Financ. Issues, vol. 6, no. 3, pp. 911–916, 2016.
A. Wibowo, I. Cholissodin, and B. Rahayudi, “Optimasi Multiple Travelling Salesman Problem ( M-TSP ) Pada Angkutan Sekolah Dengan Algoritme Genetika ( Studi Kasus : Yayasan Pembina Muslim Daarussalaam Sangatta ),” vol. 3, no. 7, 2019.
P. N. Rattu, N. R. Pioh, and S. Sampe, “Optimalisasi Kinerja Bidang Sosial Budaya dan Pemerintahan dalam Perencanaan Pembangunan (Studi di Kantor Badan Perencanaan Pembangunan, Penelitian dan Pengembangan Daerah Kabupaten Minahasa),” J. Gov., vol. 2, no. 1, pp. 1–9, 2022.
T. Wildan and Albari, “Jurnal Ilmu Komputer, Ekonomi dan Manajemen (JIKEM),” J. Ilmu Komputer, Ekon. dan Manaj., vol. 3, no. 1, pp. 551–563, 2023.
I. Surya and K. Idris, “Optimasi Pendistribusian Barang Menggunakan Algoritma Artificial Bee Colony,” J. Inform. Upgris, vol. 5, no. 2, pp. 157–162, 2019.
A. Kurnia and D. Ernawati, “Perencanaan Rute Distribusi Yang Optimal Dengan Metode Algoritma Differential Evolution (De) Pt. Xyz,” Juminten, vol. 2, no. 4, pp. 73–84, 2021, doi: 10.33005/juminten.v2i4.244.
D. Alexander, O. Turang, and S. R. Astari, “Sistem Manajemen Inventory Menggunakan,” vol. 2018, no. November, pp. 1–12, 2018.
T. A. Gani and Y. Away, “Fitness sharing ApplicationFor diversity Control with Evolutionary Algorithm To ResolveTravelling Salesman problem ( TSP ),” J. J-Innovation, vol. 5, no. 1, pp. 1–7, 2016.
P. Studi, I. Komputer, J. Matematika, and U. Brawijaya, “Agus Wahyu Widodo , ** Wayan Firdaus Mahmudy,” Tourism, vol. 5, no. 4, pp. 205–211, 2010.
B. W. Lattan, J. M. Tupan, and D. B. Paillin, “Pemecahan Traveling Salesmen Problem Menggunakan Teknik Branch and Bound Dan Cheapest Insertion Heuristic,” I Tabaos, vol. 1, no. 1, pp. 13–22, 2021, doi: 10.30598/i-tabaos.2021.1.1.13-22.
A. Zuserain, W. Winarno, B. Nugraha, and A. Momon, “Analisa Optimalisasi Keuntungan dengan Integer Linear Programming dan Metode Branch and Bound pada Toko Bunga QuinnaStory,” J. Ind. Serv., vol. 6, no. 2, p. 99, 2021, doi: 10.36055/62003.
A. Sinaga, “Analisis Penyelesaian Pada Permasalahan Pure Integer Linear Programming Dengan Menggunakan Metode Branch And Bound Dan Cutting Plane,” Bhs. dan Mat., vol. 1, no. 5, pp. 104–116, 2023, [Online]. Available: https://doi.org/10.61132/arjuna.v1i5.168.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Journal of Industrial System Engineering and Management
This work is licensed under a Creative Commons Attribution 4.0 International License.
