Distribusi Produk Menggunakan Metode Travelling Salesman Problem (TSP) Dengan Konsep Algoritma Heuristik

Y Yendrizal(1*),

(1) Akademi Manajemen Informatika dan Komputer, Solok, Sumatra Barat, Indonesia
(*) Corresponding Author

Abstract


Searching for solutions in determining the shortest route in product distribution is often found in everyday life. Solutions to solve problems can be designed in the form of diagrams consisting of lines and central points. Examples include finding the shortest route (Traveling salesman problem (TSP). The concept of the Traveling Salesman Problem (TSP) is a classic problem of finding the shortest route that a salesman can take when want to visit several cities without having to visit the same city more than once. The problem that often occurs is that the delivery of goods must be on time to the destination, however, because the locations to be addressed are so many and spread across each region, it makes it very difficult for distributors to deliver. goods according to the specified time, the research objective is expected to be able to help distributors in finding the smallest route for delivering goods both in terms of time and saving gasoline, providing distribution route solution options that can minimize delays in goods delivery and optimize human resource transportation facilities. The Heuristic Algorithm produces the best solution to problems which are part of a more complex problem where delivery of orders from distributors to consumers is maximized. The final result of the TSP process is 240 CBDA=240. This method can help in finding the smallest route solution in distributing goods so that it can be used as a reference to get the best results

Full Text:

PDF

References


D. T. Wiyanti, “Algoritma Optimasi Untuk Penyelesaian Travelling Salesman Problem,” J. Transform., Vol. 11, No. 1, P. 1, 2013, Doi: 10.26623/Transformatika.V11i1.76.

Zulkarnaen Zulkarnaen And Muhammad Azmi, “Implementasi Algoritma I-Sos Dalam Penyelesaian Traveling Salesman Problem (Tsp),” Tek. Teknol. Inf. Dan Multimed., Vol. 2, No. 1, Pp. 1–7, 2021, Doi: 10.46764/Teknimedia.V2i1.29.

P. M. R. Raditya And C. Dewi, “Optimasi Multiple Travelling Salesman Problem ( M-Tsp ) Pada Penentuan Rute Optimal Penjemputan Penumpang Travel Menggunakan Algoritme Genetika,” J. Pengemb. Teknol. Inf. Dan Ilmu Komput., Vol. 2, No. 10, Pp. 3560–3568, 2018.

C. Sitompul And O. M. Horas, “A Vehicle Routing Problem With Time Windows Subject To The Constraint Of Vehicles And Good’s Dimensions,” Int. J. Technol., Vol. 12, No. 4, Pp. 865–875, 2021, Doi: 10.14716/Ijtech.V12i4.4294.

D. Wawan Saputra, “Optimalisasi Rute Distribusi Kurir Menggunakan Metode Traveling Salesman Problem (Studi Kasus: Jne Balige),” G-Tech J. Teknol. Terap., Vol. 6, No. 2, Pp. 159–165, 2022, Doi: 10.33379/Gtech.V6i2.1577.

A. W. Aranski, “Optimization Of The Smallest Road Using The Traveling Salesman Problem (Tsp) Method,” Int. J. Inf. Syst. Technol. Akreditasi, Vol. 6, No. 158, Pp. 159–166, 2022.

R. N. B. Sitepua And G. N. A. C. Putra, “Penentuan Rute Terpendek Menggunakan Algoritma A Star,” J. Nas. Teknol. Inf. Dan Apl., Vol. 1, No. November, Pp. 431–440, 2022.

K. K. Amozhita, A. Suyitno, And Mashuri, “Menyelesaikan Travelling Salesman Problem (Tsp) Dengan Metode Dua Sisi Optimal Pada Pt. Es Malindo Boyolali,” Unnes J. Math., Vol. 8, No. 1, Pp. 20–29, 2019.

L. G. A. Candrawati And I. G. A. G. A. Kadyanan, “Optimasi Traveling Salesman Problem (Tsp) Untuk Rute Paket Wisata Di Bali Dengan Algoritma Genetika,” J. Ilm. Komput., Vol. 10, No. 1, Pp. 27–32, 2017.

E. Sanggala, “Penyelesaian Travelling Salesman Problem (Tsp)Dengan Evolutionary Algorithm & Excel Solver(Studi Kasus: Ak-47-Tsp Instance),” J. Inov. Tek. Ind., Vol. 2, No. 2, Pp. 47–62, 2023.

Indah Setyorini, “15-Article Text-117-1-10-20210105,” J. Ilm. Mat. Dan Pendidik., Vol. 1, No. 1, Pp. 14–18, 2020.

G. Muhamad Adzaky, O. Traveling Salesman Problem, And R. Wahid Saleh Insani, “Optimasi Traveling Salesman Problem (Tsp) Menggunakan Algoritma Genetika Dan Google Maps Api Untuk Kurir Ekspedisi Pada J&T Paris 2 Berbasis Web Gis,” Inser. Inf. Syst. Emerg. Technol. J., Vol. 4, No. 2, P. 119, 2023.

I. N. Sutapa, I. G. A. Widyadana, And C. Christine, “Studi Tentang Travelling Salesman Dan Vehicle Routing Problem Dengan Time Windows,” J. Tek. Ind., Vol. 5, No. 2, Pp. 81–89, 2004, Doi: 10.9744/Jti.5.2.81-89.

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, No. September, Pp. 767–776, 2022.

G. E. Yuliastuti, W. F. Mahmudy, And A. M. Rizki, “Penanganan Fuzzy Time Window Pada Travelling Salesman Problem (Tsp) Dengan Penerapan Algoritma Genetika,” Matics, Vol. 9, No. 1, P. 38, 2017, Doi: 10.18860/Mat.V9i1.4072.

V. Wati, Y. Yuliana, P. Paradise, And K. Kusrini, “Travelling Salesman Problem (Tsp) Optimization Seed Dis-Tribution Using Genetic Algorithm,” Jurteksi (Jurnal Teknol. Dan Sist. Informasi), Vol. 8, No. 3, Pp. 359–368, 2022, Doi: 10.33330/Jurteksi.V8i3.1738.

R. G. Utomo, D. S. Maylawati, And C. N. Alam, “Implementasi Algoritma Cheapest Insertion Heuristic (Cih) Dalam Penyelesaian Travelling Salesman Problem (Tsp),” J. Online Inform., Vol. 3, No. 1, P. 61, 2018, Doi: 10.15575/Join.V3i1.218.

S. W. H. Yudhi, “Penyelesaian Multiple Travelling Salesman Problem (Multi-Tsp) Dengan Metode Order Crossover Dalam Algoritma Genetika (Studi Kasus: Data Pelanggan Agen Surat Kabar Di Kota Singkawang),” Bimaster Bul. Ilm. Mat. Stat. Dan Ter., Vol. 8, No. 2, Pp. 157–166, 2019, Doi: 10.26418/Bbimst.V8i2.31310.

K. Auliasari, M. Kertaningtyas, And D. W. L. Basuki, “Optimalisasi Rute Distribusi Produk Menggunakan Metode Traveling Salesman Problem,” J. Sains, Teknol. Dan Ind., Vol. 16, No. 1, P. 15, 2018, Doi: 10.24014/Sitekin.V16i1.6109.




DOI: https://doi.org/10.30645/kesatria.v5i3.407

DOI (PDF): https://doi.org/10.30645/kesatria.v5i3.407.g403

Refbacks

  • There are currently no refbacks.


Published Papers Indexed/Abstracted By: